Incremental clustering and dynamic information retrieval

SIAM Journal on Computing

Volumn 33, Issue 6, 2004, Pages 1417-1440

  Charikar, Moses ^a   Chekuri, Chandra ^b   Feder, Tomas ^d   Motwani, Rajeev ^c  

^a Princeton University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Stanford University   (United States)

^d NONE

Author keywords

Agglomerative clustering; Dynamic information retrieval; Incremental clustering; K center; Minimum diameter clustering; Performance guarantee

Indexed keywords

AGGLOMERATIVE CLUSTERING; DYNAMIC INFORMATION RETRIEVAL; INCREMENTAL CLUSTERING; K-CENTER; MINIMUM DIAMETER CLUSTERING; PERFORMANCE GURANTEE;

ALGORITHMS; DATABASE SYSTEMS; INFORMATION SCIENCE; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY; VECTORS;

INFORMATION RETRIEVAL;

EID: 11144328291     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702418498     Document Type: Article

References (50)

1. M. S. ALDENDERFER AND R. K. BLASHFIELD, Cluster Analysis, Sage, Beverly Hills, CA, 1984.
2. V. ARYA, N. GARG, R. KHANDEKAR, A. MEYERSON, K. MUNAGALA, AND V. PANDIT, Local search heuristic for k-median and facility location problems, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 21-29.
3. Y. BARTAL, M. CHARIKAR, AND D. RAZ, Approximating min-sum k-clustering in metric spaces, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 11-20.
4. M. BERN AND D. EPPSTEIN, Approximation algorithms for geometric problems, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS, Boston, MA, 1996, pp. 296-345.
5. T. BONNESEN AND W. FENCHEL, Theorie der Konvexen Körper, Springer, Berlin, 1934; English translation: BCS Associates, Moscow, ID, 1987.
6. P. BRUCKER, On the complexity of clustering problems, in Optimization and Operations Research, R. Henn, B. Korte, and W. Oletti, eds., Heidelberg, New York, 1977, pp. 45-54.
7. F. CAN, Incremental clustering for dynamic information processing, ACM Trans. Inform. Process. Systems, 11 (1993), pp. 143-164.
8. F. CAN AND E. A. OZKARAHAN, A dynamic cluster maintenance system for information retrieval, in Proceedings of the 10th Annual International ACM SIGIR Conference, 1987, pp. 123-131.
9. F. CAN AND N. D. DROCHAK II, Incremental clustering for dynamic document databases, in Proceedings of the 1990 Symposium on Applied Computing, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 61-67.
10. S. CHAKRABARTI, C. PHILLIPS, A. SCHULZ, D. B. SHMOYS, C. STEIN, AND J. WEIN, Improved scheduling algorithms for minsum criteria, in Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming, Springer, Berlin, 1996, pp. 646-657.
11. M. CHARIKAR, S. GUHA, E. TARDOS, AND D. SHMOYS, A constant-factor approximation algorithm for the k-median problem, J. Comput. System Sci., 65 (2002), pp. 129-149.
12. M. CHARIKAR, S. KHULLER, D. M. MOUNT, AND G. NARASIMHAN, Algorithms for facility location problems with outliers, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 642-651.
13. M. CHARIKAR, L. O'CALLAGHAN, AND R. PANIGRAHY, Better streaming algorithms for clustering problems, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 30-39.
14. M. CHARIKAR AND R. PANIGRAHY, Clustering to minimize the sum of cluster diameters, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 1-10.
15. B. B. CHAUDHRI, Dynamic clustering for time incremental data, Pattern Recognition Lett., 13 (1994), pp. 27-34.
16. D. R. CUTTING, D. R. KARGER, J. O. PEDERSON, AND J. W. TUKEY, Scatter/gather: A cluster-based approach to browsing large document collections, in Proceedings of the 15th Annual International ACM SIGIR Conference, 1992, pp. 318-329.
17. D. R. CUTTING, D. R. KARGER, AND J. O. PEDERSON, Constant interaction-time scatter/gather browsing of very large document collections, in Proceedings of the 16th Annual International ACM SIGIR Conference, 1993, pp. 126-135.
18. W. F. DE LA VEGA, M. KARPINSKI, C. KENYON, AND Y. RABANI, Approximation schemes for clustering problems, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 50-58.
19. R. O. DUDA AND P. E. HART, Pattern Classification and Scene Analysis, Wiley, New York, 1973.
20. B. EVERITT, Cluster Analysis, Heinemann Educational, London, 1974.
21. C. FALOUTSOS AND D. W. OARD, A Survey of Information Retrieval and Filtering Methods, Technical report CS-TR-3514, Department of Computer Science, University of Maryland, College Park, 1995.
22. T. FEDER AND D.H. GREENE, Optimal Algorithms for Approximate Clustering, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 434-444.
23. R. J. FOWLER, M. S. PATERSON, AND S. L. TANIMOTO, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett., 12 (1981), pp. 133-137.
24. W. FRAKES AND R. BAEZA-YATES, EDS., Information Retrieval: Data Structures and Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1992.
25. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
26. M. GOEMANS AND J. KLEINBERG, An improved approximation ratio for the minimum latency problem, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 152-157.
27. T. E. GONZALEZ, Clustering to minimize the maximum intercluster distance, Theoret. Comput. Sci., 38 (1985), pp. 293-306.
28. S. GUHA, N. MISHRA, R. MOTWANI, AND L. O'CALLAGHAN, Clustering data streams, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 359-366.
29. J. A. HARTIGAN, Clustering Algorithms, Wiley, New York, 1975.
30. D. HOCHBAUM, Various notions of approximations: Good, better, best, and more, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS, Boston, MA, 1996, pp. 346-446.
31. D. S. HOCHBAUM AND W. MAAS, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM, 32 (1985), pp. 130-135.
32. D. S. HOCHBAUM AND D. B. SHMOYS, A best possible heuristic for the k-center problem, Math. Oper. Res., 10 (1985), pp. 180-184.
33. D. S. HOCHBAUM AND D. B. SHMOYS, A unified approach to approximation algorithms for bottleneck problems, J. ACM, 33 (1986), pp. 533-550.
34. S. IRANI AND A. KARLIN, Online computation, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS, Boston, MA, 1996, pp. 521-564.
35. A. K. JAIN AND R. C. DUBES, Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, NJ, 1988.
36. K. JAIN AND V. VAZIRANI, Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 48 (2001), pp. 274-296.
37. N. JARDINE AND C. J. VAN RIJSBERGEN, The use of hierarchical clustering in information retrieval, Inform. Storage and Retrieval, 7 (1971), pp. 217-240.
38. O. KARIV AND S. L. HAKIMI, An algorithmic approach to network location problems. I. The p-centers, SIAM J. Appl. Math., 37 (1979), pp. 513-538.
39. N. MEGIDDO AND K. J. SUPOWIT, On the complexity of some common geometric location problems, SIAM J. Comput., 13 (1984), pp. 182-196.
40. S. G. MENTZER, Lower Bounds on Metric k-Center Problems, manuscript, 1988.
41. R. MOTWANI, S. PHILLIPS, AND E. TORNG, Nonclairvoyant scheduling, Theoret. Comput. Sci., 130 (1994), pp. 17-47.
42. E. OMIECINSKI AND P. SCHEUERMANN, A global approach to record clustering and file organization, in Proceedings of the 3rd BCS-ACM Symposium on Research and Development in Information Retrieval, 1984, pp. 201-219.
43. J. PACH AND P. K. AGARWAL, Combinatorial Geometry, Wiley, New York, 1995.
44. E. RASMUSSEN, Clustering algorithms, in Information Retrieval: Data Structures and Algorithms, W. Frakes and R. Baeza-Yates, eds., Prentice-Hall, Englewood Cliffs, NJ, 1992, pp. 419-442.
45. C. J. VAN RIJSBERGEN, Information Retrieval, Butterworths, London, 1979.
46. C. ROGERS, A note on coverings, Mathematika, 4 (1957), pp. 1-6.
47. G. SALTON, Automatic Text Processing, Addison-Wesley, Reading, MA, 1989.
48. G. SALTON AND M. J. McGILL, Introduction to Modern Information Retrieval, McGraw-Hill, New York, 1983.
49. P. WILLETT, Recent trends in hierarchical document clustering: A critical review, Inform. Process. Management, 24 (1988), pp. 577-597.
50. I. H. WITTEN, A. MOFFAT, AND T. C. BELL, Managing Gigabytes: Compressing and Indexing Documents and Images, Van Nostrand Reinhold, New York, 1994.