A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Greedily Finding a Dense Subgraph
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Greedy approximation algorithms for finding dense components in a graph
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Local Graph Partitioning using PageRank Vectors
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Extraction and classification of dense communities in the web
Proceedings of the 16th international conference on World Wide Web
Measuring and extracting proximity graphs in networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
IEEE Transactions on Knowledge and Data Engineering
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Context-Aware Object Connection Discovery in Large Graphs
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
A viewpoint-based approach for interaction graph analysis
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
MING: mining informative entity relationship subgraphs
Proceedings of the 18th ACM conference on Information and knowledge management
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
On social-temporal group query with acquaintance constraint
Proceedings of the VLDB Endowment
Double-sided recommendations: a novel framework for recommender systems
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Robust disambiguation of named entities in text
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
On socio-spatial group query for location-based social networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Composing activity groups in social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Online search of overlapping communities
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Discovering and disambiguating named entities in text
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
Finding knowledgeable groups in enterprise corpora
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Social moms and health: a multi-platform analysis of mommy communities
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Assessing the quality of multilevel graph clustering
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
A lot of research in graph mining has been devoted in the discovery of communities. Most of the work has focused in the scenario where communities need to be discovered with only reference to the input graph. However, for many interesting applications one is interested in finding the community formed by a given set of nodes. In this paper we study a query-dependent variant of the community-detection problem, which we call the community-search problem: given a graph G, and a set of query nodes in the graph, we seek to find a subgraph of G that contains the query nodes and it is densely connected. We motivate a measure of density based on minimum degree and distance constraints, and we develop an optimum greedy algorithm for this measure. We proceed by characterizing a class of monotone constraints and we generalize our algorithm to compute optimum solutions satisfying any set of monotone constraints. Finally we modify the greedy algorithm and we present two heuristic algorithms that find communities of size no greater than a specified upper bound. Our experimental evaluation on real datasets demonstrates the efficiency of the proposed algorithms and the quality of the solutions we obtain.