Incremental clustering and dynamic information retrieval

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Symposium on the Theory of Computing

• Publication date

  1997-05-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/258533.258657
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Managing Gigabytes: Compressing and Indexing Documents and Images

  1999cited by this paper
• Introduction to Modern Information Retrieval

  1999cited by this paper
• Approximation Algorithms for NP-Hard Problems

  1997cited by this paper
• Approximation algorithms for geometric problems

  1996cited by this paper
• Various notions of approximations: good, better, best, and more

  1996cited by this paper
• Improved Scheduling Algorithms for Minsum Criteria

  1996cited by this paper
• An improved approximation ratio for the minimum latency problem

  1996cited by this paper
• Online computation

  1996cited by this paper
• Combinatorial geometry

  1995cited by this paper
• A survey of information retrieval and filtering methods

  1995cited by this paper
• Managing gigabytes

  1994cited by this paper
• Non-clairvoyant scheduling

  1994cited by this paper
• Dynamic clustering for time incremental data

  1994cited by this paper
• Clustering Algorithms

  1993influential reference
• Constant interaction-time scatter/gather browsing of very large document collections

  1993cited by this paper
• Incremental clustering for dynamic information processing

  1993cited by this paper
• Information Retrieval: Data Structures and Algorithms

  1992cited by this paper
• Scatter/Gather: a cluster-based approach to browsing large document collections

  1992cited by this paper
• Incremental clustering for dynamic document databases

  1990cited by this paper
• Automatic text processing

  1988influential reference
• Optimal algorithms for approximate clustering

  1988cited by this paper
• Recent trends in hierarchic document clustering: A critical review

  1988cited by this paper
• Algorithms for Clustering Data

  1988cited by this paper
• A dynamic cluster maintenance system for information retrieval

  1987cited by this paper
• A unified approach to approximation algorithms for bottleneck problems

  1986cited by this paper
• Clustering to Minimize the Maximum Intercluster Distance

  1985influential reference
• Approximation schemes for covering and packing problems in image processing and VLSI

  1985cited by this paper
• A Best Possible Heuristic for the k-Center Problem

  1985cited by this paper
• A Global Approach to Record Clustering and File Reorganization

  1984cited by this paper
• On the Complexity of Some Common Geometric Location Problems

  1984cited by this paper
• Introduction to Modern Information Retrieval

  1983influential reference
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• Optimal Packing and Covering in the Plane are NP-Complete

  1981cited by this paper
• An Algorithmic Approach to Network Location Problems. I: The p-Centers

  1979cited by this paper
• An Algorithmic Approach to Network Location Problems. II: The p-Medians

  1979cited by this paper
• AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS.

  1979cited by this paper
• Optimization and Operations Research

  1976cited by this paper
• Clustering Algorithms

  1975cited by this paper
• Pattern classification and scene analysis

  1974cited by this paper
• Pattern classification and scene analysis

  1974cited by this paper
• The use of hierarchic clustering in information retrieval

  1971cited by this paper
• A note on coverings

  1957cited by this paper
• Theorie der konvexen Körper

  1936cited by this paper

• Online Hitting Set for Axis-Aligned Squares

  2025cites this paper
• Learning-Augmented Online Bidding in Stochastic Settings

  2025cites this paper
• Comprehensive analysis of clustering algorithms: exploring limitations and innovative solutions

  2025cites this paper
• Continuous Prompts: LLM-Augmented Pipeline Processing over Unstructured Streams

  2025cites this paper
• Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance*

  2025cites this paper
• p-Center Problem

  2025cites this paper
• The General Expiration Streaming Model: Diameter, k-Center, Counting, Sampling, and Friends

  2025cites this paper
• Study on an Overlapping Clustering Algorithm for Incremental Data

  2025cites this paper
• Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond

  2025cites this paper
• Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces

  2024cites this paper
• Comprehensive analysis of clustering algorithms: exploring limitations and innovative solutions

  2024cites this paper
• Online Hitting Sets for Disks of Bounded Radii

  2024cites this paper
• Interrelate Training and Clustering for Online Speaker Diarization

  2024cites this paper
• Multiwinner Temporal Voting with Aversion to Change

  2024cites this paper
• Resilient k-Clustering

  2024cites this paper
• Faster Algorithms for Fair Max-Min Diversification in Rd

  2024cites this paper
• SubGen: Token Generation in Sublinear Time and Memory

  2024cites this paper
• New Lower Bound and Algorithms for Online Geometric Hitting Set Problem

  2024cites this paper
• Dynamic Facility Location in High Dimensional Euclidean Spaces

  2024cites this paper
• Online Epsilon Net and Piercing Set for Geometric Concepts

  2024cites this paper
• Online Algorithmic Study of Facility Location Problems: A Survey

  2024cites this paper
• Dynamic L-Budget Clustering of Curves

  2024influential citation
• Online Hitting of Unit Balls and Hypercubes in R d using Points from Z d(cid:63)

  2023cites this paper
• Online k-Median with Consistent Clusters

  2023cites this paper
• Scalable and space-efficient Robust Matroid Center algorithms

  2023cites this paper
• Fair k-Center: a Coreset Approach in Low Dimensions

  2023influential citation
• On the Advice Complexity of Online Unit Clustering

  2023cites this paper
• Fully Dynamic Consistent k-Center Clustering

  2023cites this paper
• k-Center Clustering with Outliers in the MPC and Streaming Model

  2023cites this paper
• Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics

  2023cites this paper
• Moderate Dimension Reduction for k-Center Clustering

  2023cites this paper
• Online Hitting of Unit Balls and Hypercubes in ℝs using Points from ℤd

  2023cites this paper
• Massively parallel and streaming algorithms for balanced clustering

  2023cites this paper
• Online Geometric Covering and Piercing

  2023influential citation
• Dynamic algorithms for k-center on graphs

  2023cites this paper
• 60 Years of Databases (final part)

  2023cites this paper
• Data Clustering Using Sigma-pi Neural Network

  2023cites this paper
• Upper and lower bounds for complete linkage in general metric spaces

  2023cites this paper
• Online Class Cover Problem

  2023cites this paper
• Faster Query Times for Fully Dynamic k-Center Clustering with Outliers

  2023cites this paper
• Approximating Edit Distance in the Fully Dynamic Model

  2023cites this paper
• Hierarchy cost of hierarchical clusterings

  2022cites this paper
• Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems

  2022cites this paper
• Experiments with Unit Disk Cover Algorithms for Covering Massive Pointsets

  2022influential citation
• Efficient approximation algorithms for offline and online unit disk multiple coverage

  2022cites this paper
• Interrelate Training and Searching: A Unified Online Clustering Framework for Speaker Diarization

  2022cites this paper
• Privacy preserved incremental record linkage

  2022cites this paper
• Sublinear time algorithms for greedy selection in high dimensions

  2022influential citation
• Accelerated sparse nonnegative matrix factorization for unsupervised feature learning

  2022cites this paper
• Aggregate-based congestion control for pulse-wave DDoS defense

  2022cites this paper
• The Price of Hierarchical Clustering

  2022influential citation
• Online Piercing of Geometric Objects

  2022cites this paper
• Adapting Stable Matchings to Forced and Forbidden Pairs

  2022cites this paper
• Schematic Memory Persistence and Transience for Efficient and Robust Continual Learning

  2021cites this paper
• Extreme k-Center Clustering

  2021cites this paper
• Anomaly Detection Using Signal Segmentation and One-Class Classification in Diffusion Process of Semiconductor Manufacturing

  2021cites this paper
• Optimal Fully Dynamic k-Centers Clustering

  2021cites this paper
• Affinity Learning Via Self-Supervised Diffusion for Spectral Clustering

  2021cites this paper
• Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees

  2021cites this paper
• Geometric Cover with Outliers Removal

  2021cites this paper
• Role-based lateral movement detection with unsupervised learning

  2021cites this paper
• A Practical Online Framework for Extracting Running Video Summaries under a Fixed Memory Budget

  2021cites this paper
• Unsupervised and Semisupervised Learning

  2021cites this paper
• Online k-means Clustering on Arbitrary Data Streams

  2021influential citation
• On fully dynamic constant-factor approximation algorithms for clustering problems

  2021cites this paper
• A Selective Overview of Recent Advances in Spectral Clustering and Their Applications

  2021cites this paper
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

  2021cites this paper
• METHODS OF INTELLECTUAL ANALYSIS AND APPLICATION OF DATA MINING TECHNOLOGY IN THE FIELD OF MEDICINE

  2021cites this paper
• k-Center Clustering with Outliers in the Sliding-Window Model

  2021cites this paper
• Online Additive Quantization

  2021cites this paper
• No-Substitution k -means Clustering with Optimal Center Complexity and Low Memory

  2021influential citation
• New Aspects of Beyond Worst-Case Analysis

  2021cites this paper
• Machine Learning and Knowledge Discovery in Databases: International Workshops of ECML PKDD 2019, Würzburg, Germany, September 16–20, 2019, Proceedings, Part I

  2020cites this paper
• Efficient Online Classification and Tracking on Resource-constrained IoT Devices

  2020cites this paper
• A dynamic classification unit for online segmentation of big data via small data buffers

  2020cites this paper
• Fast Incremental Spectral Clustering in Titanate Application via Graph Fourier Transform

  2020cites this paper
• Flash Flood Peak Estimation in Small Mountainous Catchments Based on Distributed Geomorphological Unit Hydrographs Using Fuzzy C-Means Clustering

  2020cites this paper
• The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models

  2020cites this paper
• Optimized deep belief network and entropy-based hybrid bounding model for incremental text categorization

  2020cites this paper
• Plug-and-Play Gesture Control Using Muscle and Motion Sensors

  2020cites this paper
• Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering

  2020cites this paper
• Greedy <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula>-Center From Noisy Distance Samples

  2020cites this paper
• Incremental Hierarchical Clustering for Data Insertion and Its Evaluation

  2020cites this paper
• An Overview of End-to-End Entity Resolution for Big Data

  2020cites this paper
• Incremental Density-Based Clustering on Multicore Processors

  2020cites this paper
• Learning Online Data Association

  2020cites this paper
• Multistage s–t Path: Confronting Similarity with Dissimilarity

  2020cites this paper
• Large-Scale Automatic K-Means Clustering for Heterogeneous Many-Core Supercomputer

  2020cites this paper
• Robust Algorithms for Online k-means Clustering

  2020cites this paper
• A Pairwise Fair and Community-preserving Approach to k-Center Clustering

  2020cites this paper
• Online Multiserver Convex Chasing and Optimization

  2020cites this paper
• Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees

  2020cites this paper
• Contention-aware container placement strategy for docker swarm with machine learning based clustering algorithms

  2020influential citation
• Efficient Indexes for Diverse Top-k Range Queries

  2020cites this paper
• Real Time Anomaly Detection Techniques Using PySpark Frame Work

  2020cites this paper
• A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints

  2020influential citation
• Consistent k-Median: Simpler, Better and Robust

  2020cites this paper
• An SNN-DBSCAN Based Clustering Algorithm for Big Data

  2020cites this paper
• Adapting Stable Matchings to Evolving Preferences

  2019cites this paper
• Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model

  2019cites this paper