Automatic clustering algorithm for interval data based on overlap distance
From MaRDI portal
Publication:6116998
DOI10.1080/03610918.2021.1900248OpenAlexW3137746435MaRDI QIDQ6116998
Unnamed Author, Unnamed Author, Tai Vo-Van
Publication date: 18 July 2023
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2021.1900248
Cites Work
- Model-based clustering of probability density functions
- Interval data clustering using self-organizing maps based on adaptive Mahalanobis distances
- Similar coefficient of cluster for discrete elements
- Exploratory data analysis of interval-valued symbolic data with matrix visualization
- Information-theoretic feature selection with discrete \(k\)-median clustering
- Similar coefficient for cluster of probability density functions
- A robust automatic clustering algorithm for probability density functions with application to categorizing color images
- Modified genetic algorithm-based clustering for probability density functions
- Clustering probability distributions
- L1-distance and classification problem by Bayesian method
- Fuzzy clustering of probability density functions
This page was built for publication: Automatic clustering algorithm for interval data based on overlap distance