Subquadratic approximation algorithms for clustering problems in high dimensional spaces

DOI10.1023/B:MACH.0000033118.09057.80zbMath1089.68119OpenAlexW2082021920MaRDI QIDQ5894899

Rafail Ostrovsky, Yuval Rabani, Allan Borodin

Publication date: 19 January 2005

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:mach.0000033118.09057.80

zbMATH Keywords

Graph-theoretic clusteringhigh dimensional spacessparse partitions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

This page was built for publication: Subquadratic approximation algorithms for clustering problems in high dimensional spaces