Information cut for clustering using a gradient descent approach

DOI10.1016/J.PATCOG.2006.06.028zbMATH Open1118.68141OpenAlexW1977820418MaRDI QIDQ856432FDOQ856432

Robert Jenssen, Kenneth E. II Hild, Torbjørn Eltoft, Deniz Erdogmus, José C. Príncipe

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

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

Cites Work

• Pattern classification.
• On Estimation of a Probability Density Function and Mode
• Spectral analysis of data
• A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
• Vector quantization by deterministic annealing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

Uses Software

• UCI-ml
• KernSmooth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856432)