Abstract
Bipartite network is a performance of complex networks,The divided of unilateral node of bipartite network has important practical significance for the study of complex networks of community division. Based on the diffusion probability of information and modules ideas in the network,this paper presents a community divided clustering algorithm (IPS algorithm) for bipartite network unilateral nodes.The algorithm simulates the probability of information transfer in the network,through mutual support value between the nodes in network,selecting the max value as the basis for merger different communities.Follow the module of the definition for division after mapping the bipartite network nodes as a single department unilateral network.Finally,we use actual network test the performance of the algorithm.Experimental results show that,the algorithm can not only accurate divided the unilateral node of bipartite network,But also can get high quality community division.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, X., Li, X., Chen, G.: Complex network theory and its applications. Tsinghua University Press, p. 9 (2006)
Newman, M.E.J.: Scientific collaboration networks. I. network construction and fundamental results. Physical Review E 64, 016131 (2001)
Newman, M.E.J.: Scientific collaboration networks. II. network construction and fundamental results. Physical Review E 64, 016132 (2001)
Liu, A., Chunhua, F., Zhang, Z.: Empirical statistical study Chinese mainland movie network. Complex Systems and Complexity Science 4(3), 10–16 (2007)
Chen, W., Junan, L., Liang, J.: Disease gene network analysis bipartite graph projection. Complex Systems and Complexity Science 6(1), 13–19 (2009)
Lambiotte, R., Ausloos, M.: Uncovering collective listening habits and music genres in bipartite network. Physical Review E 72, 066107 (2005)
Le Blond, S., Guillaume, J.-L., Latapy, M.: Clustering in P2P exchanges and consequences on performances. In: van Renesse, R. (ed.) IPTPS 2005. LNCS, vol. 3640, pp. 193–204. Springer, Heidelberg (2005)
Xu, Y., Chen, J.: ACO based bipartite network community mining. Computer Science and Exploration 8(3), 286–304 (2014)
Chen, B., Chen, J., Zou, S.: Mining algorithm based on matrix decomposition bipartite network community. Computer Science 41(2), 55–101 (2014)
Zou, Y., Di, Z., Pan, Y.: Based on the distribution of resources bipartite network Fabric Matrix class methods. Beijing Normal University 46(5), 643–646 (2010)
Gao, M.: Bipartite network community discovery algorithm. Hefei University of Technology, p. 04 (2012)
Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76, 036106 (2007)
Liu, X., Murata, T.: Community detection in large-scale bipartite newworks. In: Proceedings of the 2009IEEE/WIC/ACM International Joint conference on Web Intelligence and Intelligent Agent Technology(WI-IAT 2009), pp. 5–8. IEEE Computer Society, Washington, DC (2009)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system:optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics: Part B 26(1), 29–41 (1996)
Barber, M.J.: Modularity and community detection in bipartite networks. Physical Review E 76, 066102 (2007)
Newman, M.E.J.: Modularity and community structure in networks. Proceedings of the National academy of sciences of the United states of America 103(23), 8577–8582 (2006)
Milgram, S.: The small world problem. Psychology Today, 60–67, May 1967
Davis, A., Gardner, B.B., Gardner, M.R.: Deep south. University of Chicago Press, Chicago (1941)
Scott, J., Hughes, M.: The anatomy of Scottish capital: Scottish companies and Scottish capital. Croom Helm, London (1980). 1990–1979
Fan, C.L., Yu, L.: 2013 2nd International Conference on Mechatronic Sciences, Electric Engineering and Computer, (MEC2013) ShenYang, liaoning, China (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fan, C., Wu, H., Zhang, C. (2015). Community Division of Bipartite Network Based on Information Transfer Probability. In: Núñez, M., Nguyen, N., Camacho, D., Trawiński, B. (eds) Computational Collective Intelligence. Lecture Notes in Computer Science(), vol 9329. Springer, Cham. https://doi.org/10.1007/978-3-319-24069-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-24069-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24068-8
Online ISBN: 978-3-319-24069-5
eBook Packages: Computer ScienceComputer Science (R0)