A new clustering algorithm for coordinate-free data
From MaRDI portal
Recommendations
- A new non-iterative approach for clustering
- A partitional clustering algorithm validated by a clustering tendency index based on graph theory
- Hierarchical clustering schemes
- scientific article; zbMATH DE number 220723
- Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 2205355 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A survey of graph edit distance
- A sweepline algorithm for Voronoi diagrams
- An Algorithm for Convex Polytopes
- Concept learning and feature selection based on square-error clustering
- Every planar map is four colorable. II: Reducibility
- Finding Groups in Data
- Multidimensional binary search trees used for associative searching
- On the Average Number of Maxima in a Set of Vectors and Applications
- Quad trees: A data structure for retrieval by composite keys
- Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
This page was built for publication: A new clustering algorithm for coordinate-free data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962672)