Information cut for clustering using a gradient descent approach

DOI10.1016/j.patcog.2006.06.028zbMath1118.68141OpenAlexW1977820418MaRDI 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

zbMATH Keywords

clusteringinformation theoryannealinggradient descent optimizationgraph theoretic cutparzen window density estimation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (3)

A Nonparametric Clustering Algorithm with a Quantile-Based Likelihood Estimator ⋮ Mean shift spectral clustering ⋮ Fuzzy unsupervised classification of multivariate time trajectories with the Shannon entropy regularization

Uses Software

• UCI-ml
• KernSmooth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
• Vector quantization by deterministic annealing
• Spectral analysis of data
• On Estimation of a Probability Density Function and Mode

This page was built for publication: Information cut for clustering using a gradient descent approach