Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
暂无分享,去创建一个
[1] P. Sneath,et al. Numerical Taxonomy , 1962, Nature.
[2] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[3] Benjamin King. Step-Wise Clustering Procedures , 1967 .
[4] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[5] David G. Stork,et al. Pattern Classification , 1973 .
[6] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[7] Martin F. Porter,et al. An algorithm for suffix stripping , 1997, Program.
[8] Gerard Salton,et al. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .
[9] Andrew B. Kahng,et al. Fast spectral methods for ratio cut partitioning and clustering , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.
[10] Chung-Kuan Cheng,et al. An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[11] J. E. Jackson. A User's Guide to Principal Components , 1991 .
[12] David R. Karger,et al. Scatter/Gather: a cluster-based approach to browsing large document collections , 1992, SIGIR '92.
[13] J. Edward Jackson,et al. A User's Guide to Principal Components. , 1991 .
[14] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.
[15] Chris Buckley,et al. OHSUMED: an interactive retrieval evaluation and new large test collection for research , 1994, SIGIR '94.
[16] Susan T. Dumais,et al. Using Linear Algebra for Intelligent Information Retrieval , 1995, SIAM Rev..
[17] Peter C. Cheeseman,et al. Bayesian Classification (AutoClass): Theory and Results , 1996, Advances in Knowledge Discovery and Data Mining.
[18] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[19] Douglas H. Fisher,et al. Iterative Optimization and Simplification of Hierarchical Clusterings , 1996, J. Artif. Intell. Res..
[20] David D. Lewis,et al. Reuters-21578 Text Categorization Test Collection, Distribution 1.0 , 1997 .
[21] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[22] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[23] Vipin Kumar,et al. WebACE: a Web agent for document categorization and exploration , 1998, AGENTS '98.
[24] George Karypis,et al. C HAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling , 1999 .
[25] Vipin Kumar,et al. Multilevel Refinement for Hierarchical Clustering , 1999 .
[26] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[27] Sudipto Guha,et al. ROCK: a robust clustering algorithm for categorical attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[28] Chinatsu Aone,et al. Fast and effective text mining using linear-time document clustering , 1999, KDD '99.
[29] Vipin Kumar,et al. Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.
[30] Doug Beeferman,et al. Agglomerative clustering of a search engine query log , 2000, KDD '00.
[31] Joydeep Ghosh,et al. A S alable Approa h to Balan ed, High-dimensional Clustering of Market-baskets , 2000 .
[32] Joachim M. Buhmann,et al. A theory of proximity based clustering: structure detection by optimization , 2000, Pattern Recognit..
[33] George Karypis,et al. A Comparison of Document Clustering Techniques , 2000 .
[34] Tamara G. Kolda,et al. Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing , 1999, SIAM J. Sci. Comput..
[35] George Karypis,et al. Concept Indexing: A Fast Dimensionality Reduction Algorithm With Applications to Document Retrieval and Categorization , 2000 .
[36] Chris H. Q. Ding,et al. Spectral Relaxation for K-means Clustering , 2001, NIPS.
[37] Chris H. Q. Ding,et al. Bipartite graph partitioning and data clustering , 2001, CIKM '01.
[38] Anthony K. H. Tung,et al. Spatial clustering methods in data mining : A survey , 2001 .
[39] Shigeo Abe DrEng. Pattern Classification , 2001, Springer London.
[40] G. Karypis,et al. Criterion Functions for Document Clustering ∗ Experiments and Analysis , 2001 .
[41] Inderjit S. Dhillon,et al. Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.
[42] Ming Gu,et al. Spectral min-max cut for graph partitioning and data clustering , 2001 .
[43] Sergio M. Savaresi,et al. On the performance of bisecting K-means and PDDP , 2001, SDM.
[44] Paul D. Minton,et al. Statistics: The Exploration and Analysis of Data , 2002, Technometrics.
[45] Daniel Boley,et al. Principal Direction Divisive Partitioning , 1998, Data Mining and Knowledge Discovery.
[46] Inderjit S. Dhillon,et al. Concept Decompositions for Large Sparse Text Data Using Clustering , 2004, Machine Learning.
[47] Marina Meila,et al. An Experimental Comparison of Model-Based Clustering Methods , 2004, Machine Learning.
[48] Douglas H. Fisher,et al. Knowledge Acquisition Via Incremental Conceptual Clustering , 1987, Machine Learning.
[49] Sergio M. Savaresi,et al. Choosing the cluster to split in bisecting divisive clustering algorithms , 2006 .