Resilient \(k\)-d trees: \(k\)-means in space revisited

DOI10.1007/s11704-012-2870-8zbMath1251.68084OpenAlexW1498552105MaRDI QIDQ1762186

Gabriel Moruz, Fabian Gieseke, Jan Vahrenhold

Publication date: 15 November 2012

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-012-2870-8

zbMATH Keywords

clusteringdata miningresilient algorithms and data structures

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Related Items (3)

Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Resilient dynamic programming ⋮ Exploiting non-constant safe memory in resilient algorithms and data structures

Uses Software

• UCI-ml

This page was built for publication: Resilient \(k\)-d trees: \(k\)-means in space revisited