IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

A Comparative Study of Graph Kernels and Clustering Algorithms

A Comparative Study of Graph Kernels and Clustering Algorithms
View Sample PDF
Author(s): Riju Bhattacharya (National Institute of Technology, Raipur, India), Naresh Kumar Nagwani (National Institute of Technology, Raipur, India)and Sarsij Tripathi (Motilal Nehru National Institute of Technology, Allahabad, India)
Copyright: 2021
Volume: 12
Issue: 1
Pages: 16
Source title: International Journal of Multimedia Data Engineering and Management (IJMDEM)
Editor(s)-in-Chief: Chengcui Zhang (University of Alabama at Birmingham, USA)and Shu-Ching Chen (University of Missouri-Kansas City, United States)
DOI: 10.4018/IJMDEM.2021010103

Purchase

View A Comparative Study of Graph Kernels and Clustering Algorithms on the publisher's website for pricing and purchasing information.

Abstract

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.

Related Content

Yasasi Abeysinghe, Bhanuka Mahanama, Gavindya Jayawardena, Yasith Jayawardana, Mohan Sunkara, Andrew T. Duchowski, Vikas Ashok, Sampath Jayarathna. © 2024. 20 pages.
Chengxuan Huang, Evan Brock, Dalei Wu, Yu Liang. © 2023. 23 pages.
Duleep Rathgamage Don, Jonathan Boardman, Sudhashree Sayenju, Ramazan Aygun, Yifan Zhang, Bill Franks, Sereres Johnston, George Lee, Dan Sullivan, Girish Modgil. © 2023. 17 pages.
Wei-An Teng, Su-Ling Yeh, Homer H. Chen. © 2023. 17 pages.
Hemanth Gudaparthi, Prudhviraj Naidu, Nan Niu. © 2022. 20 pages.
Anchen Sun, Yudong Tao, Mei-Ling Shyu, Angela Blizzard, William Andrew Rothenberg, Dainelys Garcia, Jason F. Jent. © 2022. 19 pages.
Suvojit Acharjee, Sheli Sinha Chaudhuri. © 2022. 16 pages.
Body Bottom