The star clustering algorithm for static and dynamic information organization

Journal of Graph Algorithms and Applications

Volumn 8, Issue 1, 2004, Pages 95-129

  Aslam, Javed A ^a   Pelekhov, Ekaterina ^b   Rus, Daniela ^c  

^a Northeastern University   (United States)

^b Dartmouth Department of Computer Science_Dartmouth College   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4644233828     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00084     Document Type: Article

References (36)

1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder and J. Naor. The Online Set Cover Problem. In Proceedings of the thirty-fifth annual ACM Symposium on Theory of Computing, pp 100-105, San Diego, CA, 2003.
2. M. Aldenderfer and R. Blashfield, Cluster Analysis, Sage, Beverly Hills, 1984.
3. J. Allan. Automatic hypertext construction. PhD thesis. Department of Computer Science, Cornell University, January 1995.
4. J. Aslam, K. Pelekhov, and D. Rus, Generating, visualizing, and evaluating high-accuracy clusters for information organization, in Principles of Digital Document Processing, eds. E. Munson, C. Nicholas, D. Wood, Lecture Notes in Computer Science 1481, Springer Verlag 1998.
5. J. Aslam, K. Pelekhov, and D. Rus, Static and Dynamic Information Organization with Star Clusters. In Proceedings of the 1998 Conference on Information Knowledge Management, Bethesda, MD, 1998.
6. J. Aslam, K. Pelekhov, and D. Rus, A Practical Clustering Algorithm for Static and Dynamic Information Organization. In Proceedings of the 1999 Symposium on Discrete Algorithms, Baltimore, MD, 1999.
7. B. Bollobás, Random Graphs, Academic Press, London, 1995.
8. F. Can, Incremental clustering for dynamic information processing, in ACM Transactions on Information Systems, no. 11, pp 143-164, 1993.
9. J. Carroll and P. Arabie. Multidimensional Scaling. Ann. Rev. Psych., vol. 31, pp 607-649, 1980.
10. th Symposium on Theory of Computing, 1997.
11. G. Crippen and T. Havel. Distance Geometry and Molecular Conformation. John Wiley & Sons Inc., 1988.
12. W. B. Croft. A model of cluster searching based on classiffication. Information Systems, 5:189-195, 1980.
13. W. B. Croft. Clustering large .les of documents using the single-link method. Journal of the American Society for Information Science, pp 189-195, November 1977.
14. th SIGIR, 1993.
15. th Symposium on Theory of Computing, pp 434-444, 1988.
16. M. Garey and D. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completness.W. H. Freeman and Company, New York. 1979.
17. th SIGIR, 1996.
18. D. Hochbaum and D. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM, no. 33, pp 533-550, 1986.
19. A. Jain and R. Dubes. Algorithms for Clustering Data, Prentice Hall, 1988.
20. N. Jardine and C.J. van Rijsbergen. The use of hierarchical clustering in information retrieval, Information Storage and Retrieval, 7:217-240, 1971.
21. R. Karp. Reducibility among combinatorial problems. Computer Computations, pp 85-104, Plenum Press, NY, 1972.
22. G. Kortsarz and D. Peleg. On choosing a dense subgraph. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993.
23. J. Kruskal and M. Wish. Multidimensional scaling. Sage Publications, Beverly Hills, CA, 1978.
24. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2):215-245, 1995.
25. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM 41, 960-981, 1994.
26. W. Press, B. Flannery, S. Teukolsky, and W. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, 1988.
27. W. Pugh. SkipLists: a probabilistic alternative to balanced trees. in Communications of the ACM, vol. 33, no. 6, pp 668-676, 1990.
28. C.J. van Rijsbergen. Information Retrieval. Butterworths, London, 1979.
29. D. Rus, R. Gray, and D. Kotz. Transportable Information Agents. Journal of Intelligent Information Systems, vol 9. pp 215-238, 1997.
30. G. Salton. Automatic Text Processing: the transformation, analysis, and retrieval of information by computer, Addison-Wesley, 1989.
31. G. Salton. The Smart document retrieval project. In Proceedings of the Fourteenth Annual International ACM/SIGIR Conference on Research and Development in Information Retrieval, pages 356-358.
32. H. Turtle. Inference networks for document retrieval. PhD thesis. University of Massachusetts, Amherst, 1990.
33. th SIGIR, pp 95-104, 1985.
34. P. Willett. Recent trends in hierarchical document clustering: A critical review. Information Processing and Management, 24:(5):577-597, 1988.
35. S. Worona. Query clustering in a large document space. In Ed. G. Salton, The SMART Retrieval System, pp 298-310. Prentice-Hall, 1971.
36. D. Zuckerman. NP-complete problems have a version that's hard to approximate. In Proceedings of the Eight Annual Structure in Complexity Theory Conference, IEEE Computer Society, 305-312, 1993.