A new clustering algorithm for coordinate-free data

DOI10.1016/j.patcog.2009.10.018zbMath1192.68576OpenAlexW2063904063MaRDI QIDQ962672

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

zbMATH Keywords

partitionmetric spacegraph coloringcluster analysis

Mathematics Subject Classification ID

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

Uses Software

• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of graph edit distance
• Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
• A sweepline algorithm for Voronoi diagrams
• Every planar map is four colorable. II: Reducibility
• Concept learning and feature selection based on square-error clustering
• Quad trees: A data structure for retrieval by composite keys
• 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
• An Algorithm for Convex Polytopes

This page was built for publication: A new clustering algorithm for coordinate-free data