Exhaustivek-nearest-neighbour subspace clustering
From MaRDI portal
Publication:5220700
DOI10.1080/00949655.2014.933222zbMath1457.62200OpenAlexW2089373837MaRDI QIDQ5220700
Ludwig Lausser, Johann M. Kraus, Hans A. Kestler
Publication date: 27 March 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.933222
multi-objective optimizationexhaustive searchsubspace clusteringcluster number estimationcluster map\(k\)-NN clustering
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multi-objective and goal programming (90C29)
Related Items
A perceptually optimised bivariate visualisation scheme for high-dimensional fold-change data, Proceedings of Reisensburg 2013
Uses Software
Cites Work
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- KNN-kernel density-based clustering for high-dimensional multivariate data
- Measuring and visualizing the stability of biomarker selection techniques
- Multi-objective selection for collecting cluster alternatives
- Stability-Based Validation of Clustering Solutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item