Polina Rozenshtein
Aristides Gionis
Abstract
Online social networks are often defined by considering interactions of entities at an aggregate level. For example, a call graph is formed among individuals who have called each other at least once; or at least k times. Similarly, in social-media platforms, we consider implicit social networks among users who have interacted in some way, e.g., have made a conversation, have commented to the content of each other, and so on. Such definitions have been used widely in the literature and they have offered significant insights regarding the structure of social networks. However, it is obvious that they suffer from a severe limitation: They neglect the precise time that interactions among the network entities occur.
In this article, we consider interaction networks, where the data description contains not only information about the underlying topology of the social network, but also the exact time instances that network entities interact. In an interaction network, an edge is associated with a timestamp, and multiple edges may occur for the same pair of entities. Consequently, interaction networks offer a more fine-grained representation, which can be leveraged to reveal otherwise hidden dynamic phenomena.
In the setting of interaction networks, we study the problem of discovering dynamic dense subgraphs whose edges occur in short time intervals. We view such subgraphs as fingerprints of dynamic activity occurring within network communities. Such communities represent groups of individuals who interact with each other in specific time instances, for example, a group of employees who work on a project and whose interaction intensifies before certain project milestones. We prove that the problem we define is NP-hard, and we provide efficient algorithms by adapting techniques for finding dense subgraphs. We also show how to speed-up the proposed methods by exploiting concavity properties of our objective function and by the means of fractional programming. We perform extensive evaluation of the proposed methods on synthetic and real datasets, which demonstrates the validity of our approach and shows that our algorithms can be used to obtain high-quality results.
- Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter Shor, and Robert Wilber. 1987. Geometric applications of a matrix-searching algorithm. Algorithmica 2, 1--4 (1987), 195--208.Google Scholar
Digital Library
- Leman Akoglu and Christos Faloutsos. 2010. Event detection in time series of mobile communication graphs. In Proceedings of Army Science Conference.Google Scholar
- Leman Akoglu, Hanghang Tong, and Danai Koutra. 2014. Graph-based anomaly detection and description: A survey. Data Mining and Knowledge Discovery 28, 4 (2014).Google Scholar
- Albert Angel, Nikos Sarkas, Nick Koudas, and Divesh Srivastava. 2012. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proceedings of the VLDB Endowment 5, 6 (2012), 574--585. Google ScholarDigital Library
- Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, and Takeshi Tokuyama. 2000. Greedily finding a dense subgraph. Journal of Algorithms 34, 2 (2000), 203--221. Google ScholarDigital Library
- Sitaram Asur, Srinivasan Parthasarathy, and Duygu Ucar. 2009. An event-based framework for characterizing the evolutionary behavior of interaction graphs. ACM Transactions on Knowledge Discovery from Data 3, 4 (2009), 16:1--16:36.Google Scholar
- Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg, and Xiangyang Lan. 2006. Group formation in large social networks: Membership, growth, and evolution. In Proceedings of KDD. Google ScholarDigital Library
- Gary D. Bader and Christopher W. V. Hogue. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 1 (2003), 1.Google ScholarCross Ref
- Michele Berlingerio, Francesco Bonchi, Björn Bringmann, and Aristides Gionis. 2009. Mining graph evolution rules. In Proceedings of ECML PKDD. Google ScholarDigital Library
- Michele Berlingerio, Fabio Pinelli, and Francesco Calabrese. 2013. ABACUS: Frequent pAttern mining-BAsed Community discovery in mUltidimensional networkS. Data Mining and Knowledge Discovery 27, 3 (2013), 294--320. Google ScholarCross Ref
- Alex Beutel, Wanhong Xu, Venkatesan Guruswami, Christopher Palow, and Christos Faloutsos. 2013. Copycatch: Stopping group attacks by spotting lockstep behavior in social networks. In Proceedings of the 22nd International Conference on World Wide Web. 119--130. Google ScholarDigital Library
- Petko Bogdanov, Misael Mongiovì, and Ambuj K. Singh. 2011. Mining heavy subgraphs in time-evolving networks. In Proceedings of ICDM. Google ScholarDigital Library
- Varun Chandola, Arindam Banerjee, and Vipin Kumar. 2009. Anomaly detection: A survey. ACM Computing Surveys (CSUR) 41, 3 (2009), 15.Google ScholarDigital Library
- Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In Proceedings of APPROX. Google ScholarCross Ref
- Werner Dinkelbach. 1967. On nonlinear fractional programming. Management Science 13, 7 (1967), 492--498. Google ScholarDigital Library
- Uriel Feige. 2004. Approximating maximum clique by removing subgraphs. SIAM Journal on Discrete Mathematics 18, 2 (2004), 219--225. Google ScholarDigital Library
- Gary William Flake, Steve Lawrence, and C. Lee Giles. 2000. Efficient identification of web communities. In Proceedings of KDD. Google ScholarDigital Library
- Santo Fortunato. 2010. Community detection in graphs. Physics Reports 486 (2010), 75--174. Google ScholarCross Ref
- Gabriel Pui Cheong Fung, Jeffrey Xu Yu, Philip S. Yu, and Hongjun Lu. 2005. Parameter free bursty events detection in text streams. In Proceedings of VLDB. 181--192.Google Scholar
- Zvi Galil and Kunsoo Park. 1992. Dynamic programming with convexity, concavity, and sparsity. Theoretical Computer Science 92, 1 (1992), 49--76. Google ScholarDigital Library
- Xinbo Gao, Bing Xiao, Dacheng Tao, and Xuelong Li. 2010. A survey of graph edit distance. Pattern Analysis and Applications 13, 1 (2010), 113--129. Google ScholarDigital Library
- David Gibson, Ravi Kumar, and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st International Conference on Very Large Databases. 721--732.Google ScholarDigital Library
- M. Girvan and M. E. J. Newman. 2002. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99 (2002), 7821--7826. Google ScholarCross Ref
- David F. Gleich and C. Seshadhri. 2012. Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In Proceedings of KDD. Google ScholarDigital Library
- Andrew V. Goldberg. 1984. Finding a maximum density subgraph. University of California Berkeley Technical Report (1984).Google Scholar
- Derek Greene, Donal Doyle, and Padraig Cunningham. 2010. Tracking the evolution of communities in dynamic social networks. In Proceedings of ASONAM. Google ScholarDigital Library
- Dan He and D. Stott Parker. 2010. Topic dynamics: An alternative model of bursts in streams of topics. In Proceedings of KDD. 10. Google ScholarDigital Library
- Petter Holme and Jari Saramäki. 2012. Temporal networks. Physics Reports 519, 3 (2012), 97--125. Google ScholarCross Ref
- Haiyan Hu, Xifeng Yan, Yu Huang, Jiawei Han, and Xianghong Jasmine Zhou. 2005. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21, suppl 1 (2005), i213--i221. Google ScholarDigital Library
- Tsuyoshi Ide and Hisashi Kashima. 2004. Eigenspace-based anomaly detection in computer systems. In Proceedings of KDD.Google Scholar
- Alexander Ihler, Jon Hutchins, and Padhraic Smyth. 2006. Adaptive event detection with time-varying poisson processes. In Proceedings of KDD. 207--216. Google ScholarDigital Library
- Samir Khuller, Anna Moss, and Joseph (Seffi) Naor. 1999. The budgeted maximum coverage problem. Information Processing Letters 70, 1 (1999), 39--45.Google ScholarDigital Library
- Jon Kleinberg. 2003. Bursty and hierarchical structure in streams. Data Mining and Knowledge Discovery 7, 4 (2003), 373--397. Google ScholarDigital Library
- Ariel Kulik, Hadas Shachnai, and Tami Tamir. 2009. Maximizing submodular set functions subject to multiple linear constraints. In Proceedings of SODA. Google ScholarCross Ref
- Ravi Kumar, Jasmine Novak, and Andrew Tomkins. 2006. Structure and evolution of online social networks. In Proceedings of KDD. Google ScholarDigital Library
- Jure Leskovec, Lars Backstrom, Ravi Kumar, and Andrew Tomkins. 2008. Microscopic evolution of social networks. In Proceedings of KDD. Google ScholarDigital Library
- Jure Leskovec, Kevin J. Lang, and Michael W. Mahoney. 2010. Empirical comparison of algorithms for network community detection. In Proceedings of WWW. Google ScholarDigital Library
- Rong-Hua Li, Jeffrey Xu Yu, and Rui Mao. 2014. Efficient core maintenance in large dynamic graphs. IEEE Transactions on Knowledge and Data Engineering 26, 10 (2014), 2453--2465. Google ScholarCross Ref
- Yu Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, and Belle Tseng. 2008. Facetnet: A framework for analyzing communities and their evolutions in dynamic networks. In Proceedings of WWW. Google ScholarDigital Library
- Peter J Mucha, Thomas Richardson, Kevin Macon, Mason A. Porter, and Jukka-Pekka Onnela. 2010. Community structure in time-dependent, multiscale, and multiplex networks. Science 328, 5980 (2010), 876--878.Google Scholar
- Seth A. Myers and Jure Leskovec. 2014. The bursty dynamics of the twitter information network. In Proceedings of the 23rd International Conference on World Wide Web (WWW’14). 12. Google ScholarDigital Library
- Mark E. J. Newman. 2006. Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103, 23 (2006), 8577--8582. Google ScholarCross Ref
- G. Palla, A. Barabási, and T. Vicsek. 2007. Quantifying social group evolution. Nature 446 (2007), 664--667. Google Scholar
- Panagiotis Papadimitriou, Ali Dasdan, and Hector Garcia-Molina. 2010. Web graph similarity for anomaly detection. Journal of Internet Services and Applications 1, 1 (2010), 19--30. Google ScholarCross Ref
- Pascal Pons and Matthieu Latapy. 2006. Computing communities in large networks using random walks. Journal of Graph Algorithms Applications 10, 2 (2006), 191--218. Google ScholarCross Ref
- Carey E. Priebe, John M. Conroy, David J. Marchette, and Youngser Park. 2005. Scan statistics on enron graphs. Computational 8 Mathematical Organization Theory 11, 3 (2005), 229--247.Google Scholar
- Martin Rosvall, Alcides V. Esquivel, Andrea Lancichinetti, Jevin D. West, and Renaud Lambiotte. 2014. Memory in network flows and its effects on spreading dynamics and community detection. Nature Communications 5 (2014), 4630--4643. Google ScholarCross Ref
- Polina Rozenshtein, Aris Anagnostopoulos, Aristides Gionis, and Nikolaj Tatti. 2014. Event detection in activity networks. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1176--1185. Google ScholarDigital Library
- Roded Sharan and Ron Shamir. 2000. CLICK: A clustering algorithm with applications to gene expression analysis. In Proceedings of the International Conference of Intelligent Systems for Molecular Biology (ISMB), vol. 8. 16.Google Scholar
- Kumar Sricharan and Kamalika Das. 2014. Localizing anomalous changes in time-evolving graphs. In Proceedings of SIGMOD. Google ScholarDigital Library
- Jimeng Sun, Christos Faloutsos, Spiros Papadimitriou, and Philip S. Yu. 2007. GraphScope: Parameter-free mining of large time-evolving graphs. In Proceedings of KDD. Google ScholarDigital Library
- Stijn van Dongen. 2000. Graph Clustering by Flow Simulation. Ph.D. Dissertation. University of Utrecht.Google Scholar
- Bimal Viswanath, Alan Mislove, Meeyoung Cha, and Krishna P. Gummadi. 2009. On the evolution of user interaction in facebook. In Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN’09). Barcelona, Spain. Google ScholarDigital Library
- Michail Vlachos, Christopher Meek, Zografoula Vagena, and Dimitrios Gunopulos. 2004. Identifying similarities, periodicities and bursts for online search queries. In Proceedings of SIGMOD. 131--142. Google ScholarDigital Library
- Robert E. Wilber. 1988. The concave least-weight subsequence problem revisited. Journal of Algorithms 9, 3 (1988), 418--425. Google ScholarDigital Library
- Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, and Yanchun Zhang. 2014. Efficient truss maintenance in evolving networks. arXiv Preprint arXiv:1402.2807 (2014).Google Scholar
- Yunyue Zhu and Dennis Shasha. 2003. Efficient elastic burst detection in data streams. In Proceedings of KDD. 336--345. Google ScholarDigital Library
Index Terms
- Finding Dynamic Dense Subgraphs
Recommendations
Discovering Dynamic Communities in Interaction Networks
Machine Learning and Knowledge Discovery in DatabasesAbstractOnline social networks are often defined by considering interactions over large time intervals, e.g., consider pairs of individuals who have called each other at least once in a mobilie-operator network, or users who have made a conversation in a ...
A local algorithm for finding dense subgraphs
We describe a local algorithm for finding subgraphs with high density, according to a measure of density introduced by Kannan and Vinay [1999]. The algorithm takes as input a bipartite graph G, a starting vertex v, and a parameter k, and outputs an ...
Lossless graph summarization using dense subgraphs discovery
IMCOM '15: Proceedings of the 9th International Conference on Ubiquitous Information Management and CommunicationDense subgraph discovery, in a large graph, is useful to solve the community search problem. Motivated from this, we propose a graph summarization method where we search and aggregate dense subgraphs into super nodes. Since the dense subgraphs have high ...
Comments