A new clustering algorithm for coordinate-free data

DOI10.1016/J.PATCOG.2009.10.018zbMATH Open1192.68576OpenAlexW2063904063MaRDI QIDQ962672FDOQ962672

Authors: Alejo Hausner 

Publication date: 7 April 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.10.018

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

zbMATH Keywords

cluster analysispartitiongraph coloringmetric space

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Coloring of graphs and hypergraphs (05C15) Metric spaces, metrizability (54E35)

Cites Work

• Finding Groups in Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every planar map is four colorable. II: Reducibility
• Quad trees: A data structure for retrieval by composite keys
• Title not available (Why is that?)
• A survey of graph edit distance
• A sweepline algorithm for Voronoi diagrams
• An Algorithm for Convex Polytopes
• Multidimensional binary search trees used for associative searching
• On the Average Number of Maxima in a Set of Vectors and Applications
• Concept learning and feature selection based on square-error clustering
• Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data

Uses Software

• clusfind

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)