A new binary adaptive elitist differential evolution based automatic k-medoids clustering for probability density functions
Summary: This paper proposes an evolutionary computing based automatic partitioned clustering of probability density function, the so-called binary adaptive elitist differential evolution for clustering of probability density functions (baeDE-CDFs). Herein, the \(k\)-medoids based representative probability density functions (PDFs) are preferred to the \(k\)-means one for their capability of avoiding outlier effectively. Moreover, addressing clustering problem in favor of an evolutionary optimization one permits determining number of clusters ``on the run. Notably, the application of adaptive elitist differential evolution (aeDE) algorithm with binary chromosome representation not only decreases the computational burden remarkably, but also increases the quality of solution significantly. Multiple numerical examples are designed and examined to verify the proposed algorithm's performance, and the numerical results are evaluated using numerous criteria to give a comprehensive conclusion. After some comparisons with other algorithms in the literature, it is worth noticing that the proposed algorithm reveals an outstanding performance in both quality of solution and computational time in a statistically significant way.
- An automatic clustering algorithm for probability density functions
- Metaheuristic clustering
- A dynamic clustering based differential evolution algorithm for global optimization
- Research on an improved automatic differential clustering algorithm based on differential evolution
- Fuzzy clustering of probability density functions
- \(L^1\)-distance and classification problem by Bayesian method
- An automatic clustering algorithm for probability density functions
- Clustering probability distributions
- Discrete data clustering using finite mixture models
- Fuzzy clustering of probability density functions
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- Modified genetic algorithm-based clustering for probability density functions
- Multivariate density estimation. Theory, practice, and visualization
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Statistical Discrimination Analysis Using the Maximum Function
- An automatic clustering algorithm for probability density functions
- A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks
- An efficient robust automatic clustering algorithm for interval data
- An efficient automatic clustering algorithm for probability density functions and its applications in surface material classification
- Developing novel automatic fuzzy clustering algorithm for image data based on representative probability density function vector
This page was built for publication: A new binary adaptive elitist differential evolution based automatic \(k\)-medoids clustering for probability density functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298657)
