Incremental Clustering and Dynamic Information Retrieval

DOI10.1137/S0097539702418498zbMath1101.68605OpenAlexW2016973429MaRDI QIDQ4651519

Chandra Chekuri, Tomás Feder, Moses Charikar, Rajeev Motwani

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702418498

zbMATH Keywords

incremental clusteringperformance guaranteeagglomerative clusteringminimum diameter clusteringk-centerdynamic information retrieval

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (38)

Online unit clustering and unit covering in higher dimensions ⋮ A randomized algorithm for online unit clustering ⋮ On hierarchical diameter-clustering and the supplier problem ⋮ Hierarchy cost of hierarchical clusterings ⋮ COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k ⋮ Better bounds on online unit clustering ⋮ Incremental list coloring of graphs, parameterized by conservation ⋮ Competitive Strategies for Online Clique Clustering ⋮ Streaming with minimum space: an algorithm for covering by two congruent balls ⋮ Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls ⋮ An online 2-dimensional clustering problem with variable sized clusters ⋮ Covering a set of points with a minimum number of equal disks via simulated annealing ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Online clustering with variable sized clusters ⋮ Massively parallel and streaming algorithms for balanced clustering ⋮ Hitting geometric objects online via points in \(\mathbb{Z}^d\) ⋮ Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) ⋮ An improved data stream algorithm for clustering ⋮ Adaptive evolutionary clustering ⋮ Reallocating multiple facilities on the line ⋮ Parameterized dynamic cluster editing ⋮ Identifying Fixations in Gaze Data via Inner Density and Optimization ⋮ Online sum-radii clustering ⋮ Online unit clustering: Variations on a theme ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ On the Online Unit Clustering Problem ⋮ An equi-biased \(k\)-prototypes algorithm for clustering mixed-type data ⋮ Correlation clustering in data streams ⋮ Online unit covering in Euclidean space ⋮ Online clique clustering ⋮ Approximation algorithms for hierarchical location problems ⋮ Parameterized Dynamic Cluster Editing ⋮ An adaptive probabilistic algorithm for online \(k\)-center clustering ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints ⋮ An improved algorithm for online unit clustering ⋮ The reverse greedy algorithm for the metric k-median problem ⋮ Experiments with unit disk cover algorithms for covering massive pointsets ⋮ General bounds for incremental maximization

This page was built for publication: Incremental Clustering and Dynamic Information Retrieval