A multi-level approach for document clustering

Lecture Notes in Computer Science

Volumn 3514, Issue I, 2005, Pages 204-211

  Oliveira, Suely ^a   Seok, Sang Cheol ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPHIC METHODS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIVISIVE MINMAXCUT ALGORITHMS; DOCUMENT CLUSTERING; GRAPH PARTITIONING ALGORITHMS; REFINING ALGORITHMS; CLUSTER METHOD; CLUSTERING RESULTS; MULTILEVEL ALGORITHM; MULTILEVELS;

ALGORITHMS; CLUSTERING ALGORITHMS;

EID: 25144469352     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428831_26     Document Type: Conference Paper

References (12)

1. T. Bui and C. Jones. A heuristic for reducing fill in sparse matrix factorization. In 6th SIAM Conf. Parallel Processing for Scientific Computing, pages 445-452, 1993.
2. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. A min-max cut algorithm for graph partitioning data clustering. In ICDM 2001, Proceedings IEEE International Conference on Data Mining, 2001, pages 107-114. IEEE, 2001.
3. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. A minmaxcut spectral method for data clustering and graph partitioning. Technical Report 54111, LBNL, December 2003.
4. L. Hagen and A. Kahng. Fast spectral methods for ratio cut partitioning and clustering. In Proceedings of IEEE International Conference on Computer Aided Design, pages 10-13. IEEE, 1991.
5. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratories, 1993.
6. M. Holzrichter and S. Oliveira. A graph based davidson algorithm for the graph partitioning problem. International Journal of Foundations of Computer Science, 10:225-246, 1999.
7. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1998.
8. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 1970.
9. J. MacQueen. Some methods for classification and analysis of multivariate observations. Proc. Fifth Berkeley Symp. Math. Statistics and Probability, 1:281-296, 1967.
10. A. McCallum. A toolkit for statistical language modeling, text retrieval, classification and clustering., 1996. Available on WWW at URL http://www.cs.emu.edu/~mccallum/bow.
11. A. Pothen, H. D. Simon, and Kang-Pu K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430-452, 1990.
12. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8):888-905, Aug 2000.