On generating all maximal independent sets
Information Processing Letters
A parallel algorithm for multilevel graph partitioning and sparse matrix ordering
Journal of Parallel and Distributed Computing
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A clustering algorithm based on graph connectivity
Information Processing Letters
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On clusterings-good, bad and spectral
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A new cluster algorithm for graphs
A new cluster algorithm for graphs
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A decentralized algorithm for spectral analysis
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Scalable discovery of best clusters on large graphs
Proceedings of the VLDB Endowment
Load-balanced migration of social media to content clouds
Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video
Overlapping clusters for distributed computation
Proceedings of the fifth ACM international conference on Web search and data mining
Finding overlapping communities in social networks: toward a rigorous approach
Proceedings of the 13th ACM Conference on Electronic Commerce
Advantage of overlapping clusters for minimizing conductance
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
On spectral partitioning of co-authorship networks
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Overlapping community detection using seed set expansion
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
Modeling and detecting community hierarchies
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Deflation-based power iteration clustering
Applied Intelligence
| Hi-index | 0.00 |
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that clusters typically do not overlap, all vertices are clustered and/or external sparsity is ignored. We introduce a new criterion that overcomes these limitations by combining internal density with external sparsity in a natural way. An algorithm is given for provably finding the clusters, provided there is a sufficiently large gap between internal density and external sparsity. Experiments on real social networks illustrate the effectiveness of the algorithm.