A Robust Information Clustering Algorithm

DOI10.1162/089976605774320548MaRDI QIDQ3370747zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Qing Song

Publication date 8 February 2006

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976605774320548

zbMATH Keywords

annealingminimax optimizationmutual informationrobust information clustering

Mathematics Subject Classification ID

Neural nets and related approaches to inference from stochastic processes (62M45) Learning and adaptive systems in artificial intelligence (68T05) Robust stability (93D09) Stochastic learning and adaptive control (93E35)

Recommendations

• Information-based clustering
• Information-maximization clustering based on squared-loss mutual information
• An algorithm for minimizing clustering functions
• A robust algorithm for automatic extraction of an unknown number of clusters from noisy data
• Un algorithme de classification automatique non paramétrique

Cites work

• Computation of channel capacity and rate-distortion functions
• How Many Clusters? An Information-Theoretic Perspective
• Robust Least-Squares Estimation With a Relative Entropy Constraint

Cited in

(6)

• Clustering with respect to the information distance
• Adaptive spatial information-theoretic clustering for image segmentation
• scientific article; zbMATH DE number 1305391 (Why is no real title available?)
• Information-maximization clustering based on squared-loss mutual information
• A Nonparametric Clustering Algorithm with a Quantile-Based Likelihood Estimator
• An information-theoretic fuzzy C-spherical shells clustering algorithm

This page was built for publication: A Robust Information Clustering Algorithm

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