文件列表:

CPM_MST.png (2363, 2015-02-15)
build.xml (523, 2015-02-15)
manifest.mf (293, 2015-02-15)
nbproject (0, 2015-02-15)
nbproject\build-impl.xml (2285, 2015-02-15)
nbproject\genfiles.properties (469, 2015-02-15)
nbproject\project.properties (165, 2015-02-15)
nbproject\project.xml (5132, 2015-02-15)
nbproject\suite.properties (25, 2015-02-15)
src (0, 2015-02-15)
src\org (0, 2015-02-15)
src\org\urmiauniversity (0, 2015-02-15)
src\org\urmiauniversity\it (0, 2015-02-15)
src\org\urmiauniversity\it\mst (0, 2015-02-15)
src\org\urmiauniversity\it\mst\cpm (0, 2015-02-15)
src\org\urmiauniversity\it\mst\cpm\Bundle.properties (817, 2015-02-15)
src\org\urmiauniversity\it\mst\cpm\CPM.java (8266, 2015-02-15)
src\org\urmiauniversity\it\mst\cpm\CPMBuilder.java (881, 2015-02-15)
src\org\urmiauniversity\it\mst\cpm\CPMPanel.java (3310, 2015-02-15)
src\org\urmiauniversity\it\mst\cpm\CPMUI.java (1721, 2015-02-15)

# CliquePercolationMethod Clique Percolation Method (CPM) is a gephi plugin for finding overlapping communities. This method is used for finding overlapping communities, firstly by detecting communities of size k, then forming a clique graph based of cliques of size k. This plugin is designed to work with Gephi and will transform a graph to the clique graph of size k. # Algorithm The algorithm is simple: 1- first find all cliques of size k in the graph 2- then create graph where nodes are cliques of size k 3- add edges if two nodes (cliques) share k-1 common nodes. 4- each connected component is a community # Reference Palla, Gergely, Imre Derenyi, Illes Farkas, and Tamas Vicsek. "Uncovering the overlapping community structure of complex networks in nature and society." Nature 435, no. 7043 (2005): 814-818.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：