Access the full text.
Sign up today, get DeepDyve free for 14 days.
Rainer Gemulla, Wolfgang Lehner, P. Haas (2008)
Maintaining bounded-size sample synopses of evolving datasetsThe VLDB Journal, 17
A. Pavan, Kanat Tangwongsan, S. Tirthapura, Kun-Lung Wu (2013)
Counting and Sampling Triangles from a Graph StreamProc. VLDB Endow., 6
A. Mcgregor (2014)
Graph stream algorithms: a surveySIGMOD Rec., 43
Madhav Jha, Comandur Seshadhri, Ali Pinar (2013)
A space efficient streaming algorithm for triangle counting using the birthday paradoxKDD’13.
Madhav Jha, Seshadhri Comandur, Ali Pinar (2012)
A space efficient streaming algorithm for triangle counting using the birthday paradoxProceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
P. Wang, Yiyan Qi, Yu Sun, Xiangliang Zhang, Jing Tao, X. Guan (2017)
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory UsageProc. VLDB Endow., 11
L. Stefani, Alessandro Epasto, Matteo Riondato, E. Upfal (2016)
TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory SizeProceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
J. Leskovec, Kevin Lang, Anirban Dasgupta, Michael Mahoney (2008)
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined ClustersInternet Mathematics, 6
Kanat Tangwongsan, A. Pavan, S. Tirthapura (2013)
Parallel triangle counting in massive streaming graphsProceedings of the 22nd ACM international conference on Information & Knowledge Management
A. Barabási, R. Albert (1999)
Emergence of scaling in random networksScience, 286 5439
A. Mislove, M. Marcon, K. Gummadi, P. Druschel, Bobby Bhattacharjee (2007)
Measurement and analysis of online social networks
P. Massa, P. Avesani (2005)
Controversial Users Demand Local Trust Metrics: An Experimental Study on Epinions.com Community
(2001)
The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools
Meng Jiang, Alex Beutel, Peng Cui, Bryan Hooi, Shiqiang Yang, Christos Faloutsos (2015)
A general suspiciousness metric for dense blocks in multimodal dataICDM’15.
(2010)
Eigenspokes: Surprising patterns and community structure in large graphs
L. Becchetti, P. Boldi, C. Castillo, A. Gionis (2010)
Efficient algorithms for large-scale local triangle countingACM Trans. Knowl. Discov. Data, 4
Charalampos Tsourakakis, U. Kang, G. Miller, C. Faloutsos (2009)
DOULION: counting triangles in massive graphs with a coin
Reid Andersen, K. Chellapilla (2009)
Finding Dense Subgraphs with Size Bounds
Kanat Tangwongsan, Aduri Pavan, Srikanta Tirthapura (2013)
Parallel triangle counting in massive streaming graphsCIKM’13.
S. Wasserman, Katherine Faust (1994)
Social Network Analysis: Contents
L. Bulteau, Vincent Froese, Konstantin Kutzkov, R. Pagh (2014)
Triangle Counting in Dynamic Graph StreamsAlgorithmica, 76
Jaewon Yang, J. Leskovec (2012)
Defining and evaluating network communities based on ground-truthKnowledge and Information Systems, 42
Jonathan Berry, B. Hendrickson, R. LaViolette, C. Phillips (2008)
Tolerating the community detection resolution limit with edge weighting.Physical review. E, Statistical, nonlinear, and soft matter physics, 83 5 Pt 2
Xiaocheng Hu, Yufei Tao, C. Chung (2014)
I/O-Efficient Algorithms on Triangle Listing and CountingACM Transactions on Database Systems (TODS), 39
M. Charikar (2000)
Greedy approximation algorithms for finding dense components in a graph
Sayan Bhattacharya, M. Henzinger, Danupon Nanongkai, Charalampos Tsourakakis (2015)
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic StreamsProceedings of the forty-seventh annual ACM symposium on Theory of Computing
Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis (2010)
Efficient triangle counting in large graphs via degree-based vertex partitioningWAW’10.
Charalampos Tsourakakis, P. Drineas, E. Michelakis, I. Koutis, C. Faloutsos (2011)
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendationSocial Network Analysis and Mining, 1
Brian Babcock, Mayur Datar, R. Motwani (2002)
Sampling from a moving window over streaming data
D. Watts, S. Strogatz (1998)
Collective dynamics of ‘small-world’ networksNature, 393
L. Stefani, Alessandro Epasto, Matteo Riondato, E. Upfal (2017)
TRIÈSTACM Transactions on Knowledge Discovery from Data (TKDD), 11
P. Brown, P. Haas (2006)
Techniques for Warehousing of Sample Data22nd International Conference on Data Engineering (ICDE'06)
Meng Jiang, Alex Beutel, Peng Cui, Bryan Hooi, Shiqiang Yang, C. Faloutsos (2015)
A General Suspiciousness Metric for Dense Blocks in Multimodal Data2015 IEEE International Conference on Data Mining
Andreas Kemper (2009)
Valuation of Network Effects in Software Markets: A Complex Networks ApproachSpringer Science 8 Business Media., 8
R. Pagh, Charalampos Tsourakakis (2011)
Colorful triangle counting and a MapReduce implementationInf. Process. Lett., 112
Victor Lee, Ning Ruan, R. Jin, C. Aggarwal (2010)
A Survey of Algorithms for Dense Subgraph Discovery
Bryan Klimt, Yiming Yang (2004)
Introducing the Enron Corpus
Kijung Shin, Bryan Hooi, Jisu Kim, C. Faloutsos (2017)
DenseAlert: Incremental Dense-Subtensor Detection in Tensor StreamsProceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Kijung Shin, Bryan Hooi, Jisu Kim, Christos Faloutsos (2017a)
D-Cube: Dense-block detection in terabyte-scale tensorsWSDM’17.
Kijung Shin, Mohammad Hammoud, Euiwoong Lee, Jinoh Oh, C. Faloutsos (2018)
Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams
Charalampos Tsourakakis (2008)
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws2008 Eighth IEEE International Conference on Data Mining
P. Holland, S. Leinhardt (1971)
Transitivity in Structural Models of Small GroupsSmall Group Research, 2
S. Wasserman, Katherine Faust (1994)
Social Network Analysis: Methods and Applications, 8
A. Goldberg (1984)
Finding a Maximum Density Subgraph
M. Newman (2003)
The Structure and Function of Complex NetworksSIAM Rev., 45
B. Bahmani, Ravi Kumar, Sergei Vassilvitskii (2012)
Densest Subgraph in Streaming and MapReduceArXiv, abs/1201.6567
Andrew McGregor (2014)
Graph stream algorithms: A surveyACM SIGMOD Record, 43
Nesreen K. Ahmed, Nick Duffield, Jennifer Neville, Ramana Kompella (2014)
Graph sample and hold: A framework for big-graph analyticsKDD’14.
Kijung Shin, Bryan Hooi, C. Faloutsos (2018)
Fast, Accurate, and Flexible Algorithms for Dense Subtensor MiningACM Transactions on Knowledge Discovery from Data (TKDD), 12
C. Spearman (2015)
The proof and measurement of association between two things.International journal of epidemiology, 39 5
Siddharth Suri, Sergei Vassilvitskii (2011)
Counting triangles and the curse of the last reducer
Kijung Shin, Tina Eliassi-Rad, C. Faloutsos (2018)
Patterns and anomalies in k-cores of real-world graphs with applicationsKnowledge and Information Systems, 54
Muhammad Anis Uddin Nasir, Aristides Gionis, Gianmarco De Francisci Morales, Sarunas Girdzijauskas (2017)
Fully dynamic algorithm for top-k densest subgraphsCIKM’17.
Nesreen Ahmed, N. Duffield, Jennifer Neville, R. Kompella (2014)
Graph sample and hold: a framework for big-graph analyticsProceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
S. Khuller, B. Saha (2009)
On Finding Dense Subgraphs
Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar (2002)
Reductions in streaming algorithms, with an application to counting triangles in graphs
V. Batagelj, Matjaz Zaversnik (2007)
Short cycle connectivityDiscret. Math., 307
Kijung Shin, Jisu Kim, Bryan Hooi, Christos Faloutsos
2018dThink before you discard: Accurate triangle counting in graph streams with deletions. In ECML/PKDD’18.
Kijung Shin, Jisu Kim, Bryan Hooi, C. Faloutsos (2018)
Think Before You Discard: Accurate Triangle Counting in Graph Streams with Deletions
Meng Jiang, Peng Cui, Alex Beutel, C. Faloutsos, Shiqiang Yang (2014)
CatchSync: catching synchronized behavior in large directed graphsProceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
M. Kolountzakis, G. Miller, Richard Peng, Charalampos Tsourakakis (2010)
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex PartitioningInternet Mathematics, 8
Kijung Shin, Bryan Hooi, Jisu Kim, Christos Faloutsos (2017b)
DenseAlert: Incremental dense-subtensor detection in tensor streamsKDD’17. ACM
Michael Ley (2002)
The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
Michael Crouch, A. Mcgregor, Daniel Stubbs (2013)
Dynamic Graphs in the Sliding-Window Model
Kijung Shin (2017)
WRS: Waiting Room Sampling for Accurate Triangle Counting in Real Graph Streams2017 IEEE International Conference on Data Mining (ICDM)
Meng Jiang, Peng Cui, Alex Beutel, Christos Faloutsos, Shiqiang Yang (2014)
Catchsync: Catching synchronized behavior in large directed graphsKDD’14.
Koji Maruhashi, Fan Guo, Christos Faloutsos (2011)
Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysisASONAM’11.
Minsoo Jung, Sunmin Lee, Yongsub Lim, U. Kang (2016)
FURL: Fixed-memory and uncertainty reducing local triangle counting for multigraph streamsData Mining and Knowledge Discovery
J. Vitter (1985)
Random sampling with a reservoirACM Trans. Math. Softw., 11
Kijung Shin, Bryan Hooi, Christos Faloutsos
2018cFast, 12
C. Spearman (1987)
The proof and measurement of association between two things. By C. Spearman, 1904.The American journal of psychology, 100 3-4
Guyue Han, H. Sethu (2017)
Edge Sample and Discard: A New Algorithm for Counting Triangles in Large Dynamic Graphs2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
Jun Sun, Jérôme Kunegis, Steffen Staab (2016)
Predicting User Roles in Social Networks Using Transfer Learning with Feature Transformation2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)
Alessandro Epasto, Silvio Lattanzi, Mauro Sozio (2015)
Efficient Densest Subgraph Computation in Evolving GraphsProceedings of the 24th International Conference on World Wide Web
Bimal Viswanath, A. Mislove, M. Cha, K. Gummadi (2009)
On the evolution of user interaction in Facebook
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos Tsourakakis (2015)
Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streamsSTOC’15.
Yongsub Lim, Minsoo Jung, U. Kang (2018)
Memory-Efficient and Accurate Sampling for Counting Local Triangles in Graph StreamsACM Transactions on Knowledge Discovery from Data (TKDD), 12
Alex Beutel, Wanhong Xu, V. Guruswami, Christopher Palow, C. Faloutsos (2013)
CopyCatch: stopping group attacks by spotting lockstep behavior in social networksProceedings of the 22nd international conference on World Wide Web
Paul W. Holland, Samuel Leinhardt (1971)
Transitivity in structural models of small groupsComp. Group Stud, 2
Alex Beutel, Wanhong Xu, Venkatesan Guruswami, Christopher Palow, Christos Faloutsos (2013)
Copycatch: Stopping group attacks by spotting lockstep behavior in social networksWWW’13.
Muhammad Nasir, A. Gionis, G. Morales, Sarunas Girdzijauskas (2016)
Fully Dynamic Algorithm for Top-k Densest SubgraphsProceedings of the 2017 ACM on Conference on Information and Knowledge Management
Shumo Chu, James Cheng (2012)
Triangle listing in massive networksACM Trans. Knowl. Discov. Data, 6
David Gibson, Ravi Kumar, A. Tomkins (2005)
Discovering Large Dense Subgraphs in Massive Graphs
Mayur Datar, A. Gionis, P. Indyk, R. Motwani (2002)
Maintaining Stream Statistics over Sliding WindowsSIAM J. Comput., 31
Alessandro Epasto, Silvio Lattanzi, Mauro Sozio (2015a)
Efficient densest subgraph computation in evolving graphsWWW’15.
Yongsub Lim, Minsoo Jung, U. Kang (2018)
Memory-efficient and accurate sampling for counting local triangles in graph streams: from simple to multigraphsTKDD, 12
Alessandro Epasto, Silvio Lattanzi, V. Mirrokni, Ismail Sebe, Ahmed Taei, Sunita Verma (2015)
Ego-net Community Mining Applied to Friend SuggestionProc. VLDB Endow., 9
A. Mcgregor, D. Tench, Sofya Vorotnikova, H. Vu (2015)
Densest Subgraph in Dynamic Graph StreamsArXiv, abs/1506.04417
A. Kemper (2010)
Valuation of Network Effects in Software Markets
Nesreen Ahmed, N. Duffield, Theodore Willke, Ryan Rossi (2017)
On Sampling from Massive Graph StreamsProc. VLDB Endow., 10
Bryan Hooi, Kijung Shin, H. Song, Alex Beutel, Neil Shah, C. Faloutsos (2017)
Graph-Based Fraud Detection in the Face of CamouflageACM Transactions on Knowledge Discovery from Data (TKDD), 11
Polina Rozenshtein, Nikolaj Tatti, A. Gionis (2017)
Finding Dynamic Dense SubgraphsACM Transactions on Knowledge Discovery from Data (TKDD), 11
Duncan Luce, Albert Perry (1949)
A method of matrix analysis of group structurePsychometrika, 14
We used the Facebook and Epinion datasets because the edges in them have timestamps. We ignored the edges with missing timestamps
Kijung Shin, Bryan Hooi, Jisu Kim, C. Faloutsos (2017)
D-Cube: Dense-Block Detection in Terabyte-Scale TensorsProceedings of the Tenth ACM International Conference on Web Search and Data Mining
Paolo Massa, Paolo Avesani (2005)
Controversial users demand local trust metrics: An experimental study on epinionscom community. In AAAI’05.
Charalampos E Tsourakakis (2008)
Fast counting of triangles in large real networks without counting: Algorithms and lawsICDM’08.
Koji Maruhashi, Fan Guo, C. Faloutsos (2011)
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis2011 International Conference on Advances in Social Networks Analysis and Mining
Given a stream of edge additions and deletions, how can we estimate the count of triangles in it? If we can store only a subset of the edges, how can we obtain unbiased estimates with small variances? Counting triangles (i.e., cliques of size three) in a graph is a classical problem with applications in a wide range of research areas, including social network analysis, data mining, and databases. Recently, streaming algorithms for triangle counting have been extensively studied since they can naturally be used for large dynamic graphs. However, existing algorithms cannot handle edge deletions or suffer from low accuracy. Can we handle edge deletions while achieving high accuracy? We propose ThinkD, which accurately estimates the counts of global triangles (i.e., all triangles) and local triangles associated with each node in a fully dynamic graph stream with additions and deletions of edges. Compared to its best competitors, ThinkD is (a) Accurate: up to 4.3 more accurate within the same memory budget, (b) Fast: up to 2.2 faster for the same accuracy requirements, and (c) Theoretically sound: always maintaining estimates with zero bias (i.e., the difference between the true triangle count and the expected value of its estimate) and small variance. As an application, we use ThinkD to detect suddenly emerging dense subgraphs, and we show its advantages over state-of-the-art methods.
ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery
Published: Feb 10, 2020
Keywords: Triangle counting
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.