Fetching the paper…
Reading the bibliography…
Graph clustering is widely used in analysis of biological networks, social networks and etc.
Comparing partitions
L. Hubert and P. Arabie. 1985 · 1985
Earlier work this paper cites.
Collective dynamics of ’small-world’ networks
Duncan J. Watts and Steven Strogatz. 1998 · 1998
Earlier work this paper cites.
Graph clustering by flow simulation
Stijn Marinus Van Dongen. 2000 · 2000
Earlier work this paper cites.
Community structure in social and biological networks
M Girvan and M. E.J. Newman. 2002 · 2002
Earlier work this paper cites.
An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs
Benedek Rozemberczki, Oliver Kiss, and Rik Sarkar. 2020 · 2003
Earlier work this paper cites.
Multiclass spectral clustering. In
X Yu Stella and Jianbo Shi. 2003 · 2003
Earlier work this paper cites.
Finding community structure in very large networks
Aaron Clauset, M. E.J. Newman, and Cristopher Moore. 2004 · 2004
Earlier work this paper cites.
Graph clustering and minimum cut trees
Gary William Flake, Robert E. Tarjan, and Kostas Tsioutsiouliklis. 2004 · 2004
Earlier work this paper cites.
The igraph software package for complex network research
Gabor Csardi and Tamas Nepusz. 2006 · 2006
Earlier work this paper cites.
Finding community structure in networks using the eigenvectors of matrices
M. E.J. Newman. 2006 · 2006
Earlier work this paper cites.
Computing communities in large networks using random walks
Pascal Pons and Matthieu Latapy. 2006 · 2006
Earlier work this paper cites.
Statistical mechanics of community detection
Jörg Reichardt and Stefan Bornholdt. 2006 · 2006
Earlier work this paper cites.
Clustering by passing messages between data points
Brendan J Frey and Delbert Dueck. 2007 · 2007
Earlier work this paper cites.
An Algorithm to Find Overlapping Community Structure in Networks
Steve Gregory. 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.
V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure.. In
Andrew Rosenberg and Julia Hirschberg. 2007 · 2007
Earlier work this paper cites.
Extracting the hierarchical organization of complex systems
Marta Sales-Pardo, Roger Guimera, André A Moreira, and Luís A Nunes Amaral. 2007 · 2007
Earlier work this paper cites.
Analysis of the structure of complex networks at different resolution levels
A. Arenas, A. Fernández, and S. Gómez. 2008 · 2008
Earlier work this paper cites.
Fast unfolding of communities in large networks
Vincent D Blondel, Jean Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008 · 2008
Earlier work this paper cites.
Sequential algorithm for fast clique percolation
Jussi M Kumpula, Mikko Kivelä, Kimmo Kaski, and Jari Saramäki. 2008 · 2008
Earlier work this paper cites.
Benchmark graphs for testing community detection algorithms
Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. 2008 · 2008
Earlier work this paper cites.
Maps of random walks on complex networks reveal community structure
Martin Rosvall and Carl T. Bergstrom. 2008a · 2008
Earlier work this paper cites.
Maps of random walks on complex networks reveal community structure
Martin Rosvall and Carl T Bergstrom. 2008b · 2008
Earlier work this paper cites.
Detect overlapping and hierarchical community structure in networks
Huawei Shen, Xueqi Cheng, Kai Cai, and Mao Bin Hu. 2009 · 2008
Earlier work this paper cites.
The existence and discovery of overlapping communities in large-scale networks
Stephen Kelley. 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. 2009a · 2009
Cited alongside, same era.
Community detection algorithms: A comparative analysis
Andrea Lancichinetti and Santo Fortunato. 2009b · 2009
Cited alongside, same era.
Detecting the overlapping and hierarchical community structure in complex networks
Andrea Lancichinetti, Santo Fortunato, and János Kertész. 2009 · 2009
Cited alongside, same era.
Community detection in networks with positive and negative links
V A Traag and Jeroen Bruggeman. 2009 · 2009
Cited alongside, same era.
Detecting communities in networks by Merging Cliques. In
Bowen Yan and Steve Gregory. 2009 · 2009
Fast Multi-Scale Detection of Relevant Communities
Erwan Le Martelot and Chris Hankin. 2013 · 2013
Later among the works it cites.
An ensemble learning strategy for graph clustering
Michael Ovelgönne and Andreas Geyer-Schulz. 2013 · 2013
Later among the works it cites.
Graph clustering with local search optimization: The resolution bias of the objective function matters most
Twan van Laarhoven and Elena Marchiori. 2013 · 2013
Later among the works it cites.
Labelrank: A stabilized label propagation algorithm for community detection in networks. In
Jierui Xie and Boleslaw K Szymanski. 2013 · 2013
Later among the works it cites.
Overlapping community detection at scale: a nonnegative matrix factorization approach. In
Jaewon Yang and Jure Leskovec. 2013 · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Link communities reveal multiscale complexity in networks
Yong-Yeol Ahn, James P Bagrow, and Sune Lehmann. 2010 · 2010
Cited alongside, same era.
Finding overlapping communities in networks by label propagation
Steve Gregory. 2010 · 2010
Cited alongside, same era.
Detecting highly overlapping community structure by greedy clique expansion
Conrad Lee, Fergal Reid, Aaron McDaid, and Neil Hurley. 2010 · 2010
Cited alongside, same era.
Scalable discovery of best clusters on large graphs
Kathy Macropol and Ambuj Singh. 2010 · 2010
Cited alongside, same era.
Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion. In
Aaron McDaid and Neil Hurley. 2010 · 2010
Cited alongside, same era.
Local resolution-limit-free Potts model for community detection
Peter Ronhovde and Zohar Nussinov. 2010 · 2010
Cited alongside, same era.
Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance
Nguyen Xuan Vinh, Julien Epps, and James Bailey. 2010 · 2010
Cited alongside, same era.
Uncovering hierarchical and overlapping communities with a local-first approach
Michele Coscia, Giulio Rossetti, Fosca Giannotti, and Dino Pedreschi. 2014 · 2014
Later among the works it cites.
High quality, scalable and parallel community detection for large real graphs. In
Arnau Prat-Pérez, David Dominguez-Sal, and Josep-Lluis Larriba-Pey. 2014 · 2014
Later among the works it cites.
GossipMap: A distributed community detection algorithm for billion-edge directed graphs. In
Seung Hee Bae and Bill Howe. 2015 · 2015
Later among the works it cites.
SCAN++: Efficient Algorithm for Finding Clusters , Hubs and Outliers on Large-scale Graphs
Hiroaki Shiokawa, Yasuhiro Fujiwara, and Makoto Onizuka. 2015 · 2015
Later among the works it cites.
PSCAN : Fast and Exact Structural Graph Clustering
Lijun Chang, Wei Li, Lu Qin, Wenjie Zhang, and Shiyu Yang. 2017 · 2016
Later among the works it cites.
SNAP: A General-Purpose Network Analysis and Graph-Mining Library
Jure Leskovec and Rok Sosič. 2016 · 2016
Later among the works it cites.
NetworKit: A tool suite for large-scale complex network analysis
Christian L Staudt, Aleksejs Sazonovs, and Henning Meyerhenke. 2016 · 2016
Later among the works it cites.
A comparative analysis of community detection algorithms on artificial networks
Zhao Yang, René Algesheimer, and Claudio J Tessone. 2016 · 2016
Later among the works it cites.
Ego-splitting framework: From non-overlapping to overlapping clusters. In
Alessandro Epasto, Silvio Lattanzi, and Renato Paes Leme. 2017 · 2017
Later among the works it cites.
A Streaming Algorithm for Graph Clustering
Alexandre Hollocou, Julien Maudet, Thomas Bonald, and Marc Lelarge. 2017 · 2017
Later among the works it cites.
Scalable and interactive graph clustering algorithm on multicore CPUs. In
Son T. Mai, Martin Storgaard Dieu, Ira Assent, Jon Jacobsen, Jesper Kristensen, and Mathias Birk. 2017 · 2017
Later among the works it cites.
A non-negative symmetric encoder-decoder approach for community detection. In
Bing-Jie Sun, Huawei Shen, Jinhua Gao, Wentao Ouyang, and Xueqi Cheng. 2017 · 2017
Later among the works it cites.
Hierarchical Graph Clustering using Node Pair Sampling
Thomas Bonald, Bertrand Charpentier, Alexis Galland, and Alexandre Hollocou. 2018 · 2018
Later among the works it cites.
Parallelizing pruning-based graph structural clustering. In
Yulin Che, Shixuan Sun, and Qiong Luo. 2018 · 2018
Later among the works it cites.
Distributed Graph Clustering Using Modularity and Map Equation. In
Michael Hamann, Ben Strasser, Dorothea Wagner, and Tim Zeitz. 2018 · 2018
Later among the works it cites.
Deep autoencoder-like nonnegative matrix factorization for community detection. In
Fanghua Ye, Chuan Chen, and Zibin Zheng. 2018 · 2018
Later among the works it cites.
EdMot: An Edge Enhancement Approach for Motif-aware Community Detection. In
Pei-Zhen Li, Ling Huang, Chang-Dong Wang, and Jian-Huang Lai. 2019 · 2019
Later among the works it cites.
SpaRC: scalable sequence clustering using Apache Spark
Lizhen Shi, Xiandong Meng, Elizabeth Tseng, Michael Mascagni, and Zhong Wang. 2019 · 2019
Later among the works it cites.
Deconvolute individual genomes from metagenome sequences through short read clustering
Kexue Li, Yakang Lu, Li Deng, Lili Wang, Lizhen Shi, and Zhong Wang. 2020 · 2020
Closest in time.