Efficient High-Dimensional Kernel k-Means++ with Random Projection
Using random projection, a method to speed up both kernel k-means and centroid initialization with k-means++ is proposed. We approximate the kernel matrix and distances in a lower-dimensional space <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inli...
Main Authors: | Jan Y. K. Chan, Alex Po Leung, Yunbo Xie |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-07-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/11/15/6963 |
Similar Items
-
K-means clustering based filter feature selection on high dimensional data
by: Dewi Pramudi Ismi, et al.
Published: (2016-03-01) -
Kernel Probabilistic K-Means Clustering
by: Bowen Liu, et al.
Published: (2021-03-01) -
Improving Scalable K-Means<sup>+</sup><sup>+</sup>
by: Joonas Hämäläinen, et al.
Published: (2021-12-01) -
Implementasi KD-Tree K-Means Clustering untuk Klasterisasi Dokumen
by: Eric Budiman Gosno, et al.
Published: (2013-09-01) -
Distance based k-means clustering algorithm for determining number of clusters for high dimensional data
by: Mohamed Cassim Alibuhtto, et al.
Published: (2020-01-01)