Dharmendra S. Modha
W. Scott Spangler
- 1.B OTAFAGO, R. A. Cluster analysis for hypertext systems. InACM SIGIR (1993). Google Scholar
Digital Library
- 2.BRADLEY, P., AND FAYYAD, U. Refining initial points for k-means clustering. In ICML (1998), pp. 91-99. Google ScholarDigital Library
- 3.CHAKRABARTI, S., DOM, B. E., AND INDYK, P. Enhanced hypertext categorization using hyperlinks. In ACM SIGMOD (1998). Google ScholarDigital Library
- 4.CHAKRABARTI, S., DOM, B. E., KUMAR, S. R., RAGHAVAN, P., RAJAGOPALAN, S., TOMKINS, A., KLEINBERG, J. M., AND GIBSON, D. Hypersearching the web. Scientific American (June 1999).Google Scholar
- 5.CHAKRABARTI, S., DOM, B. E., RAGHAVAN, P., RA- JAGOPALAN, S., GIBSON, D., AND KLEINBERG, J. Automatic resource compilation by analyzing hyperlink structure and associated text. In WWW7 (1998). Google ScholarDigital Library
- 6.CHEN, C. Structuring and visualizing the www by generalized similarity analysis. In ACM Hypertext (1997). Google ScholarDigital Library
- 7.CHEN, C., AND CZERWINSKI, M. From latent semantics to spatial hypertext-An integrated approach. In ACM Hypertext (1998). Google ScholarDigital Library
- 8.CROFT, W. B., AND TURTLE, U. e. A retrieval model for incorporating hypertext links. In ACM Hypertext (1989). Google ScholarDigital Library
- 9.DHILLON, I. S., AND MODHA, D. S. Concept decompositions for large sparse text data using clustering. Tech. Rep. RJ 10147 (95022), IBM Almaden Research Center, 1999.Google Scholar
- 10.FRAKES, W. B., AND BAEZA-YATES, R. Information Retrieval: Data Structures and Algorithms. Prentice Hall, Englewood Cliffs, New Jersey, 1992. Google ScholarDigital Library
- 11.FREI, H. P., AND STEIGER, D. Making use of hypertext links when retrieving information. In ACM European Conference on Hypertext (1992). Google ScholarDigital Library
- 12.HARTIGAN, J. A. Clustering Algorithms. Wiley, 1975. Google ScholarDigital Library
- 13.KLEINBERG, J. Authoritative sources in a hyperlinked environment. In ACM-SIAM SODA (1998). Google ScholarDigital Library
- 14.KWOK, K.L. A probabilistic theory of indexing and similarity measure based on cited and citing documents. J. Amer. Soc. Inform. Sci. (1985), 342-351. Google ScholarDigital Library
- 15.LARSON, R. Bibliometric of the world wide web: An exploratory analysis of the intellectual structure of cyberspace. In Annual Meeting Amer. Soc. Info. Sci. (1996).Google Scholar
- 16.LAWRENCE, S., AND GILES, C.L. Searching the World Wide Web. Science 280, 5360 (1998), 98.Google Scholar
- 17.MUKHERJEA, S., FOLEY, J. D., AND HUDSON, S. E. Interactive clustering for navigating in hypermedia systems. In ACM Hypertext (1994). Google ScholarDigital Library
- 18.PIROLLI, P., PITKOW, J., AND RAG, R. Silk from sow's ear: Extracting usable structures from the web. In ACM SIGCHI Human Factors Comput. (1996). Google ScholarDigital Library
- 19.RASMUSSEN, E. Clustering algorithms. In Information Retrieval: Data Structures and Algorithms (1992), W. B. Frakes and R. Baeza-Yates, Eds., Prentice Hall, Englewood Cliffs, New Jersey, pp. 419-442. Google Scholar
- 20.SALTON, G. Associative document retrieval techniques using bibliographic information. J. ACM (1963), 440- 457. Google ScholarDigital Library
- 21.SALTON, G., AND MCGILL, M. J. Introduction to Modern Retrieval. McGraw-Hill Book Company, 1983. Google ScholarDigital Library
- 22.SILVERSTEIN, C., HENZINGER, M., MARAIS, J., AND MORICZ, M. Analysis of a very large AltaVista query log. Tech. Rep. 1998-014, Compaq Systems Research Center, Palo Alto, CA, October 1998.Google Scholar
- 23.SMALL, H. Co-citation in the scientific literature: A new measure of the relationship between two documents. J. Amer. Soc. Inform. Sci. (1973), 265-269.Google Scholar
- 24.WEISS, R., VELEZ, B., SHELDON, M. A., NAM- PREMPRE, C., SZILAGYI, P., DUDA, A., AND GIF- FORD, D. K. Hypursuit: A hierarchical network search engine that exploits content-link hypertext clustering. In ACM Hypertext (1996). Google ScholarDigital Library
- 25.WHITE, H. D., AND MCCAIN, K. W. Bibliometrics. Annual Review of Information Science and Technology 24 (1989), 119-186.Google Scholar
- 26.WILLET, P. Recent trends in hierarchic document clustering: a critical review. Inform. Proc. & Management (1988), 577-597. Google ScholarDigital Library
Index Terms
- Clustering hypertext with applications to web searching
Recommendations
Iterative random projections for high-dimensional data clustering
In this text we propose a method which efficiently performs clustering of high-dimensional data. The method builds on random projection and the K-means algorithm. The idea is to apply K-means several times, increasing the dimensionality of the data ...
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Many real-world problems deal with collections of high-dimensional data, such as images, videos, text, and web documents, DNA microarray data, and more. Often, such high-dimensional data lie close to low-dimensional structures corresponding to several ...
ASCRClu: an adaptive subspace combination and reduction algorithm for clustering of high-dimensional data
AbstractThe curse of dimensionality in high-dimensional data is one of the major challenges in data clustering. Recently, a considerable amount of literature has been published on subspace clustering to address this challenge. The main objective of the ...
Comments