Fetching the paper…
Reading the bibliography…
The discovery of community structures in social networks has gained significant attention since it is a fundamental problem in understanding the networks' topology and functions.
A new status index derived from sociometric analysis
Leo Katz. 1953 · 1953
Earlier work this paper cites.
The Kronecker product of graphs
Paul M. Weichsel. 1962 · 1962
Earlier work this paper cites.
Group formation in large social networks: membership, growth, and evolution. In Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining (KDD ’06) . ACM, Philadelphia, PA, 44–54
Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. 2006 · 2006
Earlier work this paper cites.
Effects of missing data in social networks
Gueorgi Kossinets. 2006 · 2006
Earlier work this paper cites.
Sampling from large graphs. In Proceedings of the 12th International Conference on Knowledge Discovery and Data Mining (KDD ’06) . Philadelphia, PA, 631–636
Jure Leskovec and Christos Faloutsos. 2006 · 2006
Earlier work this paper cites.
Modularity and community structure in networks
M. E. J. Newman. 2006 · 2006
Earlier work this paper cites.
Community detection in large-scale social networks. In Proceedings of the 9th WebKDD and 1st SNA-KDD Workshop on Web mining and Social Network Analysis . San Jose, CA, 16–25
Nan Du, Bin Wu, Xin Pei, Bai Wang, and Liutong Xu. 2007 · 2007
Earlier work this paper cites.
Measurement and analysis of online social networks. In Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC ’07) . San Diego, CA, 29–42
Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, and Bobby Bhattacharjee. 2007 · 2007
Earlier work this paper cites.
Near linear time algorithm to detect community structures in large-scale networks
Usha Nandini Raghavan, Réka Albert, and Soundar Kumara. 2007 · 2007
Earlier work this paper cites.
Power-law distributions in empirical data
Aaron Clauset, Cosma Rohilla Shalizi, and M. E. J. Newman. 2009 · 2009
Earlier work this paper cites.
Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
Andrea Lancichinetti and Santo Fortunato. 2009 · 2009
Earlier work this paper cites.
Detecting the overlapping and hierarchical community structure in complex networks
Andrea Lancichinetti, Santo Fortunato, and János Kertész. 2009 · 2009
Earlier work this paper cites.
Towards real-time community detection in large networks
Ian X. Y. Leung, Pan Hui, Pietro Liò, and Jon Crowcroft. 2009 · 2009
Earlier work this paper cites.
Community detection in graphs
Santo Fortunato. 2010 · 2010
Earlier work this paper cites.
Finding overlapping communities in networks by label propagation
Steve Gregory. Oct. 2010 · 2010
Earlier work this paper cites.
Kronecker graphs: An approach to modeling networks
Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010a · 2010
Earlier work this paper cites.
How many people you know?: Efficiently estimating personal network size
Tyler H. McCormick, Matthew J. Salganik, and Tian Zheng. 2010 · 2010
Earlier work this paper cites.
FISH: A novel peer-to-peer overlay network based on hyper-deBruijn.. In Proceedings of the 11th International Conference on Web-Age Information Management (WAIM ’10) . Springer, Jiuzhaigou, China, 47–61
Ye Yuan, Guoren Wang, and Yongjiao Sun. 2010 · 2010
Earlier work this paper cites.
Capturing missing edges in social networks using vertex similarity. In Proceedings of the 6th International Conference on Knowledge Capture (K-CAP ’11) . Alberta, Canada, 195–196
Hung-Hsuan Chen, Liang Gou, Xiaolong Zhang, and C. Lee Giles. 2011 · 2011
Earlier work this paper cites.
Fast coordinate descent methods with variable selection for non-negative matrix factorization. In Proceedings of the 17th International Conference on Knowledge Discovery and Data Mining (KDD ’11) . ACM, San Diego, CA, 1064–1072
Cho-Jui Hsieh and Inderjit S. Dhillon. 2011 · 2011
Cited alongside, same era.
The network completion problem: Inferring missing nodes and edges in networks. In Proceedings of the 11th SIAM International Conference on Data Mining (SDM ’11) . SIAM, Mesa, AZ, 47–58
Myunghwan Kim and Jure Leskovec. 2011 · 2011
Cited alongside, same era.
Overlapping community detection using Bayesian non-negative matrix factorization
Ioannis Psorakis, Stephen Roberts, Mark Ebden, and Ben Sheldon. 2011 · 2011
Cited alongside, same era.
SLPA: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In Proceedings of the 11th International Conference on Data Mining Workshop (ICDMW ’11) . IEEE, Atlantic City, NJ, 344–349
Jierui Xie, Boleslaw K. Szymanski, and Xiaoming Liu. 2011 · 2011
Cited alongside, same era.
SNAP datasets: Stanford Large Network Dataset Collection. Retrieved from http://snap.stanford.edu/data
Jure Leskovec and Andrej Krevl. 2014 · 2014
Later among the works it cites.
Structure and overlaps of ground-truth communities in networks
Jaewon Yang and Jure Leskovec. 2014 · 2014
Later among the works it cites.
Privacy and human behavior in the age of information
Alessandro Acquisti, Laura Brandimarte, and George Loewenstein. 2015 · 2015
Later among the works it cites.
Defining and evaluating network communities based on ground-truth
Jaewon Yang and Jure Leskovec. 2015 · 2015
Later among the works it cites.
Infinite edge partition models for overlapping community detection and link prediction. In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics (AISTATS ’15) . San Diego, CA, 1135–1143
Mingyuan Zhou. 2015 · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Finding missing edges and communities in incomplete networks
Bowen Yan and Steve Gregory. 2011 · 2011
Cited alongside, same era.
Dense subgraph extraction with application to community detection
Jie Chen and Yousef Saad. 2012 · 2012
Cited alongside, same era.
Facebook users have become much more private: A large-scale study. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshop (PERCOM ’12) . IEEE, Lugano, Switzerland, 346–352
Ratan Dey, Zubin Jelveh, and Keith Ross. 2012 · 2012
Cited alongside, same era.
Learning to discover social circles in ego networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems (NIPS ’12) . Lake Tahoe, NV, 539–547
Jure Leskovec and Julian J. Mcauley. Dec. 2012 · 2012
Cited alongside, same era.
Community detection in social media
Symeon Papadopoulos, Yiannis Kompatsiaris, Athena Vakali, and Ploutarchos Spyridonos. 2012 · 2012
Cited alongside, same era.
Estimation of simultaneously sparse and low rank matrices. In Proceedings of the 29th International Conference on Machine Learning (ICML ’12) . Edinburgh, Scotland, 51–58
Emile Richard, Pierre-André Savalle, and Nicolas Vayatis. 2012 · 2012
Cited alongside, same era.
Detecting community structure in networks using edge prediction methods
Bowen Ya and Steve Gregory. 2012 · 2012
Cited alongside, same era.
Community detection algorithm based on centrality and node distance in scale-free networks. In Proceedings of the 24th ACM Conference on Hypertext and Social Media (HT ’13) . New York, NY, 258–262
Sorn Jarukasemratana, Tsuyoshi Murata, and Xin Liu. 2013 · 2013
Cited alongside, same era.
Efficient methods for influence-based network-oblivious community detection
Nicola Barbieri, Francesco Bonchi, and Giuseppe Manco. 2016 · 2016
Later among the works it cites.
Overlapping community detection using neighborhood-inflated seed expansion
Joyce Jiyoung Whang, David F. Gleich, and Inderjit S. Dhillon. 2016 · 2016
Later among the works it cites.
Provable and practical approximations for the degree distribution using sublinear graph samples. In Proceedings of the 2018 World Wide Web Conference (WWW ’18) . IW3C2, Lyon, France, 449–458
Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, and C. Seshadhri. 2018 · 2018
Closest in time.
Local spectral clustering for overlapping community detection
Yixuan Li, Kun He, Kyle Kloster, David Bindel, and John Hopcroft. 2018 · 2018
Closest in time.
Supervised community detection with line graph neural networks. In Proceedings of the 7th International Conference on Learning Representations (ICLR ’19) . ACM, New Orleans, LA
Zhengdao Chen, Lisha Li, and Joan Bruna. 2019 · 2019
Closest in time.
LinkBlackHole*: Robust overlapping community detection using link embedding
Jungeun Kim, Sungsu Lim, Jae-Gil Lee, and Byung Suk Lee. 2019 · 2019
Closest in time.
Overlapping community detection with graph neural networks. In Proceedings of the 25th International Conference on Knowledge Discovery and Data Mining Workshop (DLG ’19)
Oleksandr Shchur and Stephan Günnemann. 2019 · 2019
Closest in time.
vGraph: A generative model for joint community detection and node representation learning. In Proceedings of the 33rd International Conference on Neural Information Processing Systems (NIPS ’19) . Vancouver, Canada, 512–522
Fan-Yun Sun, Meng Qu, Jordan Hoffmann, Chin-Wei Huang, and Jian Tang. Dec. 2019 · 2019
Closest in time.
Link communities detection: An embedding method on the line hypergraph
Haicheng Tao, Zhe Li, Zhiang Wu, and Jie Cao. 2019 · 2019
Closest in time.
Autonomous semantic community detection via adaptively weighted low-rank approximation
Liang Yang, Yuexue Wang, Junhua Gu, Xiaochun Cao, Xiao Wang, Di Jin, Guiguang Ding, Jungong Han, and Weixiong Zhang. Nov. 2019 · 2019
Closest in time.
Community detection in networks without observing edges
Till Hoffmann, Leto Peel, Renaud Lambiotte, and Nick S. Jones. 2020 · 2020
Closest in time.
Community detection by motif-aware label propagation
Pei-Zhen Li, Ling Huang, Chang-Dong Wang, Jian-Huang Lai, and Dong Huang. 2020 · 2020
Closest in time.
Network embedding for community detection in attributed networks
Heli Sun, Fang He, Jianbin Huang, Yizhou Sun, Yang Li, Chenyu Wang, Liang He, Zhongbin Sun, and Xiaolin Jia. 2020 · 2020
Closest in time.