JCCM (Joint Clustering Coefficient Method) algorithm was proposed to identify communities which are cohesive on both attribute and relationship data in social networks. JCCM is a two-step algorithm: In the first step, it clusters tightly cohesive cliques as community cores and we proposed a heuristic method to identify community cores with a probabilistic guarantee to find out all community cores. In the second step, JCCM assigns the community cores and peripheral actors into different communities in a top-down manner resulting in a dendrogram and the final clustering is determined by our objective function, namely Joint Clustering Coefficient (JCC). To consider the power of actors in different roles in community identification, we defined two regimes of communities, namely "union" and "autarchy". Experiments demonstrated that JCCM performs better than existing algorithms and confirmed that attribute and relationship data indeed contain complementary information which helps to identify communities. © 2009 Springer.
CITATION STYLE
Wan, L., Liao, J., Wang, C., & Zhu, X. (2009). JCCM: Joint cluster communities on attribute and relationship data in social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5678 LNAI, pp. 671–679). https://doi.org/10.1007/978-3-642-03348-3_70
Mendeley helps you to discover research relevant for your work.