Gradual model generator for single-pass clustering

DOI10.1016/J.PATCOG.2006.06.023zbMATH Open1118.68143OpenAlexW2110905857MaRDI QIDQ856427FDOQ856427

Ismo Kärkkäinen, Pasi Fränti

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.023

Recommendations

• Advances in Intelligent Data Analysis VI
• A possibilistic clustering approach toward generative mixture models
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
• Efficient Greedy Learning of Gaussian Mixture Models
• scientific article; zbMATH DE number 1931863

zbMATH Keywords

clusteringGaussian mixture modellarge data setssingle-pass

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Cites Work

• 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?)
• Title not available (Why is that?)
• On-line EM Algorithm for the Normalized Gaussian Network

Cited In (5)

• A Family of Unsupervised Sampling Algorithms
• Moving Up the Cluster Tree with the Gradient Flow
• Self-organised direction aware data partitioning algorithm
• An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations
• Title not available (Why is that?)

This page was built for publication: Gradual model generator for single-pass clustering

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