Cluster Validity Measures for Network Data
Author(s) -
Yukihiro Hamasuna,
Daiki Kobayashi,
Ryo Ozaki,
Yasunori Endo
Publication year - 2018
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2018.p0544
Subject(s) - computer science , medoid , modularity (biology) , data mining , cluster analysis , dijkstra's algorithm , cluster (spacecraft) , measure (data warehouse) , index (typography) , artificial intelligence , theoretical computer science , graph , shortest path problem , biology , world wide web , genetics , programming language
Modularity is one of the evaluation measures for network partitions and is used as the merging criterion in the Louvain method. To construct useful cluster validity measures and clustering methods for network data, network cluster validity measures are proposed based on the traditional indices. The effectiveness of the proposed measures are compared and applied to determine the optimal number of clusters. The network cluster partitions of various network data which are generated from the Polaris dataset are obtained by k -medoids with Dijkstra’s algorithm and evaluated by the proposed measures as well as the modularity. Our numerical experiments show that the Dunn’s index and the Xie-Beni’s index-based measures are effective for network partitions compared to other indices.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom