An automatic clustering algorithm for probability density functions

DOI10.1080/00949655.2014.949715zbMath1457.62197OpenAlexW1991490503MaRDI QIDQ5222264

Wen-Liang Hung, Jen-Hao Chen

Publication date: 1 April 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949655.2014.949715

zbMATH Keywords

probability density functionclustering algorithmskernel density methodCOREL image database

Mathematics Subject Classification ID

Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (13)

A jackknife entropy-based clustering algorithm for probability density functions ⋮ Similar coefficient for cluster of probability density functions ⋮ Automatic genetic algorithm in clustering for discrete elements ⋮ A modified self-updating clustering algorithm for application to dengue gene expression data ⋮ A robust automatic clustering algorithm for probability density functions with application to categorizing color images ⋮ An automatic fuzzy clustering algorithm for discrete elements ⋮ Modified genetic algorithm-based clustering for probability density functions ⋮ The fuzzy cluster analysis for interval value using genetic algorithm and its application in image recognition ⋮ Randomized self-updating process for clustering large-scale data ⋮ Fuzzy clustering of probability density functions ⋮ An automatic clustering for interval data using the genetic algorithm ⋮ An efficient automatic clustering algorithm for probability density functions and its applications in surface material classification ⋮ A new binary adaptive elitist differential evolution based automatic \(k\)-medoids clustering for probability density functions

Uses Software

• SIMPLIcity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-based clustering of probability density functions
• Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
• Choosing initial values for the EM algorithm for finite mixtures
• The self-organizing map
• On the convergence and consistency of the blurring mean-shift process
• Bayesian analysis in the \(L^{1}\)-norm of the mixing proportion using discriminant analysis
• Simple and effective boundary correction for kernel densities and regression with an application to the world income and Engel curve estimation
• Clustering probability distributions
• Self-updating clustering algorithm for estimating the parameters in mixtures of von Mises distributions
• Statistical Discrimination Analysis Using the Maximum Function
• Self-organizing maps.

This page was built for publication: An automatic clustering algorithm for probability density functions