Scalable probabilistic clustering

MaRDI QIDQ2760097zbMATH OpenFDO

Authors P. S. Bradley, U. M. Fayyad, C. A. Reina

Publication date 13 January 2004

zbMATH Keywords

data summarizationEM algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• scientific article; zbMATH DE number 2079485
• Accelerating EM for large databases
• scientific article; zbMATH DE number 5124739
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
• scientific article; zbMATH DE number 1927210

Cited in

(11)

• Extending fuzzy and probabilistic clustering to very large data sets
• Ascent EM for fast and global solutions to finite mixtures: An application to curve-clustering of online auctions
• Sparse probabilistic K-means
• EMU: an expectation maximization based approach for clustering uncertain data
• scientific article; zbMATH DE number 5280158 (Why is no real title available?)
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
• Bayesian k-Means as a “Maximization-Expectation” Algorithm
• scientific article; zbMATH DE number 2079485 (Why is no real title available?)
• Graph clustering
• scientific article; zbMATH DE number 1927210 (Why is no real title available?)
• Accelerating EM for large databases

This page was built for publication: Scalable probabilistic clustering

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