Co-clustering documents and words using bipartite spectral graph partitioning

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 269-274

  Dhillon, Inderjit S ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; SPECTRUM ANALYSIS;

BIPARTITE GRAPH MODEL;

INFORMATION RETRIEVAL;

EID: 0035789644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502512.502550     Document Type: Conference Paper

References (26)

1. L. D. Baker and A. McCallum. Distributional clustering of words for text classification. In ACM SIGIR, pages 96-103, 1998.
2. D. Boley. Hierarchical taxonomies using divisive partitioning. Technical Report TR-98-012, University of Minnesota, 1998.
3. D. Boley, M. Gini, R. Gross, E.-H. Han, K. Hastings, G. Karypis, V. Kumar, B. Mobasher, and J. Moore. Document categorization and query generation on the World Wide Web using WebACE. AI Review, 1998.
4. C. J. Crouch. A cluster-based approach to thesaurus construction. In ACM SIGIR, pages 309-320, 1988.
5. D. R. Cutting, D. R. Karger, J. O. Pedersen, and J. W. Tukey. Scatter/gather: A cluster-based approach to browsing large document collections. In ACM SIGIR, 1992.
6. I. S. Dhillon, J. Fan, and Y. Guan. Efficient clustering of very large document collections. In V. K. R. Grossman, C. Kamath and R. Namburu, editors, Data Mining for Scientific and Engineering Applications. Kluwer Academic Publishers, 2001.
7. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42 (1):143-175, January 2001. Also appears as IBM Research Report RJ 10147, July 1999.
8. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42 (1):143-175, January 2001. Also appears as IBM Research Report RJ 10147, July 1999.
9. W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17:420-425, 1973.
10. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. John Wiley &Sons, 2000. 2nd Edition.
11. C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. Technical Report 82CRD130, GE Corporate Research, 1982.
12. M. Fiedler. Algebraic connectivity of graphs. Czecheslovak Mathematical Journal, 23:298-305, 1973.
13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, 1979.
14. G. H. Golub and C. F. V. Loan. Matrix computations. Johns Hopkins University Press, 3rd edition, 1996.
15. L. Hagen and A. B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on CAD, 11:1074-1085, 1992.
16. K. M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 11(3):219-229, 1970.
17. R. V. Katter. Study of document representations: Multidimensional scaling of indexing terms. System Development Corporation, Santa Monica, CA, 1967.
18. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 29(2):291-307, 1970.
19. T. Kohonen. Self-organizing Maps. Springer, 1995.
20. A. Pothen, H. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 11(3):430-452, July 1990.
21. G. Salton and M. J. McGill. Introduction to Modern Retrieval. McGraw-Hill Book Company, 1983.
22. H. Schütze and C. Silverstein. Projections for efficient document clustering. In ACM SIGIR, 1997.
23. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8):888-905, August 2000.
24. A. Strehl, J. Ghosh, and R. Mooney. Impact of similarity measures on web-page clustering. In AAAI 2000 Workshop on AI for Web Search, 2000.
25. C. J. van Rijsbergen. Information Retrieval. Butterworths, London, second edition, 1979.
26. E. M. Voorhees. The effectiveness and efficiency of agglomerative hierarchic clustering in document retrieval. PhD thesis, Cornell University, 1986.