Abstract

In this paper, an algorithm is proposed to detect one-mode community structures in bipartite networks, and to deduce which one-mode community structures are weighted. After analyzing the topological properties in bipartite networks, bipartite clustering triangular is introduced. First, bipartite networks are projected into two weighted one-mode networks by bipartite clustering triangular. Then all the maximal sub-graphs from two one-mode weighted networks are extracted and the maximal sub-graphs are merged together using a weighted clustering threshold. In addition, the proposed algorithm successfully finds overlapping vertices between one-mode communities. Experimental results using some real-world network data shows that the performance of the proposed algorithm is satisfactory.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call