Abstract
Graph-based anomaly detection plays a vital role in various application domains such as network intrusion detection, social network analysis and road traffic monitoring. Although these evolving networks impose a curse of dimensionality on the learning models, they usually contain structural properties that anomaly detection schemes can exploit. The major challenge is finding a feature extraction technique that preserves graph structure while balancing the accuracy of the model against its scalability. We propose the use of a scalable technique known as random projection as a method for structure aware embedding, which extracts relational properties of the network, and present an analytical proof of this claim. We also analyze the effect of embedding on the accuracy of one-class support vector machines for anomaly detection on real and synthetic datasets. We demonstrate that the embedding can be effective in terms of scalability without detrimental influence on the accuracy of the learned model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chandola, V., Banerjee, A., Kumar, V.: Anomaly Detection: A Survey. ACM Computing Surveys 4(3), 1–58 (2009)
Ding, Q., Katenka, N., Barford, P., Kolaczyk, E.D., Crovella, M.: Intrusion as (anti)social communication: characterization and detection. In: Proceedings of the 18th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 886–894 (2012)
Henderson, K., Eliassi-Rad, T., Faloutsos, C., Akoglu, L., Li, L., Maruhashi, K., Prakash, B.A., Tong, H.: Metricforensics: a multi-level approach for mining volatile graphs. In: Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 163–172 (2010)
Aggarwal, C.C., Zhao, Y., Yu, and P.S.: Outlier detection in graph streams. In: Proceedings of the 27th International Conference on Data Engineering (ICDE), pp. 399–409 (2011)
Shaw, B., Jebara, T.: Minimum volume embedding. In: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, pp. 460–467 (2007)
Shaw, B., Jebara, T.: Structure preserving embedding. In: Proceedings of the 26th International Conference on Machine Learning, pp. 937–944 (2009)
Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in Modern Analysis and Probability, pp. 189–206 (1984)
Schlkopf, B., Williamson, R.C., Smola, A., Shawe-Taylor, J.: Support vector method for novelty detection. In: NIPS, vol. 12, pp. 582–588 (1999)
Cook, D., Holder, L.: Mining Graph Data. Wiley (2007)
Kang, U., Faloutsos, C.: Big graph mining: algorithms and discoveries. ACM SIGKDD Explorations Newsletter 14(2), 29–36 (2012)
Riesen, K., Bunke, H.: Classification and clustering of vector space embedded graphs. In: Emerging Topics in Computer Vision and Its Applications, pp. 49–70. World Scientific (2012)
Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific (2007)
Moshtaghi, M., Leckie, C., Karunasekera, S., Bezdek, J.C., Rajasegarar, S., Palaniswami, M.: Incremental elliptical boundary estimation for anomaly detection in wireless sensor networks. In: Proceedings of the 11th IEEE International Conference on Data Mining, pp. 467–476 (2011)
Rajasegarar, S., Leckie, C., Bezdek, J.C., Palaniswami, M.: Centered Hyperspherical and Hyperellipsoidal One-Class Support Vector Machines for Anomaly Detection in Sensor Networks. IEEE Transactions on Information Forensics and Security 5(3), 518–533 (2010)
Akoglu, L., Tong, H., Koutra, D.: Graph-based Anomaly Detection and Description: A Survey. Data Mining and Knowledge Discovery, pp. 1–63 (2014)
Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society (1997)
Belkin, M., Niyogi, P.: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Computation, pp. 1373–1396 (2002)
Newman, M.: Modularity and community structure in networks. In: Proceedings of the National Academy of Sciences, vol. 23, pp. 8577–8582 (2006)
Chan, J., Liu, W., Kan, A., Leckie, C., Bailey, J., Ramamohanarao, K.: Discovering latent blockmodels in sparse and noisy graphs using non-negative matrix factorisation. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 811–816 (2013)
Achlioptas, D.: Database-friendly Random Projections: Johnson-Lindenstrauss with Binary Coins. Journal of Computer and System Sciences 66(4), 671–687 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rashidi, L., Rajasegarar, S., Leckie, C. (2015). An Embedding Scheme for Detecting Anomalous Block Structured Graphs. In: Cao, T., Lim, EP., Zhou, ZH., Ho, TB., Cheung, D., Motoda, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2015. Lecture Notes in Computer Science(), vol 9078. Springer, Cham. https://doi.org/10.1007/978-3-319-18032-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-18032-8_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18031-1
Online ISBN: 978-3-319-18032-8
eBook Packages: Computer ScienceComputer Science (R0)