It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

Role Assorted Community Discovery for Weighted Networks | Ma | Journal of Software
Journal of Software, Vol 6, No 12 (2011), 2441-2448, Dec 2011
doi:10.4304/jsw.6.12.2441-2448

Role Assorted Community Discovery for Weighted Networks

Ruixin Ma, Guishi Deng, Xiao Wang

Abstract


This paper considers the difficulties in community discovery, and comes up with a community discovery algorithm on the basis of role assorted thoughts. Previous work indicates that a robust approach to community detection is the maximization of inner communication and the minimization of the in-out interaction. Here we show that this problem can be solved accords to the role assorted method which give distinguish labels to vertices in the same community. This method leads us to a number of possible algorithms for detecting community structures in both unweighted and weighted networks. The applicability and expandability of algorithms proposed are illustrated with application to a variety of computer-generated networks and real-world complex networks.


Keywords


community discovery, role assorted thoughts, robust approach, distinguish label

References


[1] M. E. J. Newman. “Finding Community Structure in Networks Using the Eigenvectors of Matrices.” Physics. 2006, 1–22.

[2] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Complex networks: “Structure and Dynamics.” Physics Reports 424, 2006, 175–308.
http://dx.doi.org/10.1016/j.physrep.2005.10.009

[3] Leicht E A, Newman M E J. “Community Structure in Directed Networks.” Physical Review Letters, 2008, 100:118703.
http://dx.doi.org/10.1103/PhysRevLett.100.118703
PMid:18517839

[4] S.N.Dorogovtsev and J.F.F.Mends, “Evolution of Networks: From biological Nets to the Internet and WWW”. Oxford University Press, Oxford, 2003.

[5] G.W. Flake, S.R.Lawrence, C.L.Giles, and F.M.Coetzec, IEEE computer 35, 2002, 66.

[6] Rosvall M, Bergstrom C T. “An Information-theoretic Framework for Resolving Community Structure in Complex Networks.” PNAS, 2007, 104(18): 7327-7331.
http://dx.doi.org/10.1073/pnas.0611034104
PMid:17452639    PMCid:1855072

[7] A.Broder, R.Kumar, F.Maghoul, P.Raghavan, S.Rajagopalan, R.stata, A.Tomkins and J.Wiener, Computer. Netw. 2000, 33,309.
http://dx.doi.org/10.1016/S1389-1286(00)00083-9

[8] B. Hu, X.Y. Jiang, J.F. Ding, Y.B. Xie, B.H. Wang. “A Weighted Network Model for Interpersonal Relationship Evolution.” Physica A. 2005, 353:576-594.
http://dx.doi.org/10.1016/j.physa.2005.01.052

[9] C.Moore and M.E.J.Newman, “Epidemics and Percolation in Small-world Networks.” Phys. 2000, Rev. E61, 5678-5682

[10] LIU Ji, DENG Gui- shi. “A Collaborative Recommendation Method Based on User Network Community with Weighted Spectral Analysis”. Journal of Dalian University of Technology. 2010, 50(3): 438-442.

[11] Cun-rui, Xiao-dong,LIU Xiang-dong,LI Zhi-jie. “A Physical Community Discovery Algorithm.” MICROELECTRONICS&COMPUTER. 2010. 27(9): 33-36.

[12] M.E.J. Newman. “Scientific Collaboration Networks: II. Shortest paths, Weighted Networks, and Centrality.” Phys. 2004, Rev. E64, 016132.

[13] M.E.J.Newman. “Mixing Patterns in Networks.” Phys. 2003, Rev. E67, 026126.

[14] “Research of the Present Situation of Operation and the Future Tendency of SNS Website.” http://media.people.com.cn/GB/22114/119489/140165/8454258.html(2009)

[15] LUO Ze-bi, XIE Qink-sheng. “Collaborative Filtering Recommendation Algorithm Based on Web Data Mining.” Journal of Guizhou University(Natural Science). 2009, 26:40-43

[16] Guo Yan-hong, DENG Gui-shi, LUO Chun-yu. “Collaborative Filtering Recommendation Algorithm Based on Factor of Trust.” Computer Engineering, 2008, 34(20): 1-3

[17] DAI Ya-e, GONG Song-jie. “Collaborative Filtering Recommendation Based on Fuzzy Clustering in Personalization Services.” Computer Engineering & Science, 2009, 31(4): 110-116

[18] Ashish Sureka and Pranav Prabhakar Mirajkar. “An Empirical Study on the Effect of Different Similarity Measures on User-Based Collaborative Filtering Algorithms.” Springer-Verlag Berlin. 2008, LNAI 5351: 1065–1070.

[19] Ahn, H.J. “A New Similarity Measure for Collaborative Filtering to Alleviate the New User Cold-starting Problem.” Information Sciences: an International Journal. 2008, January.

[20] FAN Cong-xian XU Ting-rong FAN Qiang-xian. “Research and Improved Algorithm of HITS Based on Web Structure Mining.” Computer Information. 2010, 26:160-162.

[21] M.E.J. Newman, M. Girvan. “Finding and Evaluating structure in networks.” Physics Review[C]. 2004, E69, 026113

[22] D.E.Knuth, The Stanford Graphbase: “A Platform for Combinatorial Computing”. Addison –Wesley, 1993, Reading, MA.

[23] Zachary W W. “An Information Flow Model for Conflict and Fission in Small Groups.” Journal of Anthropological Research, 1970, 33:452–473.


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.