Combining Machine and Automata Learning for Network Traffic Classification - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2020

Combining Machine and Automata Learning for Network Traffic Classification

Abstract

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.
Fichier principal
Vignette du fichier
495613_1_En_2_Chapter.pdf (545.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03165385 , version 1 (10-03-2021)

Licence

Attribution

Identifiers

Cite

Zeynab Sabahi-Kaviani, Fatemeh Ghassemi, Zahra Alimadadi. Combining Machine and Automata Learning for Network Traffic Classification. 3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.17-31, ⟨10.1007/978-3-030-57852-7_2⟩. ⟨hal-03165385⟩
39 View
44 Download

Altmetric

Share

Gmail Facebook X LinkedIn More