Fetching the paper…
Reading the bibliography…
A central problem in e-commerce is determining overlapping communities among individuals or objects in the absence of external identification or tagging.
Random walks and electric networks
P. Doyle and J. Snell · 1984
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
A constant-factor approximation algorithm for the k-median problem
M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys · 1999
Earlier work this paper cites.
Pattern classification
R. Duda, P. E. Hart, and D. G. Stork · 2001
Earlier work this paper cites.
A new greedy approach for facility location problems
K. Jain, M. Mahdian, and A. Saberi · 2002
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
D. A. Spielman and S.-H. Teng · 2004
Earlier work this paper cites.
A divide-and-merge methodology for clustering
D. Cheng, R. Kannan, S. Vempala, and G. Wang · 2005
Earlier work this paper cites.
Local graph partitioning using pagerank vectors
R. Andersen, F. Chung, and K. Lang · 2006
Earlier work this paper cites.
Modularity and community structure in networks
M. E. J. Newman · 2006
Cited alongside, same era.
Cluster analysis of heterogeneous rank data
L. M. Busse, P. Orbanz, and J. M. Buhmann · 2007
Cited alongside, same era.
Clustering social networks
N. Mishra, R. Schreiber, I. Stanton, and R. Tarjan · 2007
Cited alongside, same era.
Geometric Spanning Networks
G. Narasimhan and M. Smid · 2007
Cited alongside, same era.
A discriminative framework for clustering via similarity functions
M.-F. Balcan, A. Blum, and S. Vempala · 2008
Cited alongside, same era.
D. A. Spielman and S.-H. Teng · 2008
Cited alongside, same era.
Finding strongly-knit clusters in social networks
N. Mishra, R. Schreiber, I. Stanton, and R. Tarjan · 2009
Later among the works it cites.
Finding local communities in protein networks
K. Voevodski, S. Teng, and Y. Xia · 2009
Later among the works it cites.
A game-theoretic framework to identify overlapping communities in social networks
W. Chen, Z. Liu, X. Sun, and Y. Wang · 2010
Later among the works it cites.
Empirical comparison of algorithms for network community detection
J. Leskovec, K. Lang, and M. Mahoney · 2010
Later among the works it cites.
Finding overlapping communities in social networks: Toward a rigorous approach
A. Arora, T. Ge, S. Sachdeva, and G. Schoenebeck · 2011
Later among the works it cites.
How hard is it to approximate the best nash equilibrium
E. Hazan and R. Krauthgamer · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney · 2009
Cited alongside, same era.
Detecting the structure of social networks using ( α \alpha , β \beta )-communities
J. He, J. E. Hopcroft, H. Liang, S. Suwajanakorn, and L. Wang · 2011
Later among the works it cites.