A Comparative Study of Graph Kernels and Clustering Algorithms

• Published in: International journal of multimedia data engineering & management Vol. 12; no. 1; pp. 33 - 48
• Main Authors: Bhattacharya, Riju, Nagwani, Naresh Kumar, Tripathi, Sarsij
• Format: Journal Article
• Language: English
• Published: Hershey IGI Global 01.01.2021
• Subjects: Algorithms; Analysis; Cluster analysis; Clustering; Comparative studies; Graphs; Literature reviews; Methods; Multimedia; Random walk; Self organizing maps; Shortest-path problems; India
• ISSN: 1947-8534; 1947-8542
• DOI: 10.4018/IJMDEM.2021010103

Graph kernels have evolved as a promising and popular method for graph clustering over the last decade. In this work, comparative study on the five standard graph kernel techniques for graph clustering has been performed. The graph kernels, namely vertex histogram kernel, shortest path kernel, graphlet kernel, k-step random walk kernel, and Weisfeiler-Lehman kernel have been compared for graph clustering. The clustering methods considered for the kernel comparison are hierarchical, k-means, model-based, fuzzy-based, and self-organizing map clustering techniques. The comparative study of kernel methods over the clustering techniques is performed on MUTAG benchmark dataset. Clustering performance is assessed with internal validation performance parameters such as connectivity, Dunn, and the silhouette index. Finally, the comparative analysis is done to facilitate researchers for selecting the appropriate kernel method for effective graph clustering. The proposed methodology elicits k-step random walk and shortest path kernel have performed best among all graph clustering approaches.