Community membership identification from small seed sets

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2014, Pages 1366-1375

  Kloumann, Isabel M ^a   Kleinberg, Jon M ^a  

^a Cornell University 657 Rhodes Hall ^*  (United States)

Author keywords

ground truth communities; seed set expansion

Indexed keywords

EID: 84907029441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623621     Document Type: Conference Paper

References (21)

1. Bruno Abrahao, Sucheta Soundarajan, John Hopcroft, and Robert Kleinberg. On the separability of structural classes of communities. In In KDD '12, pages 624-632. ACM, 2012.
2. Reid Andersen, Fan Chung, and Kevin Lang. Local graph partitioning using pagerank vectors. In Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on, pages 475-486. IEEE, 2006.
3. Reid Andersen and Kevin J Lang. Communities from seed sets. In In WWW '06.
4. James P Bagrow. Evaluating local community methods in networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(05):P05001, 2008.
5. Aaron Clauset. Finding local community structure in networks. Physical review E, 72(2):026132, 2005.
6. Charles H Hubbell. An input-output approach to clique identification. Sociometry, 1965.
7. Glen Jeh and Jennifer Widom. Scaling personalized web search. In In WWW '03, pages 271-279. ACM, 2003.
8. George Karypis and Vipin Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995.
9. Leo Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39-43, 1953.
10. Jon M Kleinberg. Authoritative sources in a hyperlink environment. In Proc. of ACM-SIAM Symposium on Discrete Algorithms, 1998.
11. Jure Leskovec, Kevin J Lang, and Michael Mahoney. Empirical comparison of algorithms for network community detection. In In WWW '10, pages 631-640. ACM, 2010. data source.
12. Feng Luo, James Z Wang, and Eric Promislow. Exploring local community structures in large networks. Web Intelligence and Agent Systems, 6(4):387-400, 2006.
13. Andrew Mehler and Steven Skiena. Expanding network communities from representative examples. ACM Transactions on Knowledge Discovery from Data (TKDD), 3(2):7, 2009.
14. Alan Mislove, Bimal Viswanath, Krishna P Gummadi, and Peter Druschel. You are who you know: inferring user profiles in online social networks. In In WSDM '10, pages 251-260. ACM, 2010.
15. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. 1999.
16. Jason Riedy, David A Bader, Karl Jiang, Pushkar Pande, and Richa Sharma. Detecting communities from given seeds in social networks. 2011.
17. Daniel A Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In In STOC '04, pages 81-90. ACM, 2004.
18. Ingmar Weber, Venkata R Kiran Garimella, and Alaa Batayneh. Secular vs. islamist polarization in egypt on twitter. In In ASONAM '13, pages 290-297. ACM, 2013.
19. Joyce Jiyoung Whang, David F Gleich, and Inderjit S Dhillon. Overlapping community detection using seed set expansion. In In CIKM '13, pages 2099-2108. ACM, 2013.
20. Baoning Wu and Kumar Chellapilla. Extracting link spam using biased random walks from spam seed sets. In In AIRWeb '07, pages 37-44. ACM, 2007.
21. Jaewon Yang and Jure Leskovec. Defining and evaluating network communities based on ground-truth. In In MDS '12, page 3. ACM, 2012.