Resilient \(k\)-d trees: \(k\)-means in space revisited
type: Item
instance of: scholarly article
title: Resilient \(k\)-d trees: \(k\)-means in space revisited
zbMATH Open document ID: 1251.68084
author: Fabian Gieseke
author: Gabriel Moruz
author: Jan Vahrenhold
published in: Frontiers of Computer Science
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6107627
zbMATH Keywords: data mining
zbMATH Keywords: clustering
zbMATH Keywords: resilient algorithms and data structures
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: s11704-012-2870-8
OpenAlex ID: W1498552105
DOI: 10.1007/S11704-012-2870-8
Recommended article: Refinements to nearest-neighbor searching in k-dimensional trees
Recommended article: The efficiency of using k-d trees for finding nearest neighbors in discrete space
Recommended article: k-Center Clustering Under Perturbation Resilience
Recommended article: k -center Clustering under Perturbation Resilience
Recommended article: Q4411341
Recommended article: Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
Recommended article: Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Recommended article: Median and hybrid median \(K\)-dimensional trees
Recommended article: Algorithms for radius-optimally augmenting trees in a metric space
description: scientific article; zbMATH DE number 6107627