Article

Communities from seed sets

Authors:

Reid Andersen,

Kevin J. LangAuthors Info & Claims

WWW '06: Proceedings of the 15th international conference on World Wide Web

Pages 223 - 232

https://doi.org/10.1145/1135777.1135814

Published: 23 May 2006 Publication History

Get Access

Abstract

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.

References

[1]

Krishna Bharat and Monika R. Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. In ACM SIGIR-98, pages 104--111, Melbourne, AU, 1998.

Digital Library

Google Scholar

[2]

Soumen Chakrabarti, Byron E. Dom, and Piotr Indyk. Enhanced hypertext categorization using hyperlinks. In Laura M. Haas and Ashutosh Tiwary, editors, Proceedings of ACM SIGMOD-98, pages 307--318, Seattle, US, 1998. ACM Press, New York, US.

Digital Library

Google Scholar

[3]

Fan Chung and Lincoln Lu. Connected components in random graphs with given degree sequences. Annals of Combinatorics, 6:125--145, 2002.

Crossref

Google Scholar

[4]

Gary Flake, Steve Lawrence, and C. Lee Giles. Efficient identification of web communities. In Sixth ACM SIGKDD, pages 150--160, Boston, MA, August 20--23 2000.

Digital Library

Google Scholar

[5]

Zoltán Gyöngyi, Hector Garcia-Molina, and Jan Pedersen. Combating web spam with trustrank. In VLDB, pages 576--587, 2004.

Digital Library

Google Scholar

[6]

George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20:359 -- 392, 1999.

Digital Library

Google Scholar

[7]

Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604--632, 1999.

Digital Library

Google Scholar

[8]

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks, 31(11--16):1481--1493, 1999.

Digital Library

Google Scholar

[9]

Kevin J Lang. Fixing two weaknesses of the spectral method. In NIPS, 2005.

Google Scholar

[10]

László Lovász and Miklós Simonovits. The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In FOCS, pages 346--354, 1990.

Digital Library

Google Scholar

[11]

László Lovász and Miklós Simonovits. Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms, 4(4):359--412, 1993.

Crossref

Google Scholar

[12]

Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In ACM STOC-04, pages 81--90, New York, NY, USA, 2004. ACM Press.

Digital Library

Google Scholar

[13]

M. Toyoda and M. Kitsuregawa. Creating a web community chart for navigating related communities, 2001.

Digital Library

Google Scholar

Cited By

View all

Ni LYe RLuo WZhang Y(2024)Local Community Detection in Multiple Private NetworksACM Transactions on Knowledge Discovery from Data10.1145/364407818:5(1-21)Online publication date: 10-Feb-2024
https://dl.acm.org/doi/10.1145/3644078
Huang YGleich DVeldt NChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized MethodsProceedings of the ACM Web Conference 202410.1145/3589334.3645624(881-892)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645624
Shi SYan MLi J(2024)Overlapping Community Detection Based on Weak EquiconceptIEEE Access10.1109/ACCESS.2024.337488212(42147-42162)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3374882
Show More Cited By

Index Terms

Communities from seed sets

Recommendations

Community membership identification from small seed sets
KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining

In many applications we have a social network of people and would like to identify the members of an interesting but unlabeled group or community. We start with a small number of exemplar group members -- they may be followers of a political ideology or ...
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

Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such as PageRank, HITS, and other derivatives are especially vulnerable to link ...
Automatic seed set expansion for trust propagation based anti-spamming algorithms
WIDM '09: Proceedings of the eleventh international workshop on Web information and data management

Seed sets are of significant importance for trust propagation based anti-spamming algorithms, e.g., TrustRank. Conventional approaches require manual evaluation to construct a seed set, which restricts the seed set to be small in size, since it would ...

Comments

Information & Contributors

Information

Published In

WWW '06: Proceedings of the 15th international conference on World Wide Web

May 2006

1102 pages

ISBN:1595933239

DOI:10.1145/1135777

General Chairs:
Leslie Carr
University of Southampton
,
David De Roure
University of Southampton
,
Arun Iyengar
IBM Research
,
Program Chairs:
Carole Goble
University of Manchester, UK
,
Mike Dahlin
University of Texas at Austin

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

WWW06

Sponsor:

WWW06: The 15th International World Wide Web Conference 2006

May 23 - 26, 2006

Edinburgh, Scotland

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
977
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ni LYe RLuo WZhang Y(2024)Local Community Detection in Multiple Private NetworksACM Transactions on Knowledge Discovery from Data10.1145/364407818:5(1-21)Online publication date: 10-Feb-2024
https://dl.acm.org/doi/10.1145/3644078
Huang YGleich DVeldt NChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized MethodsProceedings of the ACM Web Conference 202410.1145/3589334.3645624(881-892)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645624
Shi SYan MLi J(2024)Overlapping Community Detection Based on Weak EquiconceptIEEE Access10.1109/ACCESS.2024.337488212(42147-42162)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3374882
Diboune ASlimani HNacer HBeghdad Bey K(2024)A comprehensive survey on community detection methods and applications in complex information networksSocial Network Analysis and Mining10.1007/s13278-024-01246-514:1Online publication date: 18-Apr-2024
https://doi.org/10.1007/s13278-024-01246-5
Fountoulakis KLiu MGleich DMahoney M(2023)Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and PerformanceSIAM Review10.1137/20M133305565:1(59-143)Online publication date: 9-Feb-2023
https://doi.org/10.1137/20M1333055
Ni LGe JZhang YLuo WSheng V(2023)Semi-Supervised Local Community DetectionIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3290095(1-17)Online publication date: 2023
https://doi.org/10.1109/TKDE.2023.3290095
DePavia ASteinerberger S(2021)Spectral clustering revisited: Information hidden in the Fiedler vectorFoundations of Data Science10.3934/fods.2021015(0)Online publication date: 2021
https://doi.org/10.3934/fods.2021015
Liu JWang DFeng SZhang Y(2021)An Approach of Community Search with Minimum Spanning Tree Based on Node EmbeddingComplexity10.1155/2021/66734442021(1-13)Online publication date: 14-Apr-2021
https://doi.org/10.1155/2021/6673444
Ye WMautz DBohm CSingh APlant C(2021)Incorporating User's Preference into Attributed Graph ClusteringIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.297606333:12(3716-3728)Online publication date: 1-Dec-2021
https://doi.org/10.1109/TKDE.2020.2976063
Murali MPotika KPollett C(2020)Online local communities with motifs2020 Second International Conference on Transdisciplinary AI (TransAI)10.1109/TransAI49837.2020.00014(59-66)Online publication date: Sep-2020
https://doi.org/10.1109/TransAI49837.2020.00014
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Community membership identification from small seed sets

Extracting link spam using biased random walks from spam seed sets

Automatic seed set expansion for trust propagation based anti-spamming algorithms