<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03165385</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-15T20:00:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Combining Machine and Automata Learning for Network Traffic Classification</title>
            <author role="aut">
              <persName>
                <forename type="first">Zeynab</forename>
                <surname>Sabahi-Kaviani</surname>
              </persName>
              <idno type="halauthorid">1344427-0</idno>
              <affiliation ref="#struct-301046"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fatemeh</forename>
                <surname>Ghassemi</surname>
              </persName>
              <email type="md5">72302263d1e9126938182c7d0616b1ee</email>
              <email type="domain">ut.ac.ir</email>
              <idno type="idhal" notation="numeric">999433</idno>
              <idno type="halauthorid" notation="string">1118338-999433</idno>
              <affiliation ref="#struct-301046"/>
              <affiliation ref="#struct-347507"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Zahra</forename>
                <surname>Alimadadi</surname>
              </persName>
              <idno type="halauthorid">2168535-0</idno>
              <affiliation ref="#struct-301046"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-03-10 16:05:20</date>
              <date type="whenModified">2021-05-25 12:28:02</date>
              <date type="whenReleased">2021-03-10 16:08:54</date>
              <date type="whenProduced">2020-07-01</date>
              <date type="whenEndEmbargoed">2023-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-03165385v1/document">
                <date notBefore="2023-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03165385v1/file/495613_1_En_2_Chapter.pdf" id="file-3165385-2775462">
                <date notBefore="2023-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03165385</idno>
            <idno type="halUri">https://inria.hal.science/hal-03165385</idno>
            <idno type="halBibtex">sabahikaviani:hal-03165385</idno>
            <idno type="halRefHtml">&lt;i&gt;3rd International Conference on Topics in Theoretical Computer Science (TTCS)&lt;/i&gt;, Jul 2020, Tehran, Iran. pp.17-31, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-57852-7_2"&gt;&amp;#x27E8;10.1007/978-3-030-57852-7_2&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.17-31, &amp;#x27E8;10.1007/978-3-030-57852-7_2&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-3165385-2775462"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC1" corresp="IFIP-TC">IFIP TC1: Foundations of Computer Science</idno>
            <idno type="stamp" n="IFIP-WG1-8">IFIP-WG1-8</idno>
            <idno type="stamp" n="IFIP-TTCS">IFIP-TTCS</idno>
            <idno type="stamp" n="IFIP-LNCS-12281" corresp="IFIP-LNCS">Topics in Theoretical Computer Science</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Combining Machine and Automata Learning for Network Traffic Classification</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Zeynab</forename>
                    <surname>Sabahi-Kaviani</surname>
                  </persName>
                  <idno type="halauthorid">1344427-0</idno>
                  <affiliation ref="#struct-301046"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fatemeh</forename>
                    <surname>Ghassemi</surname>
                  </persName>
                  <email type="md5">72302263d1e9126938182c7d0616b1ee</email>
                  <email type="domain">ut.ac.ir</email>
                  <idno type="idhal" notation="numeric">999433</idno>
                  <idno type="halauthorid" notation="string">1118338-999433</idno>
                  <affiliation ref="#struct-301046"/>
                  <affiliation ref="#struct-347507"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Zahra</forename>
                    <surname>Alimadadi</surname>
                  </persName>
                  <idno type="halauthorid">2168535-0</idno>
                  <affiliation ref="#struct-301046"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>3rd International Conference on Topics in Theoretical Computer Science (TTCS)</title>
                  <date type="start">2020-07-01</date>
                  <date type="end">2020-07-02</date>
                  <settlement>Tehran</settlement>
                  <country key="IR">Iran</country>
                </meeting>
                <editor>Luís S. Barbosa</editor>
                <editor>Mohammad Ali Abam</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Topics in Theoretical Computer Science</biblScope>
                  <biblScope unit="volume">LNCS-12281</biblScope>
                  <biblScope unit="pp">17-31</biblScope>
                  <date type="datePub">2020</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-57852-7_2</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Model inference</term>
                <term xml:lang="en">Traffic classification</term>
                <term xml:lang="en">Machine learning</term>
                <term xml:lang="en">Automata learning</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Viewing the generated packets of an application as the words of a language, automata learning can be used to derive the behavioral packet-based model of applications. The alphabets of the learned automata, manually defined in terms of packets, may cause overfitting. As some packets always appear together, we apply machine learning techniques to automatically define the alphabet set based on the timing and statistical features of packets. Using the learned automata models, the classifier should detect the accepted words of the models in the input. To improve this time-consuming process, we present a framework, called NeTLang, that identifies the application model in terms of k-testable languages. The classification problem is reduced to observing only $$\varTheta (k)$$ symbols from the input with the help of machine learning techniques. Our framework utilizes the two diverse automata learning and machine learning techniques to build on their strengths (to be fast and accurate) and to eliminate their weaknesses (i.e., ignoring temporal relations among packets). According to our results, NeTLang outperforms the state-of-the-art methods using each technique alone.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.8</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-301046" status="VALID">
          <idno type="ROR">https://ror.org/05vf56z40</idno>
          <orgName>University of Tehran</orgName>
          <desc>
            <address>
              <addrLine>16th Azar St., Enghelab Sq., Tehran</addrLine>
              <country key="IR"/>
            </address>
            <ref type="url">http://ut.ac.ir/en</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-347507" status="VALID">
          <idno type="ROR">https://ror.org/04xreqs31</idno>
          <orgName>Institute for Research in Fundamental Sciences [Tehran]</orgName>
          <orgName type="acronym">IPM</orgName>
          <date type="start">1989-01-01</date>
          <desc>
            <address>
              <addrLine>Niavaran Square Tehran</addrLine>
              <country key="IR"/>
            </address>
            <ref type="url">http://www.ipm.ac.ir/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>