How to cite this WIREs title:
WIREs Comp Stat

Anomaly detection in dynamic networks: a survey

Advanced Review

Stephen Ranshous, Shitian Shen, Danai Koutra, Steve Harenberg, Christos Faloutsos, Nagiza F. Samatova

Published Online: Mar 21 2015

DOI: 10.1002/wics.1347

Full article on Wiley Online Library: HTML PDF

Can't access this content? Tell your librarian.

Anomaly detection is an important problem with multiple applications, and thus has been studied for decades in various research domains. In the past decade there has been a growing interest in anomaly detection in data represented as networks, or graphs, largely because of their robust expressiveness and their natural ability to represent complex relationships. Originally, techniques focused on anomaly detection in static graphs, which do not change and are capable of representing only a single snapshot of data. As real‐world networks are constantly changing, there has been a shift in focus to dynamic graphs, which evolve over time. In this survey, we aim to provide a comprehensive overview of anomaly detection in dynamic networks, concentrating on the state‐of‐the‐art methods. We first describe four types of anomalies that arise in dynamic networks, providing an intuitive explanation, applications, and a concrete example for each. Having established an idea for what constitutes an anomaly, a general two‐stage approach to anomaly detection in dynamic networks that is common among the methods is presented. We then construct a two‐tiered taxonomy, first partitioning the methods based on the intuition behind their approach, and subsequently subdividing them based on the types of anomalies they detect. Within each of the tier one categories—community, compression, decomposition, distance, and probabilistic model based—we highlight the major similarities and differences, showing the wealth of techniques derived from similar conceptual approaches. WIREs Comput Stat 2015, 7:223–247. doi: 10.1002/wics.1347 This article is categorized under: Algorithms and Computational Methods > Algorithms Data: Types and Structure > Graph and Network Data Statistical Learning and Exploratory Methods of the Data Sciences > Pattern Recognition

Example of an anomalous vertex. A dynamic graph with two time steps showing a vertex, v₆, that is found to be anomalous based on its change in community involvement. In time step 1, v₆ is only part of community 2, whereas in time step 2 it is part of both communities 1 and 2. As no other vertex's community involvement changes, v₆ is deemed anomalous.

[ Normal View | Magnified View ]

The proposed two‐tiered taxonomy that illustrates the layout of the survey. Methods are first categorized based on their overarching approach, then subdivided based on the types of anomalies they detect.

[ Normal View | Magnified View ]

An example of an event (a), a change (b), and the difference between them. In both, the graphs initially have only a few edges. At time step 3, the graphs become highly connected, almost forming a clique. The major difference is observed at the time step following the insertion of the edges. In Figure (a) the edges are then removed and the graph returns to a state similar to the one before the insertion, representing an isolated event. In Figure (b), however, the graph maintains its new state indicating the sustained shift, or change, in the graph.

[ Normal View | Magnified View ]

Two different types of anomalous subgraphs. (a) Shrunken community shows a shrunken community, where a community loses members from one time step to the next. (b) Split community shows a split community, where a single community breaks into several distinct smaller communities.

[ Normal View | Magnified View ]

An illustration of anomalous edges that occur because of an irregular pattern of their weight over time, with anomalous edges highlighted. At each time step, a vertex's weight typically shifts by ± 0.05 at most. However, edge (3, 4) has a spike in its weight at time step 2, unlike any other time in the series. Similarly, at time step 3, edge (1, 4) spikes in value. These spikes cause the edges to be considered anomalous.

[ Normal View | Magnified View ]

References

Cheng, H, Tan, P‐N, Potter, C, Klooster, S. A robust graph‐based algorithm for detection and characterization of anomalies in noisy multivariate time series. In: IEEE International Conference on Data Mining Workshops, Pisa, Italy, 2008, 349–358.
Cheng, H, Tan, P‐N, Potter, C , Klooster, SA. Detection and characterization of anomalies in multivariate time series. In: Proceedings of the 9th SIAM International Conference on Data Mining (SDM), Sparks, NV, 2009, 413–424.
Chen, Z, Hendrix, W, Guan, H, Tetteh, IK, Choudhary, A, Semazzi, F, Samatova, NF. Discovery of extreme events‐related communities in contrasting groups of physical system networks. Data Min Knowl Discov 2013, 27:225–258.
Zhang, T, Zhuang, X, Pande, S, Lee, W. Anomalous path detection with hardware support. In: Proceedings of the 2005 International Conference on Compilers, Architectures and Synthesis for Embedded Systems. New York: ACM; 2005, 43–54.
Ding, Q Katenka, N, Barford, P, Kolaczyk,E, 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), Beijing, China, 2012, 886–894.
Ghoting, A, Eric Otey, M, Parthasarathy, S. Loaded: link‐based outlier and anomaly detection in evolving data sets. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK, 2004, 387–390.
Jing, X, Shelton, CR. Intrusion detection using continuous time Bayesian networks. J Artif Intell Res 2010, 39:745–774.
Priebe, CE, Conroy, JM, Marchette, DJ, Park, Y. Scan statistics on Enron graphs. Comput Math Organ Theory 2005, 11:229–247.
Wang, H, Tang, M, Park, Y, Priebe, CE. Locality statistics for anomaly detection in time series of graphs. arXiv:1306.0267, 2013.
Chen, F, Neill, DB. Non‐parametric scan statistics for event detection and forecasting in heterogeneous social media graphs. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM; 2014, 1166–1175.
Akoglu, L, McGlohon, M, Faloutsos, C. Oddball: spotting anomalies in weighted graphs. In: Advances in Knowledge Discovery and Data Mining. Berlin/Heidelberg: Springer; 2010, 410–421.
Eberle, W, Holder, L. Detecting anomalies in cargo using graph properties. In: Intelligence and Security Informatics. Berlin/Heidelberg: Springer; 2006, 728–730.
Eberle, W, Holder, L. Anomaly detection in data represented as graphs. Intell Data Anal 2007, 11:663–689.
Noble, CC, Cook, DJ. Graph‐based anomaly detection. In: Proceedings of the 9th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Washington, DC, 2003, 631–636.
Barnett, V, Lewis, T. Outliers in Statistical Data, vol. 3. New York: John Wiley %26 Sons; 1994608 p.
Chandola, V, Banerjee, A, Kumar, V. Anomaly detection: a survey. ACM Comput Surv 2009, 41:15.
Chandola, V, Banerjee, A, Kumar, V. Anomaly detection for discrete sequences: a survey. IEEE Trans Knowl Data Eng 2012, 24:823–839.
Chandola, V, Mithal, V, Kumar, V. Comparative evaluation of anomaly detection techniques for sequence data. In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM), Pisa, Italy, 2008, 743–748.
Hawkins, DM. Identification of Outliers, vol. 11. London: Chapman and Hall; 1980.
Akoglu, L, Tong, H, Koutra, D. Graph‐based anomaly detection and description: a survey. Data Min Knowl Discov 2014, 28:1–63.
Bilgin, CC, Yener, B. Dynamic network evolution: models, clustering, anomaly detection. IEEE Netw 2006.
Gupta, M, Gao, J, Aggarwal, CC, Han, J. Outlier Detection for Temporal Data. San Rafael, CA: Morgan %26 Claypool Publishers; 2014.
Hodge, VJ, Austin, J. A survey of outlier detection methodologies. Artif Intell Rev 2004, 22:85–126.
Agyemang, M, Barker, K, Alhajj, R. A comprehensive survey of numeric and symbolic outlier mining techniques. Intell Data Anal 2006, 10:521–538.
Brent West, D. Introduction to Graph Theory, vol. 2. Upper Saddle River, NJ: Prentice Hall; 2001.
Balakrishnan, R, Ranganathan, K. A Textbook of Graph Theory. Berlin/Heidelberg: Springer; 2012.
Cook, DJ, Holder, LB. Mining Graph Data. New York: John Wiley %26 Sons; 2006.
Samatova, NF, Hendrix, W, Jenkins, J, Padmanabhan, K, Chakraborty, A. Practical Graph Mining with R. Boca Raton, FL: CRC Press; 2013.
Fortunato, S. Community detection in graphs. Phys Rep 2010, 486:75–174.
Lancichinetti, A, Fortunato, S. Community detection algorithms: a comparative analysis. Phys Rev E 2009, 80:056117.
Reichardt, J, Bornholdt, S. Statistical mechanics of community detection. Phys Rev E 2006, 74:016110.
Harenberg, S, Bello, G, Gjeltema, L, Ranshous, S, Harlalka, J, Seay, R, Padmanabhan, K, Samatova, N. Community detection in large‐scale networks: a survey and empirical evaluation. WIREs Comput Stat 2014, 6:426–439.
Rissanen, J. Modeling by shortest data description. Automatica 1978, 14:465–471.
Rissanen, J. A universal prior for integers and estimation by minimum description length. Ann Stat 1983, 11:416–431.
Rissanen, J. Minimum‐Description‐Length Principle. New York: John Wiley %26 Sons; 1985.
Grünwald, P. The Minimum Description Length Principle. Cambridge, MA: MIT Press; 2007.
Golub, GH, Reinsch, C. Singular value decomposition and least squares solutions. Numerische Mathematik 1970, 14:403–420.
Klema, V, Laub, AJ. The singular value decomposition: its computation and some applications. IEEE Trans Automatic Control 1980, 25:164–176.
Kolda, TG, Bader, BW. Tensor decompositions and applications. SIAM Rev 2009, 51:455–500.
Gao, X, Xiao, B, Tao, D, Li, X. A survey of graph edit distance. Pattern Anal Appl 2010, 13:113–129.
Rahm, E, Bernstein, PA. A survey of approaches to automatic schema matching. VLDB J 2001, 10:334–350.
Koller, D, Friedman, N. Probabilistic Graphical Models: Principles and Techniques. Cambridge, MA: MIT Press; 2009.
Glaz, J. Scan Statistics. Berlin/Heidelberg: Springer; 2001.
Akoglu, L, Faloutsos, C. Event detection in time series of mobile communication graphs. 27th Army Sci Conf 2010, 2:18.
Gao, J, Liang, F, Fan, W, Wang, C, Sun, Y, Han, J. On community outliers and their efficient detection in information networks. In: Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Seattle, WA, 2010, 813–822.
Ji, T, Yang, D, Gao, J. Incremental local evolutionary outlier detection for dynamic social networks. In: Machine Learning and Knowledge Discovery in Databases. Berlin/Heidelberg: Springer; 2013, 1–15.
Li, X, Li, Z, Han, J, Lee, J‐G. Temporal outlier detection in vehicle traffic data. In: Proceedings of the 25th International Conference on Data Engineering (ICDE), Shanghai, China, 2009, 1319–1322.
James A,, Tina E‐R,, Nishchal D,. Detecting novel discrepancies in communication networks. In: Proceedings of the 10th IEEE International Conference on Data Mining (ICDM), Sydney, Australia, 2010, 8–17.
Rattigan, MJ, Jensen, D. The case for anomalous link discovery. ACM SIGKDD Explor Newsl 2005, 7:41–47.
Heard, NA, Weston, DJ, Platanioti, K, Hand, DJ. Bayesian anomaly detection methods for social networks. Ann Appl Stat 2010, 4:645–662.
Greene, D, Doyle, D, Cunningham, P. Tracking the evolution of communities in dynamic social networks. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2010, 176–183.
Mongiov, M, Bogdanov, P, Ranca, R, Papalexakis, EE, Faloutsos, C, Singh, AK. Netspot: spotting significant anomalous regions on dynamic networks. In: Proceedings of the 13th SIAM International Conference on Data Mining (SDM), Austin, TX, 2013.
Miller, BA, Beard, MS, Bliss, NT. Eigenspace analysis for threat detection in social networks. In: 2011 Proceedings of the 14th International Conference on Information Fusion (FUSION), Chicago, IL, 2011, 1–7.
Ramanathan, A, Agarwal, PK, Kurnikova, M, Langmead, CJ. An online approach for mining collective behaviors from molecular dynamics simulations. J Comput Biol 2010, 17:309–324.
Saligrama, V, Chen, Z. Video anomaly detection based on local statistical aggregates. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Providence, RI, 2012, 2112–2119.
Tran, L, Navasca, C, Luo, J. Video detection anomaly via low‐rank and sparse decompositions. In: Image Processing Workshop (WNYIPW), 2012 Western New York, New York, NY, 2012, 17–20.
Koutra, D, Papalexakis, EE, Faloutsos, C. Tensorsplat: spotting latent anomalies in time. In: 2012 16th Panhellenic Conference on Informatics (PCI), Piraeus, Greece, 2012, 144–149.
Ishibashi, K, Kondoh, T, Harada, S, Mori, T, Kawahara, R, Asano, S. Detecting anomalous traffic using communication graphs. In: Telecommunications: The Infrastructure for the 21st Century (WTC), Vienna, Austria, 2010, 1–6
Suykens, JAK, Vandewalle, J. Least squares support vector machine classifiers. Neural Process Lett 1999, 9:293–300.
Breunig, MM, Kriegel, H‐P, Ng, RT, Sander, J. LOF: identifying density‐based local outliers. In: ACM Sigmod Record, vol. 29. New York: ACM; 2000, 93–104.
Aggarwal, CC, Yu, PS. Outlier detection for high dimensional data. In: ACM Sigmod Record, vol. 30. New York: ACM; 2001, 37–46.
Angiulli, F, Pizzuti, C. Fast outlier detection in high dimensional spaces. In: Principles of Data Mining and Knowledge Discovery. Berlin/Heidelberg: Springer; 2002, 15–27.
Angiulli, F, Pizzuti, C. Outlier mining in large high‐dimensional data sets. IEEE Trans Knowl Data Eng 2005, 17:203–215.
Parsons, L, Haque, E, Liu, H. Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newsl 2004, 6:90–105.
Srivastava, AN. Enabling the discovery of recurring anomalies in aerospace problem reports using high‐dimensional clustering techniques. In: Aerospace Conference, Big Sky, MT, 2006, 17 pp.
Pokrajac, D, Lazarevic, A, Latecki, LJ. Incremental local outlier detection for data streams. In: IEEE Symposium on Computational Intelligence and Data Mining, Orlando, FL, 2007, 504–515.
Duan, D, Li, Y, Jin, Y, Zhengding, L. Community mining on dynamic weighted directed graphs. In: Proceedings of the 1st ACM International Workshop on Complex Networks Meet Information %26 Knowledge Management. New York: ACM; 2009, 11–18.
Aggarwal, CC, Subbian, K. Event detection in social streams. In: Proceedings of the 12th SIAM International Conference on Data Mining (SDM), Anaheim, CA, 2012, 624–635.
Chen, Z, Hendrix, W, Samatova, NF. Community‐based anomaly detection in evolutionary networks. J Intell Inf Syst 2012, 39:59–85.
Gupta, M, Gao, J, Sun, Y, Han, J. Integrating community matching and outlier detection for mining evolutionary community outliers. In: Proceedings of the 18th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Beijing, China, 2012, 859–867.
Gupta, M, Gao, J, Sun, Y, Han, J. Community trend outlier detection using soft temporal pattern mining. In: Machine Learning and Knowledge Discovery in Databases. Berlin/Heidelberg: Springer; 2012, 692–708.
Rossi, RA, Gallagher, B, Neville, J, Henderson, K. Modeling dynamic behavior in large evolving graphs. In: Proceeding of the 6th ACM International Conference on Web Search and Data Mining (WSDM), Rome, Italy, 2013, 667–676.
Araujo, M, Papadimitriou, S, Günnemann, S, Faloutsos, C, Basu, P, Swami, A, Papalexakis, EE, Koutra, D. Com2: fast automatic discovery of temporal (`comet`) communities. In: Proceedings of the 18th Pacific‐Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Tainan, Taiwan, 2014, 271–283.
Chakrabarti, D. Autopart: parameter‐free graph partitioning and outlier detection. In: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Pisa, Italy, 2004, 112–124.
Sun, J, Faloutsos, C, Papadimitriou, S, Yu, PS. Graphscope: parameter‐free mining of large time‐evolving graphs. In: Proceedings of the 13th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Jose, CA, 2007, 687–696.
Ide, T, Kashima, H. Eigenspace‐based anomaly detection in computer systems. In: Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Seattle, WA, 2004, 440–449.
Lakhina, A, Crovella, M, Diot, C. Diagnosing network‐wide traffic anomalies. In: ACM SIGCOMM Computer Communication Review, vol. 34. New York: ACM; 2004, 219–230.
Sun, J, Papadimitriou, S, Yu, PS. Window‐based tensor analysis on high‐dimensional and multi‐aspect streams. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), Hong Kong, China, 2006, 1076–1080.
Sun, J, Tao, D, Christos F,. Beyond streams and graphs: dynamic tensor analysis. In: Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Philadelphia, PA, 2006, 374–383.
Sun,J, Xie, Y, Zhang, H, Faloutsos, C. Less is more: compact matrix decomposition for large sparse graphs. In: Proceedings of the 7th SIAM International Conference on Data Mining (SDM), Minneapolis, MN, 2007.
Kolda, TG, Sun, J. Scalable tensor decompositions for multi‐aspect data mining. In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM), Pisa, Italy, 2008, 363–372.
Tong, H, Papadimitriou, S, Sun, J, Yu, PS, Faloutsos, C. Colibri: fast mining of large static and dynamic graphs. In: Proceedings of the 14th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Las Vegas, NV, 2008, 686–694.
Jiang, R, Fei, H, Huan, J. Anomaly localization for network data streams with graph joint sparse PCA. In: Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, 2011, 886–894.
Miller, BA, Arcolano, N, Beard, MS, Kepner, J, Schmidt, MC, Bliss, NT, Wolfe, PJ. A scalable signal processing architecture for massive graph analysis. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012, 5329–5332.
Papalexakis, EE, Faloutsos, C, Sidiropoulos, ND. Parcube: sparse parallelizable tensor decompositions. In: Machine Learning and Knowledge Discovery in Databases. Berlin/Heidelberg: Springer; 2012, 521–536.
Miller, BA, Arcolano, N, Bliss, NT. Efficient anomaly detection in dynamic, attributed graphs: emerging phenomena and big data. In: 2013 IEEE International Conference on Intelligence and Security Informatics (ISI), Washington, DC, 2013, 179–184.
Yu, W, Aggarwal, CC, Ma, S, Wang, H. On anomalous hotspot discovery in graph streams. In: Proceedings of the 13th IEEE International Conference on Data Mining (ICDM), Dallas, TX, 2013.
Pincombe, B. Anomaly detection in time series of graphs using Arma processes. ASOR Bull 2005, 24:2.
Gaston, ME, Kraetzl, M, Wallis, WD. Using graph diameter for change detection in dynamic networks. Australasian J Combinatorics 2006, 35:299.
Papadimitriou, P, Dasdan, A, Garcia‐Molina, H. Web graph similarity for anomaly detection. J Internet Serv Appl 2010, 1:19–30.
Arackaparambil, C, Yan, G. Wiki‐watchdog: anomaly detection in Wikipedia through a distributional lens. In: Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology. Washington, DC: IEEE Computer Society; 2011, 257–264.
Quoc Le, D, Jeong, T, Eduardo Roman, H, Won‐Ki Hong, J. Traffic dispersion graph based anomaly detection. In: Proceedings of the Second Symposium on Information and Communication Technology. New York: ACM; 2011, 36–41.
Berlingerio, M, Koutra, D, Eliassi‐Rad, T, Faloutsos, C. Netsimile: a scalable approach to size‐independent network similarity. arXiv:1209.2684, 2012.
He, W, Guangmin, H, Zhou, Y. Large‐scale ip network behavior anomaly detection and identification using substructure‐based approach and multivariate time series mining. Telecomm Syst 2012, 50:1–13.
Malliaros, FD, Megalooikonomou, V, Faloutsos, C. Fast robustness estimation in large social graphs: communities and anomaly detection. In: Proceedings of the 12th SIAM International Conference on Data Mining (SDM), Anaheim, CA, 2012, 942–953.
Koutra, D, Vogelstein, J, Faloutsos, C. Deltacon: a principled massive‐graph similarity function. In: Proceedings of the 13th SIAM International Conference on Data Mining (SDM), Texas‐Austin, TX, 2013.
Mongiovi, M, Bogdanov, P, Singh, AK. Mining evolving network processes. In: Proceedings of the 13th IEEE International Conference on Data Mining (ICDM), Dallas, TX, 2013.
Huang, Z, Dajun Zeng, D. A link prediction approach to anomalous email detection. In: IEEE International Conference on Systems, Man and Cybernetics, San Diego, CA, 2006, 1131–1136.
Pandit, S, Horng Chau, D, Wang, S, Faloutsos, C. Netprobe: a fast and scalable system for fraud detection in online auction networks. In: Proceedings of the 16th International Conference on World Wide Web, Banff, Canada, 2007, 201–210.
Hirose, S, Yamanishi, K, Nakata, T, Fujimaki, R. Network anomaly detection based on Eigen equation compression. In: Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, 2009, 1185–1194.
Thompson, B, Eliassi‐Rad, T. Dapa‐v10: discovery and analysis of patterns and anomalies in volatile time‐evolving networks. In: Notes of the 1st Workshop on Information in Networks (WIN), New York, NY, 2009.
Djidjev, H, Sandine, G, Storlie, C, Vander Wiel, S. Graph based statistical analysis of network traffic. In: Proceedings of the Ninth Workshop on Mining and Learning with Graphs, San Diego, CA, 2011.
Aggarwal, CC, Zhao, Y, Yu, PS. Outlier detection in graph streams. In: Proceedings of the 27th International Conference on Data Engineering (ICDE), Hannover, Germany, 2011, 399–409.
Neil, J, Hash, C, Brugh, A, Fisk, M, Storlie, CB. Scan statistics for the online detection of locally anomalous subgraphs. Technometrics 2013, 55:403–414.
Tantipathananandh,C, Berger‐Wolf, T. Constant‐factor approximation algorithms for identifying dynamic communities. In: Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, 2009, 827–836
Tantipathananandh,C, Berger‐Wolf, T. Finding communities in dynamic social networks. In: Proceedings of the 11th IEEE International Conference on Data Mining (ICDM), Vancouver, Canada, 2011, 1236–1241.
Tantipathananandh,C, Berger‐Wolf, T, Kempe, D. A framework for community identification in dynamic social networks. In: Proceedings of the 13th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Jose, CA, 2007, 717–726.
Gupta, M, Gao, J, Han, J. Community distribution outlier detection in heterogeneous information networks. In: Machine Learning and Knowledge Discovery in Databases. Berlin/Heidelberg: Springer; 2013, 557–573.
Grünwald, P. A Tutorial Introduction to the Minimum Description Length Principle. Cambridge, MA: MIT Press; 2005.
Harshman, RA. Foundations of the Parafac Procedure: Models and Conditions for an “Explanatory” Multimodal Factor Analysis. Los Angeles, CA: UCLA; 1970.
Jolliffe, I. Principal Component Analysis. New York: John Wiley %26 Sons; 2005.
Barnathan, M, Megalooikonomou, V, Faloutsos, C, Faro, S, Mohamed, FB. Twave: high‐order analysis of functional MRI. Neuroimage 2011, 58:537–548.
Tucker, LR. Some mathematical notes on three‐mode factor analysis. Psychometrika 1966, 31:279–311.
Chung, F, Linyuan, L, Van, V. Spectra of random graphs with given expected degrees. Proc Natl Acad Sci 2003, 100:6313–6318.
Ringberg, H, Soule, A, Rexford, J, Diot, C. Sensitivity of PCA for traffic anomaly detection. ACM SIGMETRICS Perf Eval Rev 2007, 35:109–120.
Chen, Y, Miao, D, Zhang, H. Neighborhood outlier detection. Expert Syst Appl 2010, 37:8745–8749.
Papadimitriou, S, Kitagawa, H, Gibbons, PB, Faloutsos, C. Loci: fast outlier detection using the local correlation integral. In: Proceeding of the 19th International Conference on Data Engineering, 2003, 315–326.
Chazelle, B. The Discrepancy Method: Randomness and Complexity. Cambridge, UK: Cambridge University Press; 2002.
Tong, H, Lin, C‐Y. Non‐negative residual matrix factorization with application to graph anomaly detection. In: SDM. Mesa, AZ: SIAM; 2011, 143–153.
Bogdanov, P, Mongiov, M, Singh, AK. Mining heavy subgraphs in time‐evolving networks. In: Proceedings of the 11th IEEE International Conference on Data Mining (ICDM), Vancouver, Canada, 2011, 81–90.
Mahadevan, P, Krioukov, D, Fall, K, Vahdat, A. Systematic topology analysis and generation using degree correlations. In: ACM SIGCOMM Computer Communication Review, vol. 36. New York: ACM; 2006, 135–146.
Sala, A, Cao, L, Wilson, C, Zablit, R, Zheng, H, Zhao, BY. Measurement‐calibrated graph models for social network experiments. In: Proceedings of the 19th International Conference on World Wide Web. New York: ACM; 2010, 861–870.
Wang, J, Provan, GM. Generating application‐specific benchmark models for complex systems. In: AAAI, 2008, 566–571.
Koutra, D, Ke, T‐Y, Kang, U, Horng Polo Chau, D, Kenneth Pao, H‐K, Faloutsos, C. Unifying guilt‐by‐association approaches: theorems and fast algorithms. In: Machine Learning and Knowledge Discovery in Databases. Berlin/Heidelberg: Springer; 2011, 245–260.
Box, GEP, Jenkins, G. Time Series Analysis: Forecasting and Control. San Francisco, CA: Holden‐Day; 1970.
Charikar, MS. Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thiry‐Fourth Annual ACM Symposium on Theory of Computing. New York: ACM; 2002, 380–388.
Gupta, AK, Nagar, DK. Matrix Variate Distributions, vol. 104. Boca Raton, FL: CRC Press; 1999.
Steinhaeuser, K, Chawla, NV, Ganguly, AR. Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science. Stat Anal Data Min 2011, 4:497–511.
Aggarwal, CC. Outlier Analysis. Berlin/Heidelberg: Springer; 2013.
Gupta, M, Gao, J, Aggarwal, CC, Han, J. Outlier detection for temporal data: a survey. IEEE Trans Knowl Data Eng 2013, 25:1.

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts