Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Concurrency, Specification and Programming (CS&P)
Guest editors: Ludwik Czaja, Wojciech Penczek and Krzysztof Stencel
Article type: Research Article
Authors: Bazan, Jan G.a; * | Szpyrka, Marcinb | Szczur, Adamc | Dydo, Lukaszc | Wojtowicz, Hubertc
Affiliations: [a] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. bazan@ur.edu.pl | [b] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. adamszczur8@gmail.com, ldydo@ur.edu.pl, hubert.wojtowicz@gmail.com | [c] Department of Applied Computer Science, AGH University of Science and Technology, Mickiewicza 30, 30-059 Kraków, Poland and Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. mszpyrka@agh.edu.pl
Correspondence: [*] Address for correspondence: Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland
Abstract: A new method of constructing classifiers from huge volume of temporal data is proposed in the paper. The novelty of introduced method finds expression in a multi-stage approach to build hierarchical classifiers that combines process mining, feature extraction based on temporal patterns and constructing classifiers based on a decision tree. Such an approach seems to be practical when dealing with huge volume of temporal data. As a proof of concept a system for packet-based network traffic anomaly detection was constructed, where anomalies are represented by spatio-temporal complex concepts and called by behavioral patterns. Hierarchical classifiers constructed with the new approach turned out to be better than “flat” classifiers based directly on captured network traffic data.
Keywords: classifiers, huge temporal data, temporal patterns, state graphs, behavioral patterns, LTL temporal logic
DOI: 10.3233/FI-2016-1301
Journal: Fundamenta Informaticae, vol. 143, no. 1-2, pp. 19-34, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl