title: Link Clustering with Extended Link Similarity and EQ Evaluation Division.
abstract: Link Clustering (LC) is a relatively new method for detecting overlapping communities in networks. The basic principle of LC is to derive a transform matrix whose elements are composed of the link similarity of neighbor links based on the Jaccard distance calculation; then it applies hierarchical clustering to the transform matrix and uses a measure of partition density on the resulting dendrogram to determine the cut level for best community detection. However, the original link clustering method does not consider the link similarity of non-neighbor links, and the partition density tends to divide the communities into many small communities. In this paper, an Extended Link Clustering method (ELC) for overlapping community detection is proposed. The improved method employs a new link similarity, Extended Link Similarity (ELS), to produce a denser transform matrix, and uses the maximum value of EQ (an extended measure of quality of modularity) as a means to optimally cut the dendrogram for better partitioning of the original network space. Since ELS uses more link information, the resulting transform matrix provides a superior basis for clustering and analysis. Further, using the EQ value to find the best level for the hierarchical clustering dendrogram division, we obtain communities that are more sensible and reasonable than the ones obtained by the partition density evaluation. Experimentation on five real-world networks and artificially-generated networks shows that the ELC method achieves higher EQ and In-group Proportion (IGP) values. Additionally, communities are more realistic than those generated by either of the original LC method or the classical CPM method.
authors.affiliation: College of Computer Science and Technology, Jilin University, Changchun, China.
authors.forename: Lan
authors.initials: L
authors.lastname: Huang
authors.forename: Guishen
authors.initials: G
authors.lastname: Wang
authors.forename: Yan
authors.initials: Y
authors.lastname: Wang
authors.forename: Enrico
authors.initials: E
authors.lastname: Blanzieri
authors.forename: Chao
authors.initials: C
authors.lastname: Su
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D008962:Models, Theoretical