Cross-entropy clustering
From MaRDI portal
Publication:85407
DOI10.1016/j.patcog.2014.03.006zbMath1342.68279arXiv1210.5594OpenAlexW2063598178WikidataQ112225956 ScholiaQ112225956MaRDI QIDQ85407
Jacek Tabor, Przemysław Spurek, Jacek Tabor, Przemysław Spurek
Publication date: September 2014
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.5594
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)
Related Items (11)
Ellipticity and circularity measuring via Kullback-Leibler divergence ⋮ Neighborhood density information in clustering ⋮ Clustering of seasonal events: A simulation study using circular methods ⋮ Constrained clustering with a complex cluster structure ⋮ Lossy compression approach to subspace clustering ⋮ Efficient mixture model for clustering of sparse high dimensional binary data ⋮ R2DS: a novel hierarchical framework for driver fatigue detection in mountain freeway ⋮ Logistic regression with weight grouping priors ⋮ CEC ⋮ Semi-supervised cross-entropy clustering with information bottleneck constraint ⋮ Extreme entropy machines: robust information theoretic classification
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- NP-hardness of Euclidean sum-of-squares clustering
- Competitive EM algorithm for finite mixture models
- Applied Multivariate Statistical Analysis
- Bayesian k-Means as a “Maximization-Expectation” Algorithm
- Printer graphics for clustering
- Model-Based Gaussian and Non-Gaussian Clustering
- A deterministic annealing approach to clustering
- Least squares quantization in PCM
- Clustering Methods: A History of k-Means Algorithms
- On clustering validation techniques
This page was built for publication: Cross-entropy clustering
