The DOI matches its Crossref record; 139 of the 139 references it cites were found in a registry or an index.
Graph Summarization Methods and Applications: A Survey
Open accessAbstract
While advances in computing resources have made processing enormous amounts of data possible, human ability to identify patterns in such data has not scaled accordingly. Efficient computational methods for condensing and simplifying data are thus becoming vital for extracting actionable insights. In particular, while data summarization techniques have been studied extensively, only recently has summarizing interconnected data, or graphs, become popular. This survey is a structured, comprehensive overview of the state-of-the-art methods for summarizing graph data. We first broach the motivation behind and the challenges of graph summarization. We then categorize summarization approaches by the type of graphs taken as input and further organize each category by core methodology. Finally, we discuss applications of summarization on real-world graphs and conclude by describing some open problems in the field.
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
Cytoscape: A software Environment for integrated models of biomolecular interaction networks
Shannon, P., Markiel, A., Ozier, O., Baliga, N. S., Wang, J. T., Ramage, D., Amin, N., Schwikowski, B., & Ideker, T. (2003) · Genome Research · doi:10.1101/gr.1239303 · Cited by 51,888
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Gephi: An Open Source Software for Exploring and Manipulating Networks
Bastian, M., Heymann, S., & Jacomy, M. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13937 · Cited by 11,675
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Bostock, M., Ogievetsky, V., & Heer, J. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.185 · Cited by 3,165
Structural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
An improved data stream summary: the count-min sketch and its applications
Cormode, G., & Muthukrishnan, S. (2005) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.001 · Cited by 1,743
Distributed GraphLab: a framework for machine learning and data mining in the cloud
Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., & Hellerstein, J. M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212354 · Cited by 1,653
Sporns, O. (2010) · The MIT Press eBooks · doi:10.7551/mitpress/8476.001.0001 · Cited by 1,580
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
The webgraph framework I: compression techniques
Boldi, P., & Vigna, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988752 · Cited by 1,201
Cilibrasi, R., & Vitanyi, P. M. B. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844059 · Cited by 1,188
Universal codeword sets and representations of the integers
Elias, P. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055349 · Cited by 1,165
struc2vec: Learning Node Representations from Structural Identity
Ribeiro, L. F. R., Saverese, P. H. P., & Figueiredo, D. R. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098061 · Cited by 1,011
Graph clustering based on structural/attribute similarities
Zhou, Y., Cheng, H., & Yu, J. X. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687709 · Cited by 863
Overlapping community detection at scale: a nonnegative matrix factorization approach
Yang, J., & Leskovec, J. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433471 · Cited by 852
4 Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · Cited by 803
Microscopic evolution of social networks
Leskovec, J., Backstrom, L., Kumar, R., & Tomkins, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401948 · Cited by 728
The Transitive Reduction of a Directed Graph
Aho, A. V., Garey, M. R., & Ullman, J. D. (1972) · SIAM Journal on Computing · doi:10.1137/0201008 · Cited by 718
Advances in Social Network Analysis: Research in the Social and Behavioral Sciences
Wasserman, S., & Galaskiewicz, J. (1994) · Sage eBooks · doi:10.4135/9781452243528 · Cited by 665
Distributed large-scale natural graph factorization
Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., & Smola, A. J. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488393 · Cited by 648
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.167 · Cited by 575
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
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
Graph Sparsification by Effective Resistances
Spielman, D. A., & Srivastava, N. (2011) · SIAM Journal on Computing · doi:10.1137/080734029 · Cited by 489
Substructure Discovery Using Minimum Description Length and Background Knowledge
Cook, D. J., & Holder, L. B. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.43 · Cited by 480
Mining Heterogeneous Information Networks: Principles and Methodologies
Sun, Y., & Han, J. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00433ed1v01y201207dmk005 · Cited by 471
Efficient aggregation for graph summarization
Tian, Y., Hankins, R. A., & Patel, J. M. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376675 · Cited by 442
Aggarwal, C. C. (2015) · doi:10.1007/978-3-319-14142-8 · Cited by 433
Leskovec, J., Rajaraman, A., & Ullman, J. D. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108684163 · Cited by 424
Pruning and summarizing the discovered associations
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312216 · Cited by 418
Proceedings of the 2007 SIAM International Conference on Data Mining
(2007) · doi:10.1137/1.9781611972771 · Cited by 380
RolX: structural role extraction & mining in large graphs
Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., & Li, L. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339723 · Cited by 376
Self-citationOn compressing social networks
Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., & Raghavan, P. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557049 · Cited by 349
Graph summarization with bounded error
Navlakha, S., Rastogi, R., & Shrivastava, N. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376661 · Cited by 347
A model-based approach to attributed graph clustering
Xu, Z., Ke, Y., Wang, Y., Cheng, H., & Cheng, J. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213894 · Cited by 332
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442702 · Cited by 310
Krimp: mining itemsets that compress
Vreeken, J., van Leeuwen, M., & Siebes, A. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0202-x · Cited by 300
Simple and deterministic matrix sketching
Liberty, E. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487623 · Cited by 257
Fast best-effort pattern matching in large attributed graphs
Tong, H., Faloutsos, C., Gallagher, B. J., & Eliassi‐Rad, T. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281271 · Cited by 251
A scalable pattern mining approach to web graph compression with communities
Buehrer, G., & Chellapilla, K. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341547 · Cited by 246
On mining cross-graph quasi-cliques
Pei, J., Jiang, D., & Zhang, A. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081898 · Cited by 246
Fully automatic cross-associations
Chakrabarti, D., Papadimitriou, S., Modha, D. S., & Faloutsos, C. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014064 · Cited by 241
Spotting Culprits in Epidemics: How Many and Which Ones?
Prakash, B. A., Vreeken, J., & Faloutsos, C. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.136 · Cited by 233
It's who you know: graph mining using recursive structural features
Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., & Faloutsos, C. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020512 · Cited by 223
Graph sketches: sparsification, spanners, and subgraphs
Ahn, K. J., Guha, S., & McGregor, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213560 · Cited by 223
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-citationQuery preserving graph compression
Fan, W., Li, J., Wang, X., & Wu, Y. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213855 · Cited by 204
Dunne, C., & Shneiderman, B. (2013) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/2470654.2466444 · Cited by 195
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction
Shen, Z., Ma, K.-L., & Eliassi-Rad, T. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.107 · Cited by 193
Apolo: making sense of large network data by combining rich user interaction and machine learning
Chau, D. H., Kittur, A., Hong, J. I., & Faloutsos, C. (2011) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1978942.1978967 · Cited by 191
Proceedings of the 2022 SIAM International Conference on Data Mining (SDM)
(2022) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977172 · Cited by 181
Raghavan, S., & García-Molina, H. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2003.1260809 · Cited by 180
Maiya, A. S., & Berger-Wolf, T. Y. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772762 · Cited by 180
Summarizing itemset patterns: a profile-based approach
Yan, X., Cheng, H., Han, J., & Xin, D. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081907 · Cited by 178
Spectral partitioning with multiple eigenvectors
Alpert, C. J., Kahng, A. B., & Yao, S.-Z. (1999) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(98)00083-3 · Cited by 172
Dynamic mixed membership blockmodel for evolving networks
Fu, W., Song, L., & Xing, E. P. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553416 · Cited by 172
Network Structure Inference, A Survey: Motivations, Methods, and Applications
Brugere, I., Gallagher, B. J., & Berger-Wolf, T. Y. (2018) · ACM Computing Surveys · doi:10.1145/3154524 · Cited by 172
SlashBurn: Graph Compression and Mining beyond Caveman Communities
Lim, Y., Kang, U., & Faloutsos, C. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2320716 · Cited by 163
Generalizing plans to new environments in relational MDPs
Guestrin, C., Koller, D., Gearhart, C., & Kanodia, N. (2003) · Cited by 157
Spectral sparsification of graphs
Batson, J., Spielman, D. A., Srivastava, N., & Teng, S. (2013) · Communications of the ACM · doi:10.1145/2492007.2492029 · Cited by 154
D elta C on: Principled Massive-Graph Similarity Function with Attribution
Koutra, D., Shah, N., Vogelstein, J. T., Gallagher, B. J., & Faloutsos, C. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2824443 · Cited by 144
Self-citationMetropolis Algorithms for Representative Subgraph Sampling
Hübler, C., Kriegel, H., Borgwardt, K. M., & Ghahramani, Z. (2008) · Proceedings · doi:10.1109/icdm.2008.124 · Cited by 143
Constraining and summarizing association rules in medical data
ORDÓÑEZ, C. R., Ezquerra, N. F., & Santana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-005-0226-5 · Cited by 141
Shah, N., Koutra, D., Zou, T., Gallagher, B. J., & Faloutsos, C. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783321 · Cited by 137
Self-citationDiscovery-driven graph summarization
Zhang, N., Tian, Y., & Patel, J. M. (2010) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2010.5447830 · Cited by 135
GraSS: Graph Structure Summarization
LeFevre, K., & Terzi, E. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.40 · Cited by 132
Fast and reliable anomaly detection in categorical data
Akoglu, L., Tong, H., Vreeken, J., & Faloutsos, C. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396816 · Cited by 128
Effectively Visualizing Large Networks Through Sampling
Rafiei, D., & Curial, S. (2006) · Visualization · doi:10.1109/vis.2005.25 · Cited by 127
Compression of weighted graphs
Toivonen, H. T. T., Zhou, F., Hartikainen, A., et al. (2011) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020566 · Cited by 126
Compressing Graphs and Indexes with Recursive Graph Bisection
Dhulipala, L., Kabiljo, I., Karrer, B., Ottaviano, G., Pupyrev, S., & Shalita, A. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939862 · Cited by 124
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
A fast kernel-based multilevel algorithm for graph clustering
Dhillon, I. S., Guan, Y., & Kulis, B. (2005) · doi:10.1145/1081870.1081948 · Cited by 121
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
Maruhashi, K., Guo, F., & Faloutsos, C. (2011) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2011.80 · Cited by 118
Temporal-Relational Classifiers for Prediction in Evolving Domains
Sharan, U., & Neville, J. (2008) · Proceedings · doi:10.1109/icdm.2008.125 · Cited by 115
Kang, U., Tong, H., Sun, J., Lin, C., & Faloutsos, C. (2011) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020580 · Cited by 109
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
Gehrke, J. E., Lui, E., & Pass, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_26 · Cited by 108
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
Choi, Y., & Wojciech Szpankowski, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173710 · Cited by 104
Graph Stream Summarization: From Big Bang to Big Crunch
Tang, N., Chen, Q., & Mitra, P. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2915223 · Cited by 101
gSketch: on query estimation in graph streams
Zhao, P., Aggarwal, C. C., & Wang, M. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2078331.2078335 · Cited by 100
Com2: 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-citationNeighbor query friendly compression of social networks
Maserrat, H., & Pei, J. (2010) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835873 · Cited by 91
A Survey of Clustering Algorithms for Graph Data
Aggarwal, C. C., & Wang, H. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_9 · Cited by 90
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
Surprising Patterns for the Call Duration Distribution of Mobile Phone Users
de Melo, P. O. S. V., Akoglu, L., Faloutsos, C., & Loureiro, A. A. F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15939-8_23 · Cited by 83
Model order selection for boolean matrix factorization
Miettinen, P., & Vreeken, J. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020424 · 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
MDL4BMF: Minimum Description Length for Boolean Matrix Factorization
Miettinen, P., & Vreeken, J. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2601437 · Cited by 76
MARGIN: Maximal frequent subgraph mining
Thomas, L. T., Valluri, S. R., & Karlapalem, K. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1839490.1839491 · Cited by 73
Guided learning for role discovery (GLRD): framework, algorithms, and applications
Gilpin, S., Eliassi‐Rad, T., & Davidson, I. A. K. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487620 · Cited by 70
Summarizing transactional databases with overlapped hyperrectangles
Xiang, Y., Jin, R., Fuhry, D., & Dragan, F. F. (2010) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0203-9 · Cited by 70
The Odd One Out: Identifying and Characterising Anomalies
Smets, K., & Vreeken, J. (2011) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.69 · Cited by 69
Fast influence-based coarsening for large networks
Purohit, M., Prakash, B. A., Kang, C., Zhang, Y., & Subrahmanian, V. S. (2014) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623701 · Cited by 63
Compression Picks Item Sets That Matter
van Leeuwen, M., Vreeken, J., & Siebes, A. P. J. M. (2006) · Lecture notes in computer science · doi:10.1007/11871637_59 · Cited by 62
Mining graph patterns efficiently via randomized summaries
Chen, C., Lin, C. X., Fredrikson, M., Christodorescu, M., Yan, X., & Han, J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687711 · Cited by 61
Frequent subgraph discovery in dynamic networks
Wackersreuther, B., Wackersreuther, P., Oswald, A., Böhm, C., & Borgwardt, K. M. (2010) · Mining and Learning with Graphs · doi:10.1145/1830252.1830272 · Cited by 59
Streaming Time Series Summarization Using User-Defined Amnesic Functions
Palpanas, T., Vlachos, M., Keogh, E., & Gunopulos, D. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190737 · Cited by 57
Building an Effective Representation for Dynamic Networks
Hill, S., Agarwal, D., Bell, R., & Volinsky, C. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x139162 · Cited by 55
Characterizing and Predicting Enterprise Email Reply Behavior
Yang, L., Dumais, S., Bennett, P. N., & Awadallah, A. H. (2017) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3077136.3080782 · Cited by 55
VEGAS: Visual influEnce GrAph Summarization on Citation Networks
Shi, L., Tong, H., Tang, J., & Lin, C. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2453957 · Cited by 54
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-citationModularity-Driven Clustering of Dynamic Graphs
Görke, R., Maillard, P., Staudt, C., & Wagner, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13193-6_37 · Cited by 49
Interestingness-Driven Diffusion Process Summarization in Dynamic Networks
Qu, Q., Liu, S., Jensen, C. S., Zhu, F., & Faloutsos, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44851-9_38 · Cited by 46
Generating Graph Snapshots from Streaming Edge Data
Soundarajan, S., Tamersoy, A., Khalil, E. B., Eliassi‐Rad, T., Chau, D. H., Gallagher, B. J., & Roundy, K. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872518.2889398 · Cited by 44
Characteristic relational patterns
Koopman, A., & Siebes, A. P. J. M. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557071 · Cited by 43
Role-dynamics: fast mining of large dynamic networks
Rossi, R. A., Gallagher, B. J., Neville, J., & Henderson, K. A. (2012) · International World Wide Web Conference (WWW) · doi:10.1145/2187980.2188234 · Cited by 41
Event Detection and Clustering for Surveillance Video Summarization
Damnjanovic, U., Fernandez, V., Ebroul Izquierdo, M., & Martínez, J. M. (2008) · International Workshop on Image Analysis for Multimedia Interactive Services (WIAMIS) · doi:10.1109/wiamis.2008.53 · Cited by 39
Net-Ray: Visualizing and Mining Billion-Scale Graphs
Kang, U., Lee, J. Y., Koutra, D., & Faloutsos, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06608-0_29 · Cited by 36
Self-citationTracking Communities in Dynamic Social Networks
Xu, K. S., Kliger, M., & Hero, A. O. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19656-0_32 · Cited by 35
If walls could talk: Patterns and anomalies in Facebook wallposts
Devineni, P., Koutra, D., Faloutsos, M., & Faloutsos, C. (2015) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2808797.2808880 · Cited by 35
Self-citationEgocentric Information Abstraction for Heterogeneous Social Networks
Li, C., & Lin, S.-D. (2009) · doi:10.1109/asonam.2009.38 · Cited by 34
On compressing weighted time-evolving graphs
Liu, W., Kan, A., Chan, J., Bailey, J., Leckie, C. A., Pei, J., & Ramamohanarao, K. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2398630 · Cited by 31
A Multi-Layer Model for the Web Graph
Laura, L., Leonardi, S., Caldarelli, G., & Rios, P. D. L. (2002) · IMT Institutional Repository (IMT School for Advanced Studies Lucca) · Cited by 27
Mining Summaries for Knowledge Graph Search
Song, Q., Wu, Y., & Dong, X. L. (2016) · Proceedings · doi:10.1109/icdm.2016.0162 · Cited by 27
Individual and Collective Graph Mining: Principles, Algorithms, and Applications
Koutra, D., & Faloutsos, C. (2017) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00796ed1v01y201708dmk014 · Cited by 26
Self-citationEfficient Frequent Directions Algorithm for Sparse Matrices
Ghashami, M., Liberty, E., & Phillips, J. M. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939800 · Cited by 25
Tight and simple Web graph compression for forward and reverse neighbor queries
Grabowski, S., & Bieniecki, W. (2013) · Discrete Applied Mathematics · doi:10.1016/j.dam.2013.05.028 · Cited by 20
Community Preserving Lossy Compression of Social Networks
Maserrat, H., & Pei, J. (2012) · Proceedings · doi:10.1109/icdm.2012.14 · Cited by 19
Scalable Hashing-Based Network Discovery
Safavi, T., Sripada, C., & Koutra, D. (2017) · Proceedings · doi:10.1109/icdm.2017.50 · Cited by 19
Self-citationMMSS: Multi-Modal Story-Oriented Video Summarization
Pan, J.-Y., Yang, H.-J., & Faloutsos, C. (2005) · Proceedings · doi:10.1109/icdm.2004.10033 · Cited by 18
Zero-knowledge private graph summarization
Shoaran, M., Thomo, A., & Weber-Jahnke, J. H. (2013) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2013.6691628 · Cited by 18
Exploratory Analysis of Graph Data by Leveraging Domain Knowledge
Jin, D., & Koutra, D. (2017) · Proceedings · doi:10.1109/icdm.2017.28 · Cited by 13
Self-citationPatterns amongst Competing Task Frequencies: Super-Linearities, and the Almond-DG Model
Koutra, D., Koutras, V. M., Prakash, B. A., & Faloutsos, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37453-1_17 · Cited by 12
Self-citationProceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics
Chau, P., Vreeken, J., van Leeuwen, M., et al. (2013) · doi:10.1145/2501511 · Cited by 12
Compression-Based Graph Mining Exploiting Structure Primitives
Feng, J., He, X., Hubig, N., Böhm, C., & Plant, C. (2013) · Proceedings · doi:10.1109/icdm.2013.56 · Cited by 11
Node Representation Learning for Multiple Networks: The Case of Graph Alignment.Preprint
Heimann, M., Shen, H., & Koutra, D. (2018) · arXiv (Cornell University) · Cited by 10
Self-citationPERSEUS-HUB: Interactive and Collective Exploration of Large-Scale Graphs
Jin, D., Leventidis, A. S., Shen, H., Zhang, R., Wu, J., & Koutra, D. (2017) · Informatics · doi:10.3390/informatics4030022 · Cited by 7
Self-citation
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
Blockchain Security: A Survey of Techniques and Research Directions
Leng, J., Zhou, M., Zhao, J. L., Huang, Y., & Bian, Y. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.3038641 · Cited by 279
Metadata
- Authors
- Liu, Y., Safavi, T., Dighe, A., & Koutra, D.
- Venue
- ACM Computing Surveys
- Published
- 2018-06-22
- Volume
- 51
- Issue
- 3
- Pages
- 1-34
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2962936633
- Cited by
- 274
- References
- 139
- FWCI
- 16.95
- Type
- journal article
- 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.