A new binary adaptive elitist differential evolution based automatic k-medoids clustering for probability density functions
From MaRDI portal
Publication:2298657
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- An automatic clustering algorithm for probability density functions
- Clustering probability distributions
- Discrete data clustering using finite mixture models
- Fuzzy clustering of probability density functions
- 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
- \(L^1\)-distance and classification problem by Bayesian method
Cited in
(4)- An automatic clustering algorithm for probability density functions
- 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
- A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks
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)
