Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension
IEEE Transactions on Pattern Analysis and Machine Intelligence
Extended fuzzy C-means clustering algorithm for hotspot events in spatial analysis
International Journal of Hybrid Intelligent Systems
Clustering: A neural network approach
Neural Networks
A hybrid approach to outlier detection in the offset lithographic printing process
Engineering Applications of Artificial Intelligence
A time-domain-constrained fuzzy clustering method and its application to signal analysis
Fuzzy Sets and Systems
Unsupervised colour image segmentation applied to printing quality assessment
Image and Vision Computing
A novel fuzzy clustering algorithm based on a fuzzy scatter matrix with optimality tests
Pattern Recognition Letters
Extended fuzzy C-means clustering in GIS environment for hot spot events
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
An alternative fuzzy compactness and separation clustering algorithm
ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
Optimal fuzzy modeling based on minimum cluster volume
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Evaluating geo-environmental variables using a clustering based areal model
Computers & Geosciences
Advances in Fuzzy Systems - Special issue on Fuzzy Methods and Approximate Reasoning in Geographical Information Systems
Hotspots detection in spatial analysis via the extended gustafson-kessel algorithm
Advances in Fuzzy Systems - Special issue on Fuzzy Methods and Approximate Reasoning in Geographical Information Systems
| Hi-index | 0.00 |
Clustering algorithms such as the K-means algorithm and the fuzzy C-means algorithm are based on the minimization of the trace of the (fuzzy) within-fluster scatter matrix. In this paper, we explore the use of determinant (volume) criteria for clustering. We derive an algorithm called the minimum scatter volume (MSV) algorithm, that minimizes the scatter volume, and another algorithm called the minimum cluster volume (MCV) that minimizes the sum of the volumes of the individual clusters. The behavior of MSV is shown to be similar to that of K-means, whereas MCV is more versatile