K-MEANS CLUSTERING USING ENTROPY MINIMIZATION

DOI10.1142/9789812796592_0015zbMATH Open1103.62058OpenAlexW2502822604MaRDI QIDQ3416296

Anthony Okafor, Panos M. Pardalos

Publication date: 19 January 2007

Published in: Theory and Algorithms for Cooperative Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812796592_0015

zbMATH Keywords

image clusteringIris data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15) Statistical aspects of information-theoretic topics (62B10)

Related Items (3)

Title not available (Why is that?) ⋮ Cross-entropy clustering ⋮ A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering

Recommendations

• Title not available (Why is that?) 👍 👎
• Cross-entropy clustering 👍 👎
• Entropic approach to multiscale clustering analysis 👍 👎
• Maximum-entropy clustering algorithm and its global convergence analysis 👍 👎

This page was built for publication: K-MEANS CLUSTERING USING ENTROPY MINIMIZATION

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