Abstract
In this work, a new mechanism, which consists of Preprocessing Phase, Two-Layer Pattern Discovering Phase (2LPD), and Pattern Explanation Phase, is proposed to discover unknown patterns. Two heuristics are proposed to detect outlier users in 2LPD Phase. Next, we are also concerned about subsequences of user’s behaviors in this phase. As the patterns which are previously unknown have been discovered in 2LPD Phase, they will be incrementally feedbacked to knowledge base for further detection. Through this incremental learning mechanism, the known patterns can be increased.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
ACM: KDD cup 1999 data, http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html (2000)
R. Agrawal and R. Srikant: Mining sequential patterns. Proc. of 7th IEEE International Conference on Data Engineering, (1995) 3–14
CERT: http://www.cert.org/ (2001)
A. K. Jain and R. C. Dubes (eds.): Algorithms for Clustering Data. Prentice-Hill, Englewood Cliffs, N.J. (1988)
W. Lee, S. J. Stolfo, and K. W. Mok: A data mining framework for building intrusion detection models. Proc. of 1999 IEEE Symposium on Security and Privacy, (1999)
Y. T. Lin, S. S. Tseng, and S. C. Lin: An intrusion detection model based upon intrusion detection markup language (IDML). Journal of Information Science and Engineering Vol. 17, No. 6, (2001) 899–919
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, SC., Tseng, SS., Lin, YT. (2002). A New Mechanism of Mining Network Behavior. In: Chen, MS., Yu, P.S., Liu, B. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2002. Lecture Notes in Computer Science(), vol 2336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47887-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-47887-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43704-8
Online ISBN: 978-3-540-47887-4
eBook Packages: Springer Book Archive