Expectation-MiniMax approach to clustering analysis

DOI10.1007/3-540-44989-2_21MaRDI QIDQ4444165zbMATH OpenFDO

Authors Yiu-ming Cheung

Publication date 27 January 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2714/27140165.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Competitive EM algorithm for finite mixture models
• Speed-up for the expectation-maximization algorithm for clustering categorical data
• Bayesian k-Means as a “Maximization-Expectation” Algorithm
• Clustering by maximizing a fuzzy classification maximum likelihood criterion
• Investigation of the optimal number of clusters by the adaptive EM algorithm

Cited in

(7)

• Speed-up for the expectation-maximization algorithm for clustering categorical data
• An EM-based ensemble learning algorithm on piecewise surface regression problem
• EMU: an expectation maximization based approach for clustering uncertain data
• Bayesian k-Means as a “Maximization-Expectation” Algorithm
• Non-convex clustering using expectation maximization algorithm with rough set initialization
• Experiments with, and on, algorithms for maximum likelihood clustering
• A hybrid EM approach to spatial clustering

This page was built for publication: Expectation-MiniMax approach to clustering analysis

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