Abstract：Community detection is one of crucial techniques in graph and network research,where clustering plays an important role.Taking into account high time complexity of hierarchical clustering,an improved community detection method,called p IBD,is proposed under information-theoretic framework.The p IBD transforms a unipartite network into a bipartite network,predicts the value of k,and implements partitional clustering based on information bottleneck theory.Experimental results show that p IBD could achieve higher accuracy than existing hierarchical clustering methods.

Keyword：community detection;clustering;K-Means;F-Measure;