The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs
Open accessAbstract
Given a stream of heterogeneous graphs containing different types of nodes and edges, how can we spot anomalous ones in real-time while consuming bounded memory? This problem is motivated by and generalizes from its application in security to host-level advanced persistent threat (APT) detection. We propose StreamSpot, a clustering based anomaly detection approach that addresses challenges in two key fronts: (1) heterogeneity, and (2) streaming nature. We introduce a new similarity function for heterogeneous graphs that compares two graphs based on their relative frequency of local substructures, represented as short strings. This function lends itself to a vector representation of a graph, which is (a) fast to compute, and (b) amenable to a sketched version with bounded size that preserves similarity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Silhouettes: A graphical aid to the interpretation and validation of cluster analysis
Rousseeuw, P. J. (1987) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(87)90125-7 · Cited by 21,392
Liu, F. T., Ting, K. M., & Zhou, Z.-H. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.17 · Cited by 6,601
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Probability and Random Processes
(2004) · Elsevier eBooks · doi:10.1016/b978-0-12-172651-5.x5000-3 · Cited by 2,535
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
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
Probability and Random Processes.
Grimmett, G. R., & Stirzaker, D. R. (2001) · doi:10.1093/oso/9780198572237.001.0001 · Cited by 1,850
On the resemblance and containment of documents
Broder, A. Z. (2002) · Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) · doi:10.1109/sequen.1997.666900 · Cited by 1,698
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
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 · cited 1×
“Most work is for static homogeneous graphs [5].”
BackgroundSelf-citationNew hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., & Borgwardt, K. M. (2010) · CaltechAUTHORS (California Institute of Technology) · Cited by 850
GraphScope: 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
Inexact graph matching for structural pattern recognition
Bunke, H., & Allermann, G. (1983) · Pattern Recognition Letters · doi:10.1016/0167-8655(83)90033-8 · Cited by 487
Noble, 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
Cook, D. J., & Holder, L. B. (2000) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.850825 · Cited by 406
Graph stream algorithms: a survey
McGregor, A. (2014) · ACM SIGMOD Record · doi:10.1145/2627692.2627694 · Cited by 357
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
Focused clustering and outlier detection in large attributed graphs
Perozzi, B., Akoglu, L., Iglesias Sánchez, P., & Müller, E. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623682 · Cited by 228
Self-citationD 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
Outlier 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
Random Sampling in Cut, Flow, and Network Design Problems
Karger, D. R. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.383 · Cited by 189
Combining Collective Classification and Link Prediction
Bilgic, M., Namata, G. M., & Getoor, L. (2007) · Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007) · doi:10.1109/icdmw.2007.35 · Cited by 185
Berlingerio, M., Bonchi, F., Bringmann, B., & Gionis, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04180-8_25 · Cited by 174
Scalable Anomaly Ranking of Attributed Neighborhoods
Perozzi, B., & Akoglu, L. (2016) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974348.24 · Cited by 161
Self-citationMining Behavior Graphs for “Backtrace” of Noncrashing Bugs
Liu, C., Yan, X., Yu, H., Han, J., & Yu, P. S. (2005) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.26 · Cited by 129
Online Analysis of Community Evolution in Data Streams
Aggarwal, C. C., & Yu, P. S. (2005) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.6 · Cited by 88
Network similarity via multiple social theories
Berlingerio, M., Koutra, D., Eliassi‐Rad, T., & Faloutsos, C. (2013) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2492517.2492582 · Cited by 83
Graph KernelsPreprint
Vishwanathan, S. V. N., Borgwardt, K. M., Kondor, I. R., & Schraudolph, N. N. (2008) · arXiv (Cornell University) · Cited by 72
Evolutionary Clustering and Analysis of Bibliographic Networks
Gupta, M., Aggarwal, C. C., Han, J., & Sun, Y. (2011) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2011.12 · Cited by 58
Local Learning for Mining Outlier Subgraphs from Network Datasets
Gupta, M., Mallya, A., Roy, S., Cho, J. H. D., & Han, J. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.9 · Cited by 42
Classy: fast clustering streams of call-graphs
Kostakis, O. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0367-9 · Cited by 25
On Graph Stream Clustering with Side Information
Zhao, Y., & Yu, P. S. (2013) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.16 · Cited by 21
Vertex Clustering of Augmented Graph Streams
McConville, R., Liu, W., & Miller, P. C. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.13 · Cited by 13
Cited by
Robust Anomaly Detection for Multivariate Time Series through Stochastic Recurrent Neural Network
Su, Y., Zhao, Y., Niu, C., Liu, R., Sun, W., & Pei, D. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330672 · Cited by 1,804
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
Self-citationHOLMES: Real-Time APT Detection through Correlation of Suspicious Information Flows
Milajerdi, S. M., Gjomemo, R., Eshete, B., Sekar, R., & Venkatakrishnan, V. N. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00026 · Cited by 573
Self-citationNetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks
Yu, W., Cheng, W., Aggarwal, C. C., Zhang, K., Chen, H., & Wang, W. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220024 · Cited by 355
UNICORN: Runtime Provenance-Based Detector for Advanced Persistent Threats
Han, X., Pasquier, T., Bates, A., Mickens, J., & Seltzer, M. (2020) · Proceedings 2020 Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24046 · Cited by 349
Metadata
- Authors
- Manzoor, E., Milajerdi, S. M., & Akoglu, L.
- Venue
- Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2016-08-13
- Pages
- 1035-1044
- OpenAlex
- W2284900416
- Cited by
- 291
- References
- 34
- FWCI
- 6.35
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.