Pattern recognition: human and mechanical
Pattern recognition: human and mechanical
Algorithms for clustering data
Algorithms for clustering data
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Learning from Examples with Information Theoretic Criteria
Journal of VLSI Signal Processing Systems
Pairwise Data Clustering by Deterministic Annealing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean shift: An information theoretic perspective
Pattern Recognition Letters
Data clustering: 50 years beyond K-means
Pattern Recognition Letters
Information Theoretic Learning: Renyi's Entropy and Kernel Perspectives
Information Theoretic Learning: Renyi's Entropy and Kernel Perspectives
Clustering using elements of information theory
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part III
Survey of clustering algorithms
IEEE Transactions on Neural Networks
| Hi-index | 0.10 |
This paper proposes an information-theoretic approach for clustering with a new measure of cross information potential and two clustering algorithms. Instead of using all points of the dataset, the proposed measure uses representative points to quantify the interaction between distributions without any loss of the original properties of cross information potential. This brings a double advantage. It decreases the cost of computing the cross information potential, thus drastically reducing the running time. Secondly, it captures the interaction among the data points by utilizing the underlying statistics of the space region centered around the representative points. With this, we have made it possible to use cross information potential in applications where it was not. We also proposed two algorithms for clustering which explore the idea of creating links between regions of the feature space that are highly correlated. We ran several tests and compared the results with single linkage hierarchical algorithm, finite mixture of Gaussians and spectral clustering in both synthetic and real image segmentation datasets. Experiments showed that our approach achieved better results compared to the other algorithms and it was capable of capture the real structure of the data in most cases regardless of its complexity. It also produced good image segmentation with the advantage of a tuning parameter that provides a way of refine segmentation.