Akses terbuka
Jurnal
SINTA 1
Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density
IAES International Journal of Artificial Intelligence · Vol. 13 No. 2 (2024) · hlm. 2283–2290
ISSN 2252-8938, 2089-4872
Terbit 2024-06-01
Penerbit Institute of Advanced Engineering and Science
Bahasa eng
Abstrak
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 semisupervised 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.
Jaringan kolaborasi para penulis
25 penulis ·
73 tautan kepenulisan bersama
· 15 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Universiti Teknologi MARA Jiujiang Vocational University Indonesia University of Education State University of Semarang Afiliasi tidak diketahui
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density</dc:title>
<dc:creator>YouSheng, Gao</dc:creator>
<dc:creator>Abdul Rahim, Siti Khatijah Nor</dc:creator>
<dc:creator>Hamzah, Raseeda</dc:creator>
<dc:creator>Ang, Li</dc:creator>
<dc:creator>Aminuddin, Raihah</dc:creator>
<dc:subject xml:lang="en-US">Clustering Algorithm</dc:subject>
<dc:subject xml:lang="en-US">K-means; Machine learning; Pairwise constraints; Semi-supervised clustering; Shared nearest neighbor; Spectral clustering</dc:subject>
<dc:description xml:lang="en-US">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 semisupervised 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.</dc:description>
<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
<dc:contributor xml:lang="en-US">Universiti Teknologi MARA Shah Alam</dc:contributor>
<dc:date>2024-06-01</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US"></dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/24033</dc:identifier>
<dc:identifier>10.11591/ijai.v13.i2.pp2283-2290</dc:identifier>
<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 13, No 2: June 2024; 2283-2290</dc:source>
<dc:source>2252-8938</dc:source>
<dc:source>2089-4872</dc:source>
<dc:source>10.11591/ijai.v13.i2</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/24033/14031</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2024 Institute of Advanced Engineering and Science</dc:rights>
<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref.
Sitasi artikel ini
APA 7
YouSheng, G., Abdul Rahim, S. K. N., Hamzah, R., Ang, L., & Aminuddin, R. (2024). Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density. IAES International Journal of Artificial Intelligence, 13(2), 2283–2290. https://doi.org/10.11591/ijai.v13.i2.pp2283-2290
Salin
IEEE
G. YouSheng, S. K. N. Abdul Rahim, R. Hamzah, L. Ang, and R. Aminuddin, “Semi-supervised spectral clustering using shared nearest neighbor for data with different shape and density,” IAES International Journal of Artificial Intelligence, vol. 13, no. 2, pp. 2283–2290, 2024, doi: 10.11591/ijai.v13.i2.pp2283-2290.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.