A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
From MaRDI portal
(Redirected from Publication:1015175)
Recommendations
Cites work
- Cure: An efficient clustering algorithm for large databases
- Finding Groups in Data
- Graph theoretical clustering based on limited neighbourhood sets
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- scientific article; zbMATH DE number 4092816 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- Soft clustering of multidimensional data: A semi-fuzzy approach
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(7)- Clustering by differencing potential of data field
- Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data
- A distance based clustering method for arbitrary shaped clusters in large datasets
- Kernel-based mixture models for classification
- High dimensional data clustering from a dynamical systems point of view
- A novel fast heuristic to handle large-scale shape clustering
- Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
This page was built for publication: A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015175)