An incremental nested partition method for data clustering
From MaRDI portal
Publication:969084
DOI10.1016/j.patcog.2010.01.019zbMath1211.68350OpenAlexW2072898155MaRDI QIDQ969084
Dustin L. Espinosa-Isidrón, Denis R. Álvarez-Nadiozhin, Jyrko Correa-Morris
Publication date: 11 May 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.01.019
Related Items (2)
Fast agglomerative clustering using information of \(k\)-nearest neighbors ⋮ An indication of unification for different clustering approaches
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Monte Carlo comparisons of selected clustering procedures
- Structuralization of universes
- Operations research and data mining
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Finding Groups in Data
- Nested Partitions Method for Global Optimization
- Combining Pattern Classifiers
- The Star Clustering Algorithm for Static and Dynamic Information Organization
- An algorithm for information structuring and retrieval
- Nested partitions method for stochastic optimization
This page was built for publication: An incremental nested partition method for data clustering