An Entropy Regularization <em>k</em>-Means Algorithm with a New Measure of between-Cluster Distance in Subspace Clustering
Although within-cluster information is commonly used in most clustering approaches, other important information such as between-cluster information is rarely considered in some cases. Hence, in this study, we propose a new novel measure of between-cluster distance in subspace, which is to maximize t...
Main Authors: | Liyan Xiong, Cheng Wang, Xiaohui Huang, Hui Zeng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-07-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/7/683 |
Similar Items
-
Pemetaan Tindak Kejahatan Jalanan di Kota Semarang Menggunakan Algoritma K-Means Clustering
by: Widi Astuti, et al.
Published: (2016-06-01) -
Entropy K-Means Clustering With Feature Reduction Under Unknown Number of Clusters
by: Kristina P. Sinaga, et al.
Published: (2021-01-01) -
Deteksi Penyakit Epilepsi dengan Menggunakan Entropi Permutasi, K-means Clustering, dan Multilayer Perceptron
by: Yunita Ardilla, et al.
Published: (2014-03-01) -
An Extended Regularized K-Means Clustering Approach for High-Dimensional Customer Segmentation With Correlated Variables
by: Hong-Hao Zhao, et al.
Published: (2021-01-01) -
Soil data clustering by using K-means and fuzzy K-means algorithm
by: E. Hot, et al.
Published: (2016-06-01)