Enhanced hypertext categorization using hyperlinks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Improved algorithms for topic distillation in a hyperlinked environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Creating a Web community chart for navigating related communities
Proceedings of the 12th ACM conference on Hypertext and Hypermedia
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combating web spam with trustrank
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Extracting link spam using biased random walks from spam seed sets
AIRWeb '07 Proceedings of the 3rd international workshop on Adversarial information retrieval on the web
Discovering and Visualizing Network Communities
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
Connectivity structure of bipartite graphs via the KNC-plot
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Using the wisdom of the crowds for keyword generation
Proceedings of the 17th international conference on World Wide Web
Extracting and ranking viral communities using seeds and content similarity
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Separate and inequal: preserving heterogeneity in topical authority flows
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Information Processing and Management: an International Journal
Communities in Large Networks: Identification and Ranking
Algorithms and Models for the Web-Graph
Speeding up algorithms on compressed web graphs
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Expanding network communities from representative examples
ACM Transactions on Knowledge Discovery from Data (TKDD)
Detecting Overlapping Community Structures in Networks
World Wide Web
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
From whence does your authority come?: utilizing community relevance in ranking
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
You are who you know: inferring user profiles in online social networks
Proceedings of the third ACM international conference on Web search and data mining
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Detecting overlapping community structures in networks with global partition and local expansion
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
An analysis of social network-based Sybil defenses
Proceedings of the ACM SIGCOMM 2010 conference
Extracting local web communities using lexical similarity
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Mining topics on participations for community discovery
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Detection of web communities from community cores
WISS'10 Proceedings of the 2010 international conference on Web information systems engineering
Identifying community structures in networks with seed expansion
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Approximate computation and implicit regularization for very large-scale data analysis
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
The small community phenomenon in networks: models, algorithms and applications
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
iTop: interaction based topic centric community discovery on twitter
Proceedings of the 5th Ph.D. workshop on Information and knowledge
Mining query log graphs towards a query folksonomy
Concurrency and Computation: Practice & Experience
Organizational overlap on social networks and its applications
Proceedings of the 22nd international conference on World Wide Web
Graph-based Sybil detection in social and information systems
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
The Journal of Machine Learning Research
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
A seed-centric community detection algorithm based on an expanding ring search
AWC '13 Proceedings of the First Australasian Web Conference - Volume 144
Detecting cohesive and 2-mode communities indirected and undirected networks
Proceedings of the 7th ACM international conference on Web search and data mining
Discovering social circles in ego networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Casin special issue
| Hi-index | 0.00 |
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed set into a community with small conductance and a strong relationship to the seed, while examining only a small neighborhood of the entire graph. We extend existing results to give theoretical guarantees that apply to a variety of seed sets from specified communities. We also describe simple and flexible heuristics for applying these methods in practice, and present early experiments showing that these methods compare favorably with existing approaches.