Static and Dynamic Information Organization with Star Clusters

International Conference on Information and Knowledge Management, Proceedings

Volumn 1998-January, Issue , 1998, Pages 208-217

  Aslam, Javed ^a   Pelekhov, Katya ^a   Rus, Daniela ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

HYPERTEXT SYSTEMS; INFORMATION FILTERING; INFORMATION RETRIEVAL; STARS;

CLUSTERINGS; DYNAMIC INFORMATION; EVALUATION EXPERIMENTS; INFORMATION ORGANIZATION; OFFLINE; SIMPLE++; SINGLE LINK; STAR CLUSTERS; STATIC INFORMATION; STATICS AND DYNAMICS;

CLUSTERING ALGORITHMS;

EID: 84884163172     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288627.288659     Document Type: Conference Paper

References (33)

1. M. Aldenderfer and R. Blashfield, Cluster Analysis, Sage, Beverly Hills, 1984.
2. J. Allan. Automatic hypertext construction. PhD thesis. Department of Computer Science, Cornell University, January 1995.
3. J. Allan, Personal communication, March 1998.
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. C. Nicholas, Lecture Notes in Computer Science, Sprinter Verlag 1998 (to appear). Also available as Technical Report PCS-TR97-319, Department of Computer Science, Dartmouth, 1997.
5. J. Aslam, K. Pelekhov, and D. Rus, Computing Dense Clusters On-line for Information Organization, Technical Report PCS-TR97-324, Department of Computer Science, Dartmouth, 1997.
6. B. Bollobas, Random Graphs, Academic Press, London, 1995.
7. R. Burgin, The retrieval effectiveness of five clustering algorithms as a function of indexing exhaustively, Journal of American Society for Information Science 468:562-572, 1995.
8. F. Can, Incremental clustering for dynamic information processing, in ACM Transactions on Information Systems, no. 11, pp143-164, 1993.
9. th Symposium on Theory of Computing, 1997.
10. W. B. Croft. A model of cluster searching based on classification. Information Systems, 5:189-195, 1980.
11. W. B. Croft. Clustering large files of documents using the single-link method. Journal of the American Society for Information Science, pp189-195, November 1977.
12. th SIGIR, 1993.
13. th Symposium on Theory of Computing, pp 434-444, 1988.
14. th SIGIR, 1996.
15. D. Hochbaum and D. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM, no. 33, pp533-550, 1986.
16. A. Jain and R. Dubes. Algorithms for Clustering Data, Prentice Hall 1988.
17. N. Jardine and C.J. van Rijsbergen. The use of hierarchical clustering in information retrieval, Information Storage and Retrieval, 7:217-240, 1971.
18. G. Kortsarz and D. Peleg. On choosing a dense subgraph. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993.
19. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2):215-245, 1995.
20. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM 41, 960-981, 1994.
21. C.J. van Rijsbergen. Information Retrieval. But-terworths, London, 1979.
22. G. Salton. Automatic Text Processing: the transformation, analysis, and retrieval of information by computer, Addison-Wesley, 1989.
23. G. Salton. The Smart document retrieval project. In Proceedings of the Fourteenth Annual International ACM/SIGIR Conference on Research and Development in Information Retrieval, pp 356-358.
24. W. Shaw, On the foundation of evaluation, Journal of the American Society for Information Science, vol 37, pp 346-348, 1986.
25. W. Shaw, Controlled and uncontrolled subject descriptions in the CF database: a comparison of optimal cluster-based retrieval results, Information Processing and Management, vol. 29, pp 751-763, 1993.
26. K. Spark Jones and D. Jackson. The use of automatically-obtained keyword classifications for information retrieval. Information Storage and Retrieval, 5:174-201, 1970.
27. H. Turtle. Inference networks for document retrieval. PhD thesis. University of Massachusetts, Amherst, 1990.
28. C.J. van Rijsbergen and B. Croft, Document clustering: an evaluation of some experiments with the Cranfield 1400 collection, Information Processing and Management, 11, 171-182.
29. E. Voorhees. The effectiveness and efficiency of ag-glomerative hierarchical clustering in document retrieval, PhD Thesis, Department of Computer Science, Cornell University 1985, available as TR 85-705.
30. th SIGIR, pp 95-104, 1985.
31. P. Willett. Recent trends in hierarchical document clustering: A critical review. Information Processing and Management, 24:(5):577-597, 1988.
32. S. Worona. Query clustering in a large document space. In Ed. G. Salton, The SMART Retrieval System, pp 298-310. Prentice-Hall, 1971.
33. 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.