Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density

In the absence of supervisory information in spectral clustering algorithms, it is difficult to construct suitable similarity graphs for data with complex shapes and varying densities. To address this issue, this paper proposes a semi-supervised spectral clustering algorithm based on shared nearest...

Full description

Bibliographic Details
Published in:IAES International Journal of Artificial Intelligence
Main Author: Yousheng G.; Rahim S.K.N.A.; Hamzah R.; Ang L.; Aminuddin R.
Format: Article
Language:English
Published: Institute of Advanced Engineering and Science 2024
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85192725606&doi=10.11591%2fijai.v13.i2.pp2283-2290&partnerID=40&md5=d210ca5eb68609a3d57c0e6a63b6d159
id 2-s2.0-85192725606
spelling 2-s2.0-85192725606
Yousheng G.; Rahim S.K.N.A.; Hamzah R.; Ang L.; Aminuddin R.
Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
2024
IAES International Journal of Artificial Intelligence
13
2
10.11591/ijai.v13.i2.pp2283-2290
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85192725606&doi=10.11591%2fijai.v13.i2.pp2283-2290&partnerID=40&md5=d210ca5eb68609a3d57c0e6a63b6d159
In the absence of supervisory information in spectral clustering algorithms, it is difficult to construct suitable similarity graphs for data with complex shapes and varying densities. To address this issue, this paper proposes a semi-supervised spectral clustering algorithm based on shared nearest neighbor (SNN). The proposed algorithm combines the idea of semi-supervised clustering, adding SNN to the calculation of the distance matrix, and using pairwise constraint information to find the relationship between two data points, while providing a portion of supervised information. Comparative experiments were conducted on artificial data sets and University of California Irvine machine learning repository datasets. The experimental results show that the proposed algorithm achieves better clustering results compared to traditional K-means and spectral clustering algorithms. © 2024, Institute of Advanced Engineering and Science. All rights reserved.
Institute of Advanced Engineering and Science
20894872
English
Article
All Open Access; Gold Open Access
author Yousheng G.; Rahim S.K.N.A.; Hamzah R.; Ang L.; Aminuddin R.
spellingShingle Yousheng G.; Rahim S.K.N.A.; Hamzah R.; Ang L.; Aminuddin R.
Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
author_facet Yousheng G.; Rahim S.K.N.A.; Hamzah R.; Ang L.; Aminuddin R.
author_sort Yousheng G.; Rahim S.K.N.A.; Hamzah R.; Ang L.; Aminuddin R.
title Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
title_short Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
title_full Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
title_fullStr Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
title_full_unstemmed Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
title_sort Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
publishDate 2024
container_title IAES International Journal of Artificial Intelligence
container_volume 13
container_issue 2
doi_str_mv 10.11591/ijai.v13.i2.pp2283-2290
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-85192725606&doi=10.11591%2fijai.v13.i2.pp2283-2290&partnerID=40&md5=d210ca5eb68609a3d57c0e6a63b6d159
description In the absence of supervisory information in spectral clustering algorithms, it is difficult to construct suitable similarity graphs for data with complex shapes and varying densities. To address this issue, this paper proposes a semi-supervised spectral clustering algorithm based on shared nearest neighbor (SNN). The proposed algorithm combines the idea of semi-supervised clustering, adding SNN to the calculation of the distance matrix, and using pairwise constraint information to find the relationship between two data points, while providing a portion of supervised information. Comparative experiments were conducted on artificial data sets and University of California Irvine machine learning repository datasets. The experimental results show that the proposed algorithm achieves better clustering results compared to traditional K-means and spectral clustering algorithms. © 2024, Institute of Advanced Engineering and Science. All rights reserved.
publisher Institute of Advanced Engineering and Science
issn 20894872
language English
format Article
accesstype All Open Access; Gold Open Access
record_format scopus
collection Scopus
_version_ 1809678472050638848