A feasible k-means kernel trick under non-Euclidean feature space
This paper poses the question of whether or not the usage of the kernel trick is justified. We investigate it for the special case of its usage in the kernel k-means algorithm. Kernel-k-means is a clustering algorithm, allowing clustering data in a similar way to k-means when an embedding of data po...
Main Authors: | Kłopotek Robert, Kłopotek Mieczysław, Wierzchoń Sławomir |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-12-01
|
Series: | International Journal of Applied Mathematics and Computer Science |
Subjects: | |
Online Access: | https://doi.org/10.34768/amcs-2020-0052 |
Similar Items
-
Comparison analysis of Euclidean and Gower distance measures on k-medoids cluster
by: Agil Aditya, et al.
Published: (2021-01-01) -
Wide Gaps and Kleinberg’s Clustering Axioms for k–Means
by: Kłopotek Mieczysław A.
Published: (2024-03-01) -
WEIGHTED LAPLACIANS OF GRIDS AND THEIR APPLICATION FOR INSPECTION OF SPECTRAL GRAPH CLUSTERING METHODS
by: MIECZYSŁAW KŁOPOTEK, et al.
Published: (2021-07-01) -
Grouping of Village Status in West Java Province Using the Manhattan, Euclidean and Chebyshev Methods on the K-Mean Algorithm
by: Gatot Tri Pranoto, et al.
Published: (2022-06-01) -
EVALUASI KINERJA ALGORITMA K-MEANS DENGAN MATRIKS JARAK EUCLIDEAN PADA PENENTUAN SISWA BERMASALAH
by: Nur Aeni Widiastuti, et al.
Published: (2022-12-01)