Abstract
Mining graph data has been an important data mining task due to its significance in network analysis and many other contemporary applications. Detecting anomalies in graph data is challenging due to the unsupervised nature of the problem and the size of the data itself to be dealt with. Recent research efforts in this direction have explored graph data for identifying anomalous nodes and anomalous edges of a given graph. However, in many real life applications where the data is inherently networked in nature, the requirement is to detect anomalous sub-graphs with distinguishing characteristics such as near cliques, etc. In this context, we propose a novel method for addressing the anomalous sub-graph mining problem through community detection by employing the non-negative matrix factorization technique. Anomalous sub-graphs are identified by applying some existing techniques on the detected communities for measuring their deviation from the normal characteristics. We demonstrate the effectiveness of the proposed method through experimental evaluation on various benchmark graph data sets.
Chapter PDF
Similar content being viewed by others
References
Akoglu, L., McGlohon, M., Faloutsos, C.: Oddball: Spotting anomalies in weighted graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS, vol. 6119, pp. 410–421. Springer, Heidelberg (2010)
Albanese, A., Pal, S.K., Petrosino, A.: Rough sets, kernel set and spatio-temporal outlier detection. IEEE Trans. on Knowledge and Data Engineering (2012) (online)
Chandola, V., Banerjee, A., Kumar, V.: Anomaly detection: A survey. ACM Computing Surveys 41(3), 15.1–15.58 (2009)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)
Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)
Leskovec, J.: Stanford network analysis platform, SNAP (2013), http://snap.stanford.edu/data/index.html
McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS, Nevada, USA, pp. 548–556 (2012)
Noble, C.C., Cook, D.J.: Graph-based anomaly detection. In: Proc. SIGKDD, Washington, DC, USA, pp. 631–636 (August 2003)
Rattigan, M.J., Jensen, D.: The case for anomalous link discovery. SIGKDD Explorations 7(2), 41–47 (2006)
Suri, N.N.R.R., Murty, M.N., Athithan, G.: Data mining techniques for outlier detection. In: Zhang, Q., Segall, R.S., Cao, M. (eds.) Visual Analytics and Interactive Technologies: Data, Text and Web Mining Applications, ch. 2, pp. 22–38. IGI Global, New York (2011)
Wang, F., Li, T., Wang, X., Zhu, S., Ding, C.: Community discovery using nonnegative matrix factorization. DMKD 22(3), 493–521 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suri, N.N.R.R., Murty, M.N., Athithan, G. (2013). Mining Anomalous Sub-graphs in Graph Data Using Non-negative Matrix Factorization. In: Maji, P., Ghosh, A., Murty, M.N., Ghosh, K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2013. Lecture Notes in Computer Science, vol 8251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45062-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-45062-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45061-7
Online ISBN: 978-3-642-45062-4
eBook Packages: Computer ScienceComputer Science (R0)