A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Unsupervised clustering on dynamic databases
Pattern Recognition Letters
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Declaring independence via the sketching of sketches
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online unit clustering: Variations on a theme
Theoretical Computer Science
Aggregated cross-media news visualization and personalization
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal sampling from sliding windows
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data warehouse technology by infobright
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Variable-Size Rectangle Covering
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Intelligent Data Granulation on Load: Improving Infobright's Knowledge Grid
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
The reverse greedy algorithm for the metric k-median problem
Information Processing Letters
On the online unit clustering problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Towards subspace clustering on dynamic data: an incremental version of PreDeCon
Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques
On the online unit clustering problem
ACM Transactions on Algorithms (TALG)
Online clustering with variable sized clusters
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Enhancing search in a geospatial multimedia annotation system
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
XML data clustering: An overview
ACM Computing Surveys (CSUR)
Fast clustering using MapReduce
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Density based subspace clustering over dynamic data
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Incremental clustering of newsgroup articles
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Better bounds on online unit clustering
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
WebKDD'05 Proceedings of the 7th international conference on Knowledge Discovery on the Web: advances in Web Mining and Web Usage Analysis
A randomized algorithm for online unit clustering
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A recommendation model for handling dynamics in user profile
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An improved algorithm for online unit clustering
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Better bounds on online unit clustering
Theoretical Computer Science
Streaming with minimum space: An algorithm for covering by two congruent balls
Theoretical Computer Science
Adaptive evolutionary clustering
Data Mining and Knowledge Discovery
| Hi-index | 0.01 |
Motivated by applications such as document and image classification in information retrieval, we consider the problem of clustering dynamic point sets in a metric space. We propose a model called incremental clustering which is based on a careful analysis of the requirements of the information retrieval application, and which should also be useful in other applications. The goal is to efficiently maintain clusters of small diameter as new points are inserted. We analyze several natural greedy algorithms and demonstrate that they perform poorly. We propose new deterministic and randomized incremental clustering algorithms which have a provably good performance, and which we believe should also perform well in practice. We complement our positive results with lower bounds on the performance of incremental algorithms. Finally, we consider the dual clustering problem where the clusters are of fixed diameter, and the goal is to minimize the number of clusters.