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: | , , , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
MDPI AG
2019-07-01
|
| סדרה: | Entropy |
| נושאים: | |
| גישה מקוונת: | https://www.mdpi.com/1099-4300/21/7/683 |