Information cut for clustering using a gradient descent approach
From MaRDI portal
Publication:856432
DOI10.1016/j.patcog.2006.06.028zbMath1118.68141MaRDI QIDQ856432
Robert Jenssen, Kenneth E. II Hild, Torbjørn Eltoft, Deniz Erdogmus, Jose C. Principe
Publication date: 7 December 2006
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2006.06.028
clustering; information theory; annealing; gradient descent optimization; graph theoretic cut; parzen window density estimation
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
Related Items
A Nonparametric Clustering Algorithm with a Quantile-Based Likelihood Estimator, Fuzzy unsupervised classification of multivariate time trajectories with the Shannon entropy regularization, Mean shift spectral clustering
Uses Software
Cites Work