NEIWalk: Community discovery in dynamic content-based networks

IEEE Transactions on Knowledge and Data Engineering

Volumn 26, Issue 7, 2014, Pages 1734-1748

  Wang, Chang Dong ^a   Lai, Jian Huang ^a,b   Yu, Philip S ^c  

^a SUN YAT SEN UNIVERSITY   (China)

^b SYSU CMU Shunde International Joint Research Institute   (China)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

content information; Dynamic community detection; heterogeneous random walk; linkage structure; social network

Indexed keywords

ALGORITHMS; POPULATION DYNAMICS; SEMANTICS; SOCIAL NETWORKING (ONLINE);

COMMUNITY DISCOVERIES; CONTENT INFORMATION; DIFFERENTIAL ACTIVITY; DYNAMIC COMMUNITIES; EFFECTIVENESS AND EFFICIENCIES; NETWORK-BASED; RANDOM WALK; TRANSITION PROBABILITY MATRIX;

RANDOM PROCESSES;

EID: 84904431721     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2013.153     Document Type: Article

References (55)

1. Stanford Large Network Dataset Collection [Online]. Available: http://snap.stanford.edu/data/.
2. S. Fortunato, "Community detection in graphs, " Phys. Rep., vol. 486, no. 3-5, pp. 75-174, Feb. 2010.
3. M. Coscia, F. Giannotti, and D. Pedreschi, "A classification for community discovery methods in complex networks, " Stat. Anal. Data Mining, vol. 4, no. 5, pp. 512-546, Oct. 2011.
4. S. Asur, S. Parthasarathy, and D. Ucar, "An event-based framework for characterizing the evolutionary behavior of interaction graphs, " in Proc. KDD, 2007, pp. 913-921. (Pubitemid 350229276)
5. Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng, "FacetNet: A framework for analyzing communities and their evolutions in dynamic networks, " in Proc. 17th Int. Conf. WWW, 2008, pp. 685-694.
6. Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng, "Analyzing communities and their evolutions in dynamic social networks, " ACM Trans. Knowl. Discov. Data, vol. 3, no. 2, pp. 1-31, Apr. 2009.
7. L. Tang, H. Liu, J. Zhang, and Z. Nazeri, "Community evolution in dynamic multi-mode networks, " in Proc. 14th ACM SIGKDD Int. Conf. KDD, Las Vegas, NV, USA, 2008, pp. 677-685.
8. M.-S. Kim and J. Han, "A particle-and-density based evolutionary clustering method for dynamic networks, " in Proc. VLDB, Lyon, France, 2009, pp. 622-633.
9. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, "Tracking evolving communities in large linked networks, " Proc. Nat. Acad. Sci. USA, vol. 101, Suppl. 1, pp. 5249-5253, Feb. 2004. (Pubitemid 38469134)
10. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group formation in large social networks: Membership, growth, and evolution, " in Proc. 12th ACM SIGKDD Int. Conf. KDD, Philadelphia, PA, USA, 2006, pp. 44-54. (Pubitemid 44535502)
11. J. Sun, C. Faloutsos, S. Papadimitriou, and P. Yu, "Graphscope: Parameter-free mining of large time-evolving graphs, " in Proc. 13th ACM SIGKDD Int. Conf. KDD, San Jose, CA, USA, 2007, pp. 687-696. (Pubitemid 350229254)
12. G. Palla, A.-L. Barabási, and T. Vicsek, "Quantifying social group evolution, " Nature, vol. 446, no. 7136, pp. 664-667, Apr. 2007. (Pubitemid 46606882)
13. A. Padrol-Sureda, G. Perarnau-Llobet, J. Pfeifle, and V. Muntés-Mulero, "Overlapping community search for social networks, " in Proc. IEEE 26th ICDE, Long Beach, CA, USA, 2010, pp. 992-995.
14. C.-D. Wang, J.-H. Lai, and P. S. Yu, "Dynamic community detection in weighted graph streams, " in Proc. SDM, 2013, pp. 151-161.
15. S. Amer-Yahia, M. Benedikt, and P. Bohannon, "Challenges in searching online communities, " IEEE Data Eng. Bull., vol. 30, no. 2, pp. 23-31, Jan. 2007.
16. A. Silva, W. Meira Jr., and M. J. Zaki, "Mining attribute-structure correlated patterns in large attributed graphs, " in Proc. VLDB, Istanbul, Turkey, 2012, pp. 466-477.
17. Y. Liu, A. Niculescu-Mizil, and W. Gryc, "Topic-link LDA: Joint models of topic and author community, " in Proc. 26th ICML, Montreal, QC, Canada, 2009, pp. 665-672.
18. T. Yang, R. Jin, Y. Chi, and S. Zhu, "Combining link and content for community detection: A discriminative approach, " in Proc. 15th ACM SIGKDD Int. Conf. KDD, Paris, France, 2009, pp. 927-935.
19. Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on structural/attribute similarities, " in Proc. VLDB, Lyon, France, 2009, pp. 718-729.
20. G.-J. Qi, C. C. Aggarwal, and T. Huang, "Community detection with edge content in social media networks, " in IEEE 28th ICDE, Washington, DC, USA, 2012, pp. 534-545.
21. M. Sachan, D. Contractor, T. A. Faruquie, and L. V. Subramaniam, "Using content and interactions for discovering communities in social networks, " in Proc. 21st Int. Conf. WWW, 2012, pp. 331-340.
22. S. Zhu, K. Yu, Y. Chi, and Y. Gong, "Combining content and link for classification using matrix factorization, " in Proc. 30th Annu. Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Istanbul, Turkey, 2007, pp. 487-494. (Pubitemid 350164997)
23. C. C. Aggarwal and N. Li, "On node classification in dynamic content-based networks, " in Proc. SDM, 2011, pp. 355-366.
24. Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu, "PathSim: Meta path-based top-k similarity search in heterogeneous information networks, " in Proc. VLDB, Washington, DC, USA, 2011, pp. 992-1003.
25. Y. Sun, B. Norick, J. Han, X. Ya, P. S. Yu, and X. Yu, "Integrating meta-path selection with user-guided object clustering in heterogeneous information networks, " in Proc. 18th ACM SIGKDD Int. Conf. KDD, 2012, pp. 1348-1356.
26. M. Rosvall and C. T. Bergstrom, "Maps of random walks on complex networks reveal community structure, " Proc. Nat. Acad. Sci. USA, vol. 105, no. 4, pp. 1118-1123, Jan. 2008. (Pubitemid 351397014)
27. P. Pons and M. Latapy, "Computing communities in large networks using random walks, " in Proc. 20th Int. Symp. Comput. Inform. Sci., Istanbul, Turkey, 2005, pp. 284-293.
28. W. Cui, H. Zhou, H. Qu, P. C. Wong, and X. Li, "Geometry-based edge clustering for graph visualization, " IEEE Trans. Vis. Comput. Graphics, vol. 14, no. 6, pp. 1277-1284, Nov./Dec. 2008.
29. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, "Link communities reveal multiscale complexity in networks, " Nature, vol. 466, no. 7307, pp. 761-764, Jun. 2010.
30. T. S. Evans and R. Lambiotte, "Line graphs of weighted networks for overlapping communities, " Eur. Phys. J., Ser. B, vol. 77, no. 3, pp. 265-272, Sept. 2010.
31. X. Wang, L. Tang, H. Gao, and H. Liu, "Discovering overlapping groups in social media, " in Proc. IEEE ICDM, 2010, pp. 569-578.
32. T. Yang, Y. Chi, S. Zhu, Y. Gong, and R. Jin, "Detecting communities and their evolutions in dynamic social networks-A Bayesian approach, " Mach. Learn., vol. 82, no. 2, pp. 157-189, Feb. 2011.
33. S. van Dongen, "Graph clustering by flow simulation, " Ph.D. dissertation, Dutch National Research Institute for Mathematics and Computer Science, Univ. Utrecht, Utrecht, 2000.
34. W. Fu, L. Song, and E. P. Xing, "Dynamic mixed membership blockmodel for evolving networks, " in Proc. 26th Annu. ICML, Montreal, QC, Canada, 2009, pp. 329-336.
35. L. Tang, H. Liu, and J. Zhang, "Identifying evolving groups in dynamic multimode networks, " IEEE Trans. Knowl. Data Eng., vol. 24, no. 1, pp. 72-85, Jan. 2012.
36. D. Harel and Y. Koren, "On clustering using random walks, " in Proc. FSTTCS, 2001, pp. 18-41. (Pubitemid 33371149)
37. F. Fouss, A. Pirotte, J.-M. Renders, andM. Saerens, "Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation, " IEEE Trans. Knowl. Data Eng., vol. 19, no. 3, pp. 355-369, Mar. 2007. (Pubitemid 46374533)
38. M. Chen, J. Liu, and X. Tang, "Clustering via random walk hitting time on directed graphs, " in Proc. 23rd Nat. Conf. AAAI, 2008, pp. 616-621.
39. A. Zhou, F. Cao, W. Qian, and C. Jin, "Tracking clusters in evolving data streams over sliding windows, " Knowl. Inform. Syst., vol. 15, no. 2, pp. 181-214, May. 2008.
40. L. Lovász, "Random walks on graphs: A survey, " Combinatorics, Paul Erdös is Eighty, vol. 2, no. 1, pp. 353-398, 1993.
41. D. Aldous and J. Fill. Reversible Markov chains and random walks on graphs [Online]. Available: http://www.stat.berkeley.edu/users/aldous/RWG/book. html
42. L. Page, S. Brin, R. Motwani, and T. Winograd, "The pagerank citation ranking: Bringing order to the web, " Stanford InfoLab, Tech. Rep. 1999-66, Nov. 1999 [Online]. Available: http://ilpubs.stanford.edu:8090/422/
43. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, "Extrapolation methods for accelerating pagerank computations, " in Proc. 12th Int. Conf. WWW, Budapest, Hungary, 2003, pp. 261-270.
44. U. von Luxburg, A. Radl, and M. Hein, "Getting lost in space: Large sample analysis of the commute distance, " in Proc. NIPS, 2010, pp. 2622-2630.
45. G. Jeh and J. Widom, "Scaling personalized web search, " in Proc. 12th Int. Conf. WWW, Budapest, Hungary, 2003, pp. 271-279.
46. C.-D. Wang, J.-H. Lai, D. Huang, and W.-S. Zheng, "SVStream: A support vector based algorithm for clustering data streams, " IEEE Trans. Knowl. Data Eng., vol. 25, no. 6, pp. 1410-1424, Jun. 2013.
47. W. Hoeffding, "Probability inequalities for sums of bounded random variables, " J. Amer. Stat. Assoc., vol. 58, no. 301, pp. 13-30, Mar. 1963.
48. A. Strehl, J. Ghosh, and R. J. Mooney, "Impact of similarity measures on web-page clustering, " in Proc. AAAI Workshop AI Web Search, Austin, TX, USA, 2000, pp. 58-64.
49. L. Hubert and P. Arabie, "Comparing partitions, " J. Classif., vol. 2, no. 1, pp. 193-218, Dec. 1985.
50. A. Strehl and J. Ghosh, "Cluster ensembles-A knowledge reuse framework for combining multiple partitions, " J. Mach. Learn. Res., vol. 3, no. 3, pp. 583-617, 2002.
51. M. Meil?a, "Comparing clusterings: An axiomatic view, " in Proc. 22nd ICML, Washington, DC, USA, 2005, pp. 577-584.
52. N. X. Vinh, J. Epps, and J. Bailey, "Information theoretic measures for clusterings comparison is a correction for chance necessary?" in Proc. 26th Annu. ICML, Montreal, QC, Canada, 2009, pp. 1073-1080.
53. C.-D. Wang, J.-H. Lai, and J.-Y. Zhu, "A conscience on-line learning approach for kernel-based clustering, " in Proc. IEEE 10th ICDM, Sydney, NSW, Australia, 2010, pp. 531-540.
54. C.-D. Wang, J.-H. Lai, C. Y. Suen, and J.-Y. Zhu, "Multi-exemplar affinity propagation, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 9, pp. 2223-2237, Sept. 2013.
55. J. Wu, H. Xiong, and J. Chen, "Adapting the right measures for k-means clustering, " in Proc. 15th ACM SIGKDD Int. Conf. KDD, Paris, France, 2009, pp. 877-885.