The DOI matches its Crossref record; 128 of the 128 references it cites were found in a registry or an index.
Anomaly detection in dynamic networks: a survey
Open accessAbstract
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
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time Series Analysis: Forecasting and Control
Geurts, M., Box, G. E. P., & Jenkins, G. M. (1977) · Journal of Marketing Research · doi:10.2307/3150485 · Cited by 19,186
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Least Squares Support Vector Machine Classifiers
Suykens, J. A. K., & Vandewalle, J. (1999) · Neural Processing Letters · doi:10.1023/a:1018628609742 · Cited by 9,362
(2009) · Cited by 6,153
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149
Fields, J. (2001) · Cited by 4,044
A Survey of Outlier Detection Methodologies
Hodge, V., & Austin, J. (2004) · Artificial Intelligence Review · doi:10.1007/s10462-004-4304-y · Cited by 3,596
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
A survey of approaches to automatic schema matching
Rahm, E., & Bernstein, P. A. (2001) · The VLDB Journal · doi:10.1007/s007780100057 · Cited by 3,352
Hawkins, D. M. (1980) · doi:10.1007/978-94-015-3994-4 · Cited by 2,982
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
Harshman, R. A. (1970) · Cited by 2,255
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509965 · Cited by 2,220
Community detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Statistical mechanics of community detection
Reichardt, J., & Bornholdt, S. (2006) · Physical Review E · doi:10.1103/physreve.74.016110 · Cited by 2,048
Atkinson, A., Barnett, V., & Lewis, T. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983451 · Cited by 1,682
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
The singular value decomposition: Its computation and some applications
Klema, V., & Laub, A. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102314 · Cited by 1,631
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Self-citationSubspace clustering for high dimensional data: a review
Parsons, L., Haque, E., & Liu, H. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007731 · Cited by 1,346
Gupta, A. K., & Nagar, D. K. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203749289 · Cited by 1,295
Balakrishnan, N., Barnett, V., & Lewis, T. (1995) · Biometrics · doi:10.2307/2533352 · Cited by 1,217
Diagnosing network-wide traffic anomalies
Lakhina, A., Crovella, M., & Diot, C. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015492 · Cited by 1,039
Outlier detection for high dimensional data
Aggarwal, C. C., & Yu, P. S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375668 · Cited by 1,029
Outlier Detection for Temporal Data: A Survey
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.184 · Cited by 1,001
(2023) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789811273117_0001 · Cited by 885
LOCI: fast outlier detection using the local correlation integral
Papadimitriou, S., Kitagawa, H., Gibbons, P. B., & Faloutsos, C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/icde.2003.1260802 · Cited by 846
Self-citationFast Outlier Detection in High Dimensional Spaces
Angiulli, F., & Pizzuti, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45681-3_2 · Cited by 836
Aggarwal, C. C. (2013) · Cited by 832
Anomaly Detection for Discrete Sequences: A Survey
Chandola, V., Banerjee, A., & Kumar, V. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.235 · Cited by 715
A survey of graph edit distance
Gao, X., Xiao, B., Tao, D., & Li, X. (2010) · Pattern Analysis and Applications · doi:10.1007/s10044-008-0141-y · Cited by 704
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
Song, Q., Ni, J., & Wang, G. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.181 · Cited by 663
ACM SIGCOMM computer communication review
Campbell, A. T., & Schwartz, M. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1037107.1037111 · Cited by 600
Balakrishnan, R., & Ranganathan, K. (2000) · Universitext · doi:10.1007/978-1-4419-8505-7 · Cited by 563
Tracking the Evolution of Communities in Dynamic Social Networks
Greene, D., Doyle, D., & Cunningham, P. (2010) · 2010 International Conference on Advances in Social Networks Analysis and Mining · doi:10.1109/asonam.2010.17 · Cited by 537
oddball: Spotting Anomalies in Weighted Graphs
Akoglu, L., McGlohon, M., & Faloutsos, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13672-6_40 · Cited by 533
Self-citationGraphScope: parameter-free mining of large time-evolving graphs
Sun, J., Faloutsos, C., Papadimitriou, S., & Yu, P. S. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281266 · Cited by 532
Self-citationAggarwal, C. C. (2013) · Springer eBooks · doi:10.1007/978-1-4614-6396-2 · Cited by 500
Spectra of random graphs with given expected degrees
Chung, F., Lu, L., & Vu, V. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0937490100 · Cited by 492
Beyond streams and graphs: dynamic tensor analysis
Sun, J., Tao, D., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150445 · Cited by 462
Self-citationNoble, C. C., & Cook, D. J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956831 · Cited by 454
A framework for community identification in dynamic social networks
Tantipathananandh, C., Berger-Wolf, T., & Kempe, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281269 · Cited by 443
Diagnosing network-wide traffic anomalies
Lakhina, A., Crovella, M., & Diot, C. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1030194.1015492 · Cited by 419
Cook, D. J., & Holder, L. B. (2006) · Wiley-Interscience eBooks · Cited by 396
Incremental Local Outlier Detection for Data Streams
Pokrajac, D., Lazarevic, A., & Latecki, L. J. (2007) · 2007 IEEE Symposium on Computational Intelligence and Data Mining · doi:10.1109/cidm.2007.368917 · Cited by 386
Netprobe: a fast and scalable system for fraud detection in online auction networks
Pandit, S., Chau, D. H., Wang, S., & Faloutsos, C. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242600 · Cited by 382
Self-citationOutlier mining in large high-dimensional data sets
Angiulli, F., & Pizzuti, C. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.31 · Cited by 365
Scalable Tensor Decompositions for Multi-aspect Data Mining
Kolda, T. G., & Sun, J. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.89 · Cited by 358
Sensitivity of PCA for traffic anomaly detection
Ringberg, H., Soule, A., Rexford, J., & Diot, C. (2007) · Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1254882.1254895 · Cited by 353
The discrepancy method: randomness and complexity
(2002) · Choice Reviews Online · doi:10.5860/choice.40-2215 · Cited by 347
Video anomaly detection based on local statistical aggregates
Saligrama, V., & Chen, Z. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247917 · Cited by 332
Scan Statistics on Enron Graphs
Priebe, C. E., Conroy, J. M., Marchette, D. J., & Park, Y. (2005) · Computational and Mathematical Organization Theory · doi:10.1007/s10588-005-5378-z · Cited by 329
Partial Residual Plots Based on Robust Fits
Mckean, J. W., & Sheather, S. J. (2000) · Technometrics · doi:10.1080/00401706.2000.10486046 · Cited by 327
Glaz, J., Naus, J., & Wallenstein, S. (2001) · Springer Series in Statistics · doi:10.1007/978-1-4757-3460-7 · Cited by 306
A tutorial introduction to the minimum description length principle
Grunwald, P. (2004) · arXiv · doi:10.48550/arxiv.math/0406077 · Cited by 293
Event Detection in Social Streams
Aggarwal, C. C., & Subbian, K. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.54 · Cited by 287
Systematic topology analysis and generation using degree correlations
Mahadevan, P., Krioukov, D., Fall, K., & Vahdat, A. (2006) · Cited by 269
On community outliers and their efficient detection in information networks
Gao, J., Liang, F., Fan, W., Wang, C., Sun, Y., & Han, J. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835907 · Cited by 236
Eigenspace-based anomaly detection in computer systems
IDÉ, T., & KASHIMA, H. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014102 · Cited by 235
(2006) · Wiley eBooks · doi:10.1002/0470073047 · Cited by 228
Community detection in large‐scale networks: a survey and empirical evaluation
Harenberg, S., Bello, G., Gjeltema, L., Ranshous, S., Harlalka, J., Seay, R., Padmanabhan, K., & Samatova, N. (2014) · WIREs Computational Statistics · doi:10.1002/wics.1319 · Cited by 227
Self-citationWeb graph similarity for anomaly detection
Papadimitriou, P., Dasdan, A., & Garcia-Molina, H. (2010) · Journal of Internet Services and Applications · doi:10.1007/s13174-010-0003-x · Cited by 224
D elta C on : A Principled Massive-Graph Similarity Function
Koutra, D., Vogelstein, J. T., & Faloutsos, C. (2013) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.18 · Cited by 221
Self-citationOutlier detection in graph streams
Aggarwal, C. C., Zhao, Y., & Yu, P. S. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767885 · Cited by 210
On constrained spectral clustering and its applications
Wang, X., Qian, B., & Davidson, I. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0291-9 · Cited by 203
AutoPart: Parameter-Free Graph Partitioning and Outlier Detection
Chakrabarti, D. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30116-5_13 · Cited by 180
Sensitivity of PCA for traffic anomaly detection
Ringberg, H., Soule, A., Rexford, J., & Diot, C. (2007) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1269899.1254895 · Cited by 173
Modeling dynamic behavior in large evolving graphs
Rossi, R. A., Gallagher, B., Neville, J., & Henderson, K. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433479 · Cited by 172
Bayesian anomaly detection methods for social networks
Heard, N. A., Weston, D. J., Platanioti, K., & Hand, D. J. (2010) · The Annals of Applied Statistics · doi:10.1214/10-aoas329 · Cited by 171
Measurement-calibrated graph models for social network experiments
Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., & Zhao, B. Y. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772778 · Cited by 171
Comparative Evaluation of Anomaly Detection Techniques for Sequence Data
Chandola, V., Mithal, V., & Kumar, V. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.151 · Cited by 167
A comprehensive survey of numeric and symbolic outlier mining techniques
Agyemang, M., Barker, K., & Alhajj, R. (2006) · Intelligent Data Analysis · doi:10.3233/ida-2006-10604 · Cited by 164
ParCube: Sparse Parallelizable Tensor Decompositions
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33460-3_39 · Cited by 162
Self-citationChen, F., & Neill, D. B. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623619 · Cited by 161
Outlier Detection for Temporal Data
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00573ed1v01y201403dmk008 · Cited by 153
Anomaly detection in data represented as graphs
Eberle, W., & Holder, L. B. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11606 · Cited by 145
NetSimile: A Scalable Approach to Size-Independent Network SimilarityPreprint
Berlingerio, M., Koutra, D., Eliassi‐Rad, T., & Faloutsos, C. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.2684 · Cited by 142
Self-citationBayesian anomaly detection methods for social networks
Heard, N. A., Weston, D. J., Platanioti, K., et al. (2010) · BIROn (Birkbeck, University of London) · Cited by 142
Temporal Outlier Detection in Vehicle Traffic Data
Li, X., Li, Z., Han, J., & Lee, J.-G. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.230 · Cited by 138
Neighborhood outlier detection
Chen, Y., Miao, D., & Zhang, H. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.06.040 · Cited by 137
Non-Negative Residual Matrix Factorization with Application to Graph Anomaly Detection
Tong, H., & Lin, C.-Y. (2011) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.13 · Cited by 136
Steinhaeuser, K., Chawla, N. V., & Ganguly, A. R. (2010) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.10100 · Cited by 134
Scan Statistics for the Online Detection of Locally Anomalous Subgraphs
Neil, J., Hash, C., Brugh, A., Fisk, M., & Storlie, C. B. (2013) · Technometrics · doi:10.1080/00401706.2013.822830 · Cited by 133
The case for anomalous link discovery
Rattigan, M. J., & Jensen, D. D. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117460 · Cited by 128
Detection and Characterization of Anomalies in Multivariate Time Series
Cheng, H., Tan, P., Potter, C. S., & Klooster, S. A. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.36 · Cited by 127
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Sun, J., Xie, Y., Zhang, H., & Faloutsos, C. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.33 · Cited by 121
Self-citationIntegrating community matching and outlier detection for mining evolutionary community outliers
Gupta, M., Gao, J., Sun, Y., & Han, J. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339667 · Cited by 117
Intrusion as (anti)social communication: characterization and detection
Ding, Q., Katenka, N., Barford, P., Kolaczyk, E. D., & Crovella, M. E. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339670 · Cited by 116
Mining Heavy Subgraphs in Time-Evolving Networks
Bogdanov, P., Mongiovı̀, M., & Singh, A. K. (2011) · Proceedings · doi:10.1109/icdm.2011.101 · Cited by 116
Community-based anomaly detection in evolutionary networks
Chen, Z., Hendrix, W., & Samatova, N. F. (2011) · Journal of Intelligent Information Systems · doi:10.1007/s10844-011-0183-2 · Cited by 116
Self-citationNetSpot: Spotting Significant Anomalous Regions on Dynamic Networks
Mongiovı̀, M., Bogdanov, P., Ranca, R., Papalexakis, E. E., Faloutsos, C., & Singh, A. K. (2013) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.4 · Cited by 114
Self-citationTong, H., Papadimitriou, S., Sun, J., Yu, P. S., & Faloutsos, C. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401973 · Cited by 105
Self-citationCommunity mining on dynamic weighted directed graphs
Duan, D., Li, Y., Jin, Y., & Lu, Z. (2009) · doi:10.1145/1651274.1651278 · Cited by 101
Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms
Koutra, D., Ke, T.-Y., Kang, U., Chau, D. H., Pao, H.-K., & Faloutsos, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23783-6_16 · Cited by 93
Self-citationCom2: Fast Automatic Discovery of Temporal (‘Comet’) Communities
Araújo, M. R., Papadimitriou, S., Günnemann, S., Faloutsos, C., Basu, P., Swami, A., Papalexakis, E. E., & Koutra, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06605-9_23 · Cited by 91
Self-citationOutlier Detection for Temporal Data
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · Synthesis lectures on data mining and knowledge discovery · doi:10.1007/978-3-031-01905-0 · Cited by 86
LOADED: Link-Based Outlier and Anomaly Detection in Evolving Data Sets
Ghoting, A., Otey, M. E., & Parthasarathy, S. (2005) · Proceedings · doi:10.1109/icdm.2004.10011 · Cited by 83
Window-based Tensor Analysis on High-dimensional and Multi-aspect Streams
Sun, J., Papadimitriou, S., & Yu, P. S. (2006) · Proceedings · doi:10.1109/icdm.2006.169 · Cited by 80
Finding Communities in Dynamic Social Networks
Tantipathananandh, C., & Berger-Wolf, T. Y. (2011) · Proceedings · doi:10.1109/icdm.2011.67 · Cited by 80
Graph-based Anomaly Detection and Description: A SurveyPreprint
Akoglu, L., Tong, H., & Koutra, D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.4679 · Cited by 76
Self-citationIntrusion Detection using Continuous Time Bayesian Networks
Xu, J., & Shelton, C. R. (2011) · Cited by 71
Network anomaly detection based on Eigen equation compression
Hirose, S., Yamanishi, K., Nakata, T., & Fujimaki, R. (2009) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557147 · Cited by 62
Constant-factor approximation algorithms for identifying dynamic communities
Tantipathananandh, C., & Berger-Wolf, T. Y. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557110 · Cited by 60
Intrusion Detection using Continuous Time Bayesian Networks
Xu, J., & Shelton, C. R. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3050 · Cited by 57
TensorSplat: Spotting Latent Anomalies in Time
Koutra, D., Papalexakis, E. E., & Faloutsos, C. (2012) · Panhellenic Conference on Informatics · doi:10.1109/pci.2012.60 · Cited by 50
Self-citationAnomaly localization for network data streams with graph joint sparse PCA
Jiang, R., Fei, H., & Huan, J. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020557 · Cited by 47
Efficient anomaly detection in dynamic, attributed graphs: Emerging phenomena and big data
Miller, B. A., Arcolano, N., & Bliss, N. T. (2013) · IEEE International Conference on Intelligence and Security Informatics (ISI) · doi:10.1109/isi.2013.6578815 · Cited by 43
Community Distribution Outlier Detection in Heterogeneous Information Networks
Gupta, M., Gao, J., & Han, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40988-2_36 · Cited by 41
Traffic dispersion graph based anomaly detection
Le, D. Q., Jeong, T., Roman, H. E., & Hong, J. W. (2011) · International Symposium on Information and Communication Technology · doi:10.1145/2069216.2069227 · Cited by 37
Fast Robustness Estimation in Large Social Graphs: Communities and Anomaly Detection
Malliaros, F. D., Megalooikonomou, V., & Faloutsos, C. (2012) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.81 · Cited by 37
Self-citationMinimum‐Description‐Length Principle
Rissanen, J. (2004) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess1641 · Cited by 37
Srivastava, A. N., Akella, R., Diev, V., Kumaresan, S. P., McIntosh, D. M. D., Pontikakis, E. D., Xu, Z., & Zhang, Y. (2006) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero.2006.1656136 · Cited by 35
Cheng, H., Tan, P., Potter, C. S., & Klooster, S. A. (2008) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2008.48 · Cited by 35
Mining Evolving Network Processes
Mongiovı̀, M., Bogdanov, P., & Singh, A. K. (2013) · Proceedings · doi:10.1109/icdm.2013.106 · Cited by 30
Discovery of extreme events-related communities in contrasting groups of physical system networks
Chen, Z., Hendrix, W., Guan, H., Tetteh, I. K., Choudhary, A., Semazzi, F. H. M., & Samatova, N. F. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0289-3 · Cited by 23
Self-citationIncremental Local Evolutionary Outlier Detection for Dynamic Social Networks
Ji, T., Yang, D., & Gao, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40991-2_1 · Cited by 23
Using graph diameter for change detection in dynamic networks.
Gaston, M. E., Kraetzl, M., & Wallis, W. D. (2006) · Australas. J Comb. · Cited by 22
He, W., Hu, G., & Zhou, Y. (2010) · Telecommunication Systems · doi:10.1007/s11235-010-9384-1 · Cited by 21
TWave: High-order analysis of functional MRI
Barnathan, M., Megalooikonomou, V., Faloutsos, C., Faro, S. H., & Mohamed, F. B. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2011.06.043 · Cited by 18
Self-citationDAPA-V10: Discovery and Analysis of Patterns and Anomalies in Volatile Time-Evolving Networks
Thompson, B., & Eliassi‐Rad, T. (2009) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 10
Generating application-specific benchmark models for complex systems
Wang, J., & Provan, G. M. (2008) · Cited by 5
Cited by
A Unifying Review of Deep and Shallow Anomaly Detection
Ruff, L., Kauffmann, J. R., Vandermeulen, R. A., Montavon, G., Samek, W., Kloft, M., Dietterich, T. G., & Muller, K.-R. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3052449 · Cited by 914
A Comprehensive Survey on Graph Anomaly Detection With Deep Learning
Ma, X., Wu, J., Xue, S., Yang, J., Zhou, C., Sheng, Q. Z., Xiong, H., & Akoglu, L. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3118815 · Cited by 835
Continuous-Time Dynamic Network Embeddings
Nguyen, G. H., Lee, J. B., Rossi, R. A., Ahmed, N. K., Koh, E., & Kim, S. (2018) · Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18 · doi:10.1145/3184558.3191526 · Cited by 538
Progress in Outlier Detection Techniques: A Survey
Wang, H., Bah, M. J., & Hammad, M. (2019) · IEEE Access · doi:10.1109/access.2019.2932769 · Cited by 523
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Metadata
- Authors
- Ranshous, S., Shen, S., Koutra, D., Harenberg, S., Faloutsos, C., & Samatova, N. F.
- Venue
- WIREs Computational Statistics
- Publisher
- Wiley
- Published
- 2015-03-21
- Volume
- 7
- Issue
- 3
- Pages
- 223-247
- ISSN
- 1939-0068 (ISSN-L)
- 1939-5108
- OpenAlex
- W2093168265
- Cited by
- 379
- References
- 128
- FWCI
- 25.65
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.