Grouping multidimensional data: Recent advances in clustering

Grouping Multidimensional Data: Recent Advances in Clustering

Volumn , Issue , 2006, Pages 1-268

  Kogan, Jacob ^a   Nicholas, Charles ^b   Teboulle, Marc ^c  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

^b Baltimore County   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892013223     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-28349-8     Document Type: Book

References (465)

1. Available at http://www.cs.umn.edu/~karypis/cluto/files/datasets.tar.gz
2. Available at ftp://ftp.cs.cornell.edu/pub/smart
3. Doc2mat. Available at www-users.cs.umn.edu/karypis/cluto/files/doc2mat-1. 0.tar.gz
4. General Text Parser. Available at http://www.cs.utk. edu/lsi/soft.html
5. Latent Semantic IndexingWeb Site. Maintained by M.W. Berry and S. Dumais at http://www.cs.utk.edu/lsi/
6. The Lemur Toolkit. Available at http://www-2.cs.cmu.edu/lemur/
7. MATLAB: The Language of Technical Computing. In http://www.mathworks.com/ products/matlab/
8. Mc Toolkit. Available at http://www.cs.utexas.edu/users/dml/software/mc/
9. Telcordia Latent Semantic Indexing (LSI) Demo Machine. Available at http://lsi.research.telcordia.com/
10. C.C. Aggarwal, A. Hinneburg, and D.A. Keim. On the surprising behavior of distance metrics in high dimensional space. In Proceedings of the 8th International Conference on Database Theory (ICDT), pages 420-434, London, UK, 2001
11. C.C. Aggarwal, J.L.Wolf, and P.S. Yu. A new method for similarity indexing of market basket data. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 407-418, Philadelphia, PA, USA, 1999
12. C.C. Aggarwal, J.L. Wolf, P.S. Yu, C. Procopiuc, and J.S. Park. Fast algorithms for projected clustering. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 61-72, Philadelphia, PA, USA, 1999
13. C.C. Aggarwal and P.S. Yu. Finding generalized projected clusters in high dimensional spaces. Sigmod Record, 29(2):70-81, 2000
14. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proceedings of the 4th International Conference of Foundations of Data Organization and Algorithms (FODO), pages 69-84, Evanston, IL, USA, 1993
15. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of ACM SIGMOD, pages 94-105, Seattle, Washington, USA, 1998
16. K.S. Al-Sultan. A tabu search approach to the clustering problem. Pattern Recognition, 28(9):1443-1451, 1995
17. M.S. Aldenderfer and R.K. Blashfield. Cluster Analysis. Number 07-044 in Sage University Paper Series on Quantitative Applications in the Social Sciences. Sage, Beverly Hills, 1984
18. J. Allan. Automatic Hypertext Construction. PhD thesis, Department of Computer Science, Cornell University, January 1995
19. N. Alon, B. Awerbuch, and Y. Azar. The online set cover problem. In STOC'03: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 100-105, ACM Press, New York, 2003
20. K. Alsabti, S. Ranka, and V. Singh. An efficient κ-means clustering algorithm. In Proceedings of IPPS/SPDP Workshop on High Performance Data Mining, 1998
21. M.R. Anderberg. Cluster Analysis and Applications, Academic, New York, NY, USA, 1973
22. R. Ando. Latent semantic space: iterative scaling improves precision of interdocument similarity measurement. In Proceedings of the 23rd ACM Conference of SIGIR, pages 216-223, 2000
23. M. Ankerst, M.M. Breunig, H.-P. Kriegel, and J. Sander. Optics: ordering points to identify the clustering structure. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 49-60, Philadelphia, PA, USA, 1999
24. P. Arabie and L.J. Hubert. An overview of combinatorial data analysis. In P. Arabie, L.J. Hubert, and G.D. Soete, editors, Clustering and Classification, pages 5-63, World Scientific Publishing Co., Singapore, 1996
25. A.N. Arslan and O.Egecioglu. Efficient algorithms for normalized edit distance. Journal of Discrete Algorithms, 1(1), 2000
26. J. Aslam, K. Pelekhov, and D. Rus. Generating, visualizing and evaluating high-quality clusters for information organization. In E.V. Munson, C. Nicholas, and D. Wood, editors, Principles of Digital Document Processing: 4th International Workshop, volume 1481 of Lecture Notes in Computer Science, pages 53-69, Springer, Berlin Heidelberg New York, 1998
27. J. Aslam, K. Pelekhov, and D. Rus. Static and dynamic information organization with star clusters. In G. Gardarin, J. French, N. Pissinou, K. Makki, and L. Bouganim, editors, Proceedings of the 7th International Conference on Information and Knowledge Management, pages 208-217, ACM Press, New York, November 1998
28. J. Aslam, K. Pelekhov, and D. Rus. A practical clustering algorithm for static and dynamic information organization. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 51-60. ACM SIAM, January 1999
29. J. Aslam, K. Pelekhov, and D. Rus. Information organization algorithms. In Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet, July 2000
30. J. Aslam, K. Pelekhov, and D. Rus. Using star clusters for filtering. In A. Agah, J. Callan, and E. Rundensteiner, editors, Proceedings of the 9th International Conference on Information Knowledge Management, pages 306-313, ACM Press, New York, November 2000
31. J.A. Aslam, E. Pelekhov, and D. Rus. The star clustering algorithm for static and dynamic information organization. Journal of Graph Algorithms and Applications, 8(1):95-129, 2004
32. J.A. Aslam, E. Pelekhov, and D. Rus. Persistent queries over dynamic text streams. International Journal of Electronic Business, 3(3-4):288-299, 2005
33. J. Aslam, F. Reiss, and D. Rus. Scalable information organization. In Proceedings of the Conference on Content-Based Multimedia Information Access, pages 1033-1042, Paris, France, April 2000. CID-CASIS
34. A. Auslender and M. Teboulle. The log-quadratic proximal methodology in convex optimization algorithms and variational inequalities. In P. Daniel, F. Gianessi, and A. Maugeri, editors, Equilibrium Problems and Variational Models, Nonconvex Optimization and Its Applications, volume 68, Kluwer, Dordrecht, 2003
35. A. Auslender, M. Teboulle, and S. Ben-Tiba. Interior proximal and multiplier methods based on second order homogeneous kernels. Mathematics of Operations Research, 24:645-668, 1999
36. G.P. Babu and M.N. Murty. A near-optimal initial seed value selection in κ-means algorithm using a genetic algorithm. Pattern Recognition Letters, 14(10):763-769, 1993
37. G.P. Babu and M.N. Murty. Clustering with evolution strategies. Pattern Recognition, 27(2):321-329, 1994
38. R. Baeza-Yates. Introduction to data structures and algorithms related to information retrieval. In W.B. Frakes and R. Baeza-Yates, editors, Information Retrieval, Data Structures and Algorithms, pages 13-27, Prentice-Hall, Englewood Cliffs, NJ, 1992
39. R. Baeza-Yates, A. Moffat, and G. Navarro. Searching large text collections. In J. Abello, P. Pardalos, and M. Resende, editors, Handbook of Massive Data Sets, pages 195-244, Kluwer, Dordrecht, 2002
40. R.A. Baeza-Yates and B.A. Ribeiro-Neto. Modern Information Retrieval. New York/Reading, MA, ACM Press/Addison-Wesley, 1999
41. L.D. Baker and A. McCallum. Distributional clustering of words for text classification. In ACM SIGIR, pages 96-103, Melbourne, Australia, 1998
42. G. Ball and D. Hall. ISODATA: a novel method of data analysis and pattern classification. Technical report, Stanford Research Institute, Menlo Park, CA, 1965
43. A. Banerjee, I. Dhillon, S. Sra, and J. Ghosh. Generative model-based clustering of directional data. In Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining (KDD-03), pages 19-28, 2003
44. A. Banerjee and J. Ghosh. On scaling up balanced clustering algorithms. In Proceedings of the 2nd SIAM ICDM, pages 333-349, Arlington, VA, USA, 2002
45. A. Banerjee and J. Langford. An objective evaluation criterion for clustering. In Proceedings of the 10th International Conference on Knowledge Discovery and Data Mining (KDD-04), pages 515-520, 2004
46. A. Banerjee, S. Merugu, I.S. Dhillon, and J. Ghosh. Clustering with Bregman divergences. In Proceedings of the 2004 SIAM International Conference on Data Mining, pages 234-245, SIAM, 2004
47. A. Banerjee, S. Merugu, I.S. Dhillon, and J. Ghosh. Clustering with Bregman divergences. Journal of Machine Learning Research, 6:1705-1749, 2005
48. J. Banfield and A Raftery. Model-based gaussian and non-gaussian clustering. Biometrics, 49:803-821, 1993
49. D. Barbara and P Chen. Using the fractal dimension to cluster datasets. In Proceedings of the 6th ACM SIGKDD, pages 260-264, Boston, MA, USA, 2000
50. J. Becher, P. Berkhin, and E. Freeman. Automating exploratory data analysis for efficient data mining. In Proceedings of the 6th ACM SIGKDD, pages 424-429, Boston, MA, USA, 2000
51. N. Beckmann, Kriegel, R.H.-P. Schneider, and B. Seeger. The Rß-tree: An efficient access method for points and rectangles. In Proceedings of International Conference on Geographic Information Systems, Ottawa, Canada, 1990
52. D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 407-416, 2000
53. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing System, pages 585-591, The MIT Press, Cambridge, MA, 2002
54. R. Bellman. Adaptive Control Processes: A Guided Tour. Princeton University Press, Princeton, NJ, 1961
55. A. Ben-Dor and Z. Yakhini. Clustering gene expression patterns. In Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB99), pages 11-14, Lyon, France, 1999
56. A. Ben-Tal, A. Charnes and M. Teboulle. Entropic means. Journal of Mathematical Analysis and Applications, 139:537-551, 1989
57. S. Berchtold, C. Böhm, and H.-P. Kriegel. The pyramid-technique: towards breaking the curse of dimensionality. In Proceedings of the ACM SIGMOD Conference, pages 142-153, Seattle, WA, USA, 1998
58. P. Berkhin and J.D. Becher. Learning simple relations: theory and applications. In Proceedings of the 2nd SIAM International Conference on Data Mining, pages 420-436, Arlington, April 2002
59. P. Berkhin. Survey of clustering data mining techniques. Unpublished manuscript, available at Accrue.com, 2002
60. M. Berry and M. Browne. Understanding Search Engines, SIAM, 1999
61. M.W. Berry, S.T. Dumais, and G.W. O'Brien. Using linear algebra for intelligent information retrieval. SIAM Review, 37(4):573-595, 1995
62. M. Berry, T. Do, G. O'Brien, V. Krishna, and Sowmini Varadhan. SVDPACKC (Version 1.0) User's Guide. Computer Science Department Technical Report CS-93-194, University of Tennessee, Knoxville, April 1993
63. M.W. Berry, Z. Drmac, and E.R. Jessup. Matrices, vector spaces, and information retrieval. SIAM Review, 41(2):335-362, June 1999
64. M.W. Berry. Large scale singular value decomposition. International Journal of Supercomputer Application, 6:13-49, 1992
65. M.W. Berry, editor. Survey of Text Mining: Clustering, Classification, and Retrieval. Springer, Berlin Heidelberg New York, 2004
66. M.W. Berry, B. Hendrickson, and P. Raghavan. Sparse matrix reordering schemes for browsing hypertext. In J. Renegar, M. Shub, and S. Smale, editors, The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Mathematics (LAM), pages 99-123. American Mathematical Society, Providence, RI, 1996
67. D.P. Bertsekas. Nonlinear Programming, Athena Scientific, Belmont, MA, 2nd edition, 1999
68. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbor meaningful? In Proceedings of the 7th ICDT, Jerusalem, Israel, 1999
69. D. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York, NY, USA, 1981
70. C.M. Bishop. Neural Networks for Pattern Recognition. Oxford University Press, New York, 1995
71. B.S. Blais. The Role of the Environment in Synaptic Plasticity: Towards an Understanding of Learning and Memory. Thesis submitted in partial fulfilment of the requirements for the Degree of Doctor of Philosophy in the Department of Physics at Brown University, http://web.bryant.edu/bblais/pdf/chap-introduction. pdf, 1998
72. C. Blake, E. Keogh, and C.J. Merz. UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998
73. H.H. Bock. Probability models in partitional cluster analysis. In A. Ferligoj and A. Kramberger, editors, Developments in Data Analysis, pages 3-25, Slovenia, 1996
74. R.F. Boisvert, R. Pozo, K. Remington, R. Barrett, and J. Dongarra. The matrix market: a web repository for test matrix data. In R.F. Boisvert, editor, The Quality of Numerical Software, Assessment and Enhancement, pages 125-137, Chapman and Hall, London, 1997
75. D. Boley, M. Gini, R. Gross, E. Han, K. Hastings, G. Karypis, V. Kumar, B. Mobasher, and J. Moore. Partitioning-based clustering for web document categorization. Decision Support Systems, 27:329-341, 1999
76. D.L. Boley. Principal direction divisive partitioning. Data Mining and Knowledge Discovery, 2(4):325-344, 1998
77. D.L. Boley. Principal direction divisive partitioning software (experimental software, version 2-beta), February 2003. http://www-users.cs.umn. edu/boley/Distribution/PDDP2.html
78. B. Bollobás. Random Graphs, Academic, London, 1995
79. R.J. Bolton and W.J. Krzanowski. A characterization of principal components for projection pursuit. The American Statistician, 53(2):108-109, 1999
80. R.J. Bolton and W.J. Krzanowski. Projection pursuit clustering for exploratory data analysis. Journal of Computational and Graphical Statistics, 12(1):121-142, 2003
81. L. Bottou and Y. Bengio. Convergence properties of the K-means algorithms. In G. Tesauro and D. Touretzky, editors, Advances in Neural Information Processing Systems 7, pages 585-592, The MIT Press, Cambridge, MA, 1995
82. H. Bozdogan. Determining the number of component clusters in the standard multivariate normal mixture model using model-selection criteria. Technical Report UIC/DQM/A83-1, University of Illinois, Chicago, IL, 1983
83. H. Bozdogan. Mixture-model cluster analysis using model selection criteria and a new information measure of complexity. In Proceedings of the 1st US/Japan Conference on the Frontiers of Statistical Modeling: An Informational Approach, pages 69-113, Dordrecht, Netherlands, 1994
84. P. Bradley and U. Fayyad. Refining initial points for κ-means clustering. In J. Shavlik, editor, Proceedings of the 15th International Conference on Machine Learning (ICML), San Francisco, CA, pages 91-99, AAAI Press, USA, 1998
85. P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining. AAAI Press, USA, 1998
86. P.S. Bradley, K.P. Bennett, and A. Demiriz. Constrained κ-means clustering. Technical Report MSR-TR-2000-65, Microsoft Research, Redmond, WA, USA, 2000
87. P.S. Bradley, M. Fayyad, and O.L. Mangasarian. Mathematical programming for data mining: formulations and challenges. INFORMS Journal of Computing, 11:217-238, 1999
88. L.M. Bregman. A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics., 7:200-217, 1967
89. M. Breunig, H.-P. Kriegel, P. Kroger, and J. Sander. Data bubbles: quality preserving performance boosting for hierarchical clustering. In Proceedings of the ACM SIGMOD Conference, Santa Barbara, CA, USA, 2001
90. M.M. Breunig, H.-P. Kriegel, R.T. Ng, and J. Sander. Lof: identifying density-based local outliers. In Proceedings of the ACM SIGMOD Conference, Dallas, TX, USA, 2000
91. D. Brown and C. Huntley. A practical application of simulated annealing to clustering. Technical Report IPC-TR-91-003, University of Virginia, 1991
92. J. Buhmann. Empirical risk approximation: an induction principle for unsupervised learning. Technical Report IAI-TR-98-3, Institut for Informatik III, Universitat Bonn, 1998
93. S. Busygin, G. Jacobsen, and E. Krämer. Double conjugated clustering applied to leukemia microarray data. In 2nd SIAM ICDM, Workshop on Clustering High Dimensional Data, Arlington, VA, USA, 2002
94. I. Cadez, S. Gaffney, and P. Smyth. A general probabilistic framework for clustering individuals. Technical Report UCI-ICS 00-09, University of California, Irvine, 2000
95. I. Cadez, P. Smyth, and H. Mannila. Probabilistic modeling of transactional data with applications to profiling, visualization, and prediction. In Proceedings of the 7th ACM SIGKDD, pages 37-46, San Francisco, CA, USA, 2001
96. R. Calinski and J. Harabasz. A dendrite method for cluster analysis. Communications in Statistics, 3:1-27, 1974
97. G.A. Carpenter, S. Grossberg, and D.B. Rosen. Fuzzy art: fast stable learning and categorization of analog patterns by an adaptive resonance system. Neural Networks, 4:759-771, 1991
98. M.A. Carreira-Perpian. A review of dimension reduction techniques. Technical Report CS-96-09, Department of Computer Science, University of Sheffield, January 1997
99. M. Castellanos. Hot-miner: discovering hot topics from dirty text. In Berry [65], pages 123-157
100. G. Celeux and G. Govaert. A classification EM algorithm for clustering and two stochastic versions. Computational Statistics and Data Analysis, 14:315, 1992
101. Y. Censor and A. Lent. An interval row action method for interval convex programming. Journal of Optimization Theory and Applications, 34:321-353, 1981
102. Y. Censor and S.A. Zenios. Parallel Optimization, Oxford University Press, Oxford, 1997
103. S.V. Chakaravathy and J. Ghosh. Scale based clustering using a radial basis function network. IEEE Transactions on Neural Networks, 2(5):1250-1261, September 1996
104. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proceedings of the 29th Symposium on Theory of Computing, 1997
105. P. Cheeseman and J. Stutz. Bayesian classification (autoclass): theory and results. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 153-180, AAAI/MIT Press, Cambridge, MA, 1996
106. C. Chen, N. Stoffel, M. Post, C. Basu, D. Bassu, and C. Behrens. Telcordia LSI engine: implementation and scalability issues. In Proceedings of the 11th Workshop on Research Issues in Data Engineering (RIDE 2001): Document Management for Data Intensive Business and Scientific Applications, Heidelberg, Germany, April 2001
107. G. Chen and M. Teboulle. Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM Journal of Optimization, 3:538-543, 1993
108. C. Cheng, A. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proceedings of the 5th ACM SIGKDD, pages 84-93, San Diego, CA, USA, 1999
109. C.K. Cheng and Y.-C.A. Wei. An improved two-way partitioning algorithm with stable performance. IEEE Transactions on CAD, 10:1502-1511, December 1991
110. E. Chisholm and T. Kolda. New term weighting formulas for the vector space method in information retrieval. Report ORNL/TM-13756, Computer Science and Mathematics Division, Oak Ridge National Laboratory, 1999
111. T. Chiu, D. Fang, J. Chen, and Y. Wang. A robust and scalable clustering algorithm for mixed type attributes in large database environments. In Proceedings of the 7th ACM SIGKDD, pages 263-268, San Francisco, CA, USA, 2001
112. D. Cook, A. Buja, and J. Cabrera. Projection pursuit indices based on orthonormal function expansions. Journal of Computational and Graphical Statistics, 2:225-250, 1993
113. R. Cooley, B. Mobasher, and J. Srivastava. Data preparation for mining world wide web browsing. Journal of Knowledge Information Systems, 1(1):5-32, 1999
114. J. Corter and M. Gluck. Explaining basic categories: feature predictability and information. Psychological Bulletin, 111:291-303, 1992
115. T.M. Cover and J.A. Thomas. Elements of Information Theory, Wiley, New York, USA, 1991
116. M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, and S. Slattery. Learning to extract symbolic knowledge from the World Wide Web. In AAAI98, pages 509-516, 1998
117. D. Cristofor and D.A. Simovici. An information-theoretical approach to clustering categorical databases using genetic algorithms. In 2nd SIAM ICDM, Workshop on Clustering High Dimensional Data, Arlington, VA, USA, 2002
118. W.B. Croft. Clustering large files of documents using the single-link method. Journal of the American Society for Information Science, pages 189-195, November 1977
119. I. Csiszar. Information-type measures of difference of probability distributions and indirect observations. Studia Scientiarum Matematicarum Hungar, 2:299-318, 1967
120. D.R. Cutting, D.R. Karger, J.O. Pedersen, and J.W. Tukey. Scatter/gather: A cluster-based approach to browsing large document collection. In Proceedings of the 15th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 318-329, 1992
121. C. Daniel and F.C. Wood. Fitting Equations To Data: Computer Analysis of Multifactor Data, Wiley, New York, NY, USA, 1980
122. I. Davidson and A. Satyanarayana. Speeding up κ-means clustering by bootstrap averaging. In D. Boley et al., editors, Proceedings of the Workshop on Clustering Large Data Sets (held in conjunction with the Third IEEE International Conference on Data Mining), pages 15-25, 2003
123. W. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification, 1(7):7-24, 1984
124. S. Deerwester, S.T. Dumais, G.W. Furnas, T.K. Landauer, and R. Harshman. Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41(6):391-407, 1990
125. D. Defays. An efficient algorithm for a complete link method. The Computer Journal, 20:364-366, 1977
126. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39, 1977
127. J. Devore and R. Peck. Statistics: The Exploration and Analysis of Data. Duxbury, Belmont, CA, 1997
128. I.S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001), 2001. Also appears as UT CS Technical Report #TR 2001-05, March 1999
129. I.S. Dhillon, J. Fan, and Y. Guan. Efficient clustering of very large document collections. In R. Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, and R. Namburu, editors, Data Mining for Scientific and Engineering Applications, pages 357-381, Kluwer, Dordrecht, 2001
130. I.S. Dhillon and Y. Guan. Information-theoretic clustering of sparse cooccurrence data. In Proceedings of the 2002 IEEE International Conference on Data Mining, pages 517-520, 2003
131. I.S. Dhillon, Y. Guan, and J. Kogan. Iterative clustering of high dimensional text data augmented by local search. In Proceedings of the 2002 IEEE International Conference on Data Mining, pages 131-138, IEEE Computer Society Press, Los Alamitos, CA, 2002
132. I.S. Dhillon, Y. Guan, and J. Kogan. Refining clusters in high-dimensional text data. In I.S. Dhillon and J. Kogan, editors, Proceedings of the Workshop on Clustering High Dimensional Data and its Applications at the Second SIAM International Conference on Data Mining, pages 71-82, SIAM, 2002
133. I.S. Dhillon, J. Kogan, and C. Nicholas. Feature selection and document clustering. In M.W. Berry, editor, A Comprehensive Survey of Text Mining, pages 73-100, Springer, Berlin Heildelberg New York, 2003
134. I.S. Dhillon, S. Mallela, and R. Kumar. A divisive information-theoretic feature clustering algorithm for text classification. Journal of Machine Learning Research (JMLR): Special Issue on Variable and Feature Selection, 3:1265-1287, March 2003
135. I.S. Dhillon and D.S. Modha. A parallel data-clustering algorithm for distributed memory multiprocessors. In M.J. Zaki and C.T. Ho, editors, Large-Scale Parallel Data Mining, Lecture Notes in Artificial Intelligence, Volume 1759, pages 245-260, Springer, Berlin Heildelberg New York, 2000. Presented at the 1999 Large-Scale Parallel KDD Systems Workshop, SanDiego, CA.
136. 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
137. I.S. Dhillon, S. Mallela, and R. Kumar. Enhanced word clustering for hierarchical text classification. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002), pages 191-200, 2002
138. P. Diaconis and D. Freedman. Asymptotics of graphical projection pursuit. Annals of Statistics, 12:793-815, 1984
139. C. Ding, X. He, H. Zha, M. Gu, and H. Simon. A min-max cut algorithm for graph partitioning and data clustering. In Proceeding of the IEEE International Conference on Data Mining, 2001
140. B. Dom. An information-theoretic external cluster-validity measure. Technical report, 2001
141. P. Domingos and G. Hulten. A general method for scaling up machine learning algorithms and its application to clustering. In Proceedings of the 18th International Converence on Machine Learning, pages 106-113, Morgan Kaufmann, San Fransisco, USA, 2001
142. R.C. Dubes. Cluster analysis and related issues. In C.H. Chen, L.F. Pau, and P.S. Wang, editors, Handbook of Pattern Recognition and Computer Vision, pages 3-32, World Scientific, River Edge, NJ, USA, 1993
143. R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis, Wiley, New York, 1973
144. R.O. Duda, P.E. Hart, and D.G. Stork. Pattern Classification, Wiley, New York, 2000
145. S. Dudoit and J. Fridlyand. A prediction-based resampling method for estimating the number of clusters in a dataset. Genome Biology., 3(7), 2002
146. W. DuMouchel, C. Volinsky, T. Johnson, C. Cortes, and D. Pregibon. Squashing flat files flatter. In Proceedings of the 5th ACM SIGKDD, pages 6-15, San Diego, CA, USA, 1999
147. L. Engleman and J. Hartigan. Percentage points of a test for clusters. Journal of the American Statistical Association, 64:1647-1648, 1969
148. S. Epter, M. Krishnamoorthy, and M. Zaki. Clusterability detection and cluster initialization. In I.S. Dhillon and J. Kogan, editors, Proceedings of the Workshop on Clustering High Dimensional Data and its Applications at the 2nd SIAM International Conference on Data Mining, pages 47-58, SIAM, 2002
149. L. Ertoz, M. Steinbach, and V. Kumar. A new shared nearest neighbor clustering algorithm and its applications. In Workshop on Clustering High Dimensional Data and its Applications at 2nd SIAM International Conference on Data Mining, 2002
150. L. Ertoz, M. Steinbach, and V. Kumar. Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. Technical report, 2002
151. M. Ester, A. Frommelt, H.-P. Kriegel, and J. Sander. Spatial data mining: database primitives, algorithms and efficient dbms support. Data Mining and Knowledge Discovery, 4(2-3):193-216, 2000
152. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd ACM SIGKDD, pages 226-231, Portland, OR, USA, 1996
153. M. Ester, H.-P. Kriegel, and X. Xu. A database interface for clustering in large spatial databases. In Proceedings of the 1st ACM SIGKDD, pages 94-99, Montreal, Canada, 1995
154. V. Estivill-Castro and I. Lee. AMOEBA: Hierarchical clustering based on spatial proximity using delaunay diagram. In Proceedings of the 9th International Symposium on Spatial Data Handling, Beijing, China, 2000
155. B. Everitt. Cluster Analysis (3rd ed.), Edward Arnold, London, UK, 1993
156. C. Faloutsos and K. Lin. Fastmap: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. In Proceedings of the ACM SIGMOD International Conference on Management of Data, San Jose, CA, pages 163-174, ACM, New York, 1995
157. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proceedings of the ACM SIGMOD Conference, pages 419-429, Minneapolis, MN, 1994
158. C. Faloutsos and K.-I. Lin. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. SIGMOD Record: Proceedings of the ACM SIGMOD International Conference on Management of Data, 24(2):163-174, 22-25 May 1995
159. D. Fasulo. An analysis of recent work on clustering algorithms. Technical Report UW-CSE01 -03-02, University of Washington, 1999
160. W. Feller. An Introduction to Probability Theory and Its Applications, Volume 1, Wiley, New York, 1968
161. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czecheoslovak Mathematical Journal, 25(100):619-633, 1975
162. D. Fisher. Cobweb: knowledge acquisition via conceptual clustering. Machine Learning, 2:139-172, 1987
163. D. Fisher. Improving inference through conceptual clustering. In National Conference on Artificial Intelligence, pages 461-465, 1987
164. D.H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2:139-172, 1987
165. D.H. Fisher. Iterative optimization and simplification of hierarchical clustering. Journal of Artificial Intelligence Research, 4:147-179, 1996
166. E. Forgy. Cluster analysis of multivariate data: efficiency vs. interpretability of classifications. Biometrics, 21(3):768, 1965
167. S. Forrest, S.A. Hofmeyr, and A. Somayaji. Computer immunology. Communications of the ACM, 40:88-96, 1997
168. A. Foss, W. Wang, and O. Zaane. A non-parametric approach to web log analysis. In 1st SIAM ICDM, Workshop on Web Mining, pages 41-50, Chicago, IL, USA, 2001
169. E.W. Fowlkes and C.L. Mallows. A method for comparing two hierarchical clusterings. Journal of American Statistical Association, 78:553-584, 1983
170. W. Frakes. Stemming algorithms. In W. Frakes and R. Baeza-Yates, editors, Information Retrieval: Data Structures and Algorithms, pages 131-160, Prentice Hall, New Jersey, 1992
171. C. Fraley and A. Raftery. How many clusters? Which clustering method? Answers via model-based cluster analysis. The Computer Journal, 41(8):578-588, 1998
172. C. Fraley and A. Raftery. MCLUST: Software for model-based cluster and discriminant analysis. Technical Report 342, Department of Statistics, University of Washington, 1999
173. C. Fraley and A.E. Raftery. How many clusters? Which clustering method? Answers via model-based cluster analysis. The Computer Journal. http://citeseer.nj.nec.com/fraley98how.htm, 1998
174. C. Fraley. Algorithms for model-based Gaussian hierarchical clustering. SIAM Journal on Scientific Computing, 20(1):270-281, 1999
175. J.H. Friedman. Exploratory projection pursuit. Journal of the American Statistical Association, 82(397):249-266, 1987
176. J.H. Friedman. An overview of predictive learning and function approximation. In V. Cherkassky, J.H. Friedman, and H. Wechsler, editors, From Statistics to Neural Networks, Proceedings of the NATO/ASI Workshop, pages 1-61, Springer, Berlin Heildelberg New York, 1994
177. J.H. Friedman. On bias, variance, 0/1-loss, and the curse-of- dimensionality. Data Mining and Knowledge Discovery, 1:55-77, 1997
178. J.H. Friedman and J. W. Tukey. A projection pursuit algorithm for exploratory data analysis. IEEE Transactions on Computers, C-23(9):881-890, 1974
179. J. Frilyand and S. Dudoit. Applications of resampling methods to estimate the number of clusters and to improve the accuracy of a clustering method. Statistics Berkeley Technical Report. No 600, 2001
180. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic, New York, 1990
181. Ganti, Gehrke, and Ramakrishnan. CACTUS-clustering categorical data using summaries. In Proceedings of the 5th ACM SIGKDD, pages 73-83, San Diego, CA, USA, 1999
182. V. Ganti, R. Ramakrishnan, J. Gehrke, A. Powell, and J. French. Clustering large datasets in arbitrary metric spaces. In Proceedings of the 15th ICDE, pages 502-511, Sydney, Australia, 1999
183. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979
184. J. Gennari, P. Langley, and D. Fisher. Models of incremental concept formation. Artificial Intelligence, 40:11-61, 1989
185. A. Gersho and R.M. Gray. Vector quantization and signal compression. Kluwer, Dordrecht, 1992
186. A.K. Ghosh, A. Schwartzbard, and M. Schatz. Learning program behavior profiles for intrusion detection. In Proceedings of the SANS Conference and Workshop on Intrusion Detection and Response, San Francisco, CA, USA, 1999
187. J. Ghosh. Scalable clustering. In N. Ye, editor, The Handbook of Data Mining, pages 247-277, Erlbaum, Mahawah, NJ, 2003
188. D. Gibson, J. Kleinberg, and P. Raghavan. Clustering categorical data: an approach based on dynamic systems. In Proceedings of the 24th International Conference on Very Large Databases, pages 311-323, New York, NY, USA, 1998
189. J.R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in MATLAB: design and implementation. Technical Report CSL 91-4, Xerox Palo Alto Research Center, 1991
190. J.R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in MATLAB:
191. J.R. Gilbert and S.-H. Teng. MATLAB mesh partitioning and graph separator toolbox, February 2002. ftp://parcftp.xerox.com/pub/gilbert/meshpartdist.zip
192. J.T. Giles, L. Wo, and M. Berry. GTP (General Text Parser) software for text mining. Statistical Data Mining and Knowledge Discovery, pages 455-471, 2003
193. M.A. Gluck and J.E. Corter. Information, uncertainty, and the utility of categories. In Proceedings of the 7th Annual Conference of the Cognitive Science Society, pages 283-287, Irvine, CA, 1985, Erlbaum, Mahawah, NJ
194. N. Goharian, A. Chowdhury, D. Grossman, and T. El-Ghazawi. Efficiency enhancements for information retrieval using sparse matrix approach. In Proceedings of 2000 Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, June 2000
195. N. Goharian, T. El-Ghazawi, and D. Grossman. Enterprise text processing: a sparse matrix approach. In Proceedings of the IEEE International Conference on Information Techniques on Coding & Computing (ITCC 2001), Las Vegas, 2001
196. S. Goil, H. Nagesh, and A. Choudhary. MAFIA: efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010, Northwestern University, 1999
197. D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989
198. G.H. Golub and C.F. Van Loan. Matrix Computations, 2nd edition, The Johns Hopkins University Press, 1989
199. T.R. Golub, D.K. Slonim, P. Tamayo, C. Huard, M. Gaasenbeek, J.P. Mesirov, H. Coller, M.L. Loh, J.R. Downing, M.A. Caligiuri, C.D. Bloomfield, and E.S. Lander. Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science, 286:531-537, 1999
200. T.F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985
201. G.J. Gordon et al. Translation of microarray data into clinically relevant cancer diagnostic tests using gene expression ratios in lung cancer and mesothelioma. Cancer Research, 62:4963-4967, 2002
202. E. Gose, R. Johnsonbaugh, and S. Jost. Pattern Recognition and Image Analysis, Prentice Hall, Englewood Cliffs, NJ, 1996
203. G. Govaert. Simultaneous clustering of rows and columns. Control and Cybernetics, 24:437-458, 1995
204. K.C. Gowda and G. Krishna. Agglomerative clustering using the concept of mutual nearest neighborhood. Pattern Recognition, 10:105-112, 1978
205. L. Grady and E.L. Schwartz. The graph analysis toolbox: image processing on arbitrary graphs, August 2003. http://eslab.bu.edu/software/graphanalysis/ graphanalysis.html
206. M. Gu, H. Zha, C. Ding, X. He, and H. Simon. Spectral relaxation models and structure analysis for κ-way graph clustering and bi-clustering. Technical Report CSE-01-007, Pennsylvania State University, 2001
207. S. Guha, R. Rastogi, and K. Shim. CURE: a clustering algorithm for large databases. ACM SIGMOD International Conference on Management of Data, pages 73-84, 1998
208. S. Guha, R. Rastogi, and K. Shim. Rock: a robust clustering algorithm for categorical attributes. In Proceedings of the 15th International Conference on Data Engineering, 1999
209. S. Guha, R. Rastogi, and K. Shim. CURE: an efficient clustering algorithm for large databases. In Proceedings of 1998 ACM-SIGMOD International Conference on Management of Data, pages 73-84, 1998
210. V. Guralnik and G. Karypis. A scalable algorithm for clustering sequential data. In IEEE ICDM 2001, Silicon Valley, CA, USA, 2001
211. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference, pages 47-57, Boston, MA, USA, 1984
212. L. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on CAD, 11:1074-1085, 1992
213. L.O. Hall, B. Ozyurt, and J.C. Bezdek. Clustering with a genetically optimized approach. IEEE Transactions on Evolutionary Computation, 3(2):103-112, 1999
214. P. Hall. Polynomial projection pursuit. Annals of Statististics, 17:589-605, 1989
215. E.H. Han, G. Karypis, V. Kumar, and B. Mobasher. Clustering based on association rule hypergraphs. In SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (SIGMOD-DMKD'97), 1997
216. E.H. Han, D. Boley, M. Gini, R. Gross, K. Hastings, G. Karypis, V. Kumar, B. Mobasher, and J. Moore. WebACE: a web agent for document categorization and exploartion. In Proceedings of the 2nd International Conference on Autonomous Agents, May 1998
217. J. Han and M. Kamber. Data Mining: Concepts and Techniques, Morgan Kaufmann, San Fransisco, 2001
218. J. Han, M. Kamber, and A.K.H. Tung. Spatial clustering methods in data mining: a survey. In H. Miller and J. Han, editors, Geographic Data Mining and Knowledge Discovery, Taylor and Francis, London, 2001
219. P. Hansen and N. Mladenovic J-Means: a new local search heuristic for minimum sum of squares clustering. Pattern Recognition, 34:405-413, 2001
220. G. Hardy, J.E. Littlewood, and G. Polya. Inequalities, Cambridge University Press, Cambridge, 1934
221. D. Harel and Y. Koren. Clustering spatial data using random walks. In Proceedings of the 7th ACM SIGKDD, pages 281-286, San Francisco, CA, USA, 2001
222. J. Hartigan. Statistical theory in clustering. Journal of Classification, 2:63-76, 1985
223. J. Hartigan and M. Wong. Algorithm as136: a κ-means clustering algorithm. Applied Statistics, 28:100-108, 1979
224. J.A. Hartigan. Clustering Algorithms, Wiley, New York, 1975
225. M.A. Hearst and J.O. Pedersen. Reexamining the cluster hypothesis: Scatter/gather on retrieval results. In ACM SIGIR, pages 76-84, 1996
226. J. Heer and E. Chi. Identification of web user traffic composition using multimodal clustering and information scent. In 1st SIAM ICDM, Workshop on Web Mining, pages 51-58, Chicago, IL, USA, 2001
227. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific Computing, 16(2):452-469, 1995
228. W. Hersh, C. Buckley, T.J. Leone, and D. Hickam. OHSUMED: an interactive retrieval evaluation and new large test collection for research. In SIGIR-94, pages 192-201, 1994
229. A. Hinneburg and D. Keim. An efficient approach to clustering large multimedia databases with noise. In Proceedings of the 4th ACM SIGKDD, pages 58-65, New York, NY, USA, 1998
230. A. Hinneburg and D. Keim. Optimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering. In Proceedings of the 25th Conference on VLDB, pages 506-517, Edinburgh, Scotland, USA, 1999
231. D.S. Hochbaum and D.B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. Journal of ACM, 33(3):533-550, 1986
232. M. Hochstenbach. A Jacobi-Davidson type SVD method. SIAM Journal of Scientific Computing, 23(2):606-628, 2001
233. K.J. Holzinger and H.H. Harman. Factor Analysis. University of Chicago Press, Chicago, 1941
234. Z. Huang. Extensions to the κ-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2(3):283-304, 1998
235. P.J. Huber. Projection pursuit. Annals of Statistics, 13:435-475, 1985
236. G. Hulten, L. Spencer, and P. Domingos. Mining time-changing data streams. In Proceedings of the 7th ACM SIGKDD, pages 97-106, San Francisco, CA, USA, 2001
237. A. Hyvärinen. New approximations of differential entropy for independent component analysis and projection pursuit. In Advances in Neural Information Processing Systems, 10:273-279, 1998
238. E.J. Im and K. Yelick. Optimization of sparse matrix kernels for data mining. University of California, Berkeley, unpublished manuscript, 2001
239. N. Intrator and L. Cooper. Objective function formulation of the bcm theory of visual cortical plasticity. Neural Networks, 5:3-17, 1992
240. T.S. Jaakkola and D. Haussler. Exploiting generative models in discriminative classifiers. In M.S. Kearns, S.A. Solla, and D.D. Cohn, editors, Advances in Neural Information Processing Systems-11, volume 11, pages 487-493, MIT Press, Cambridge, MA, 1999
241. J.E. Jackson. A User's Guide To Principal Components, Wiley, New York, 1991
242. A.K. Jain and R.C. Dubes. Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, NJ, 1988
243. A.K. Jain and P.J. Flynn. Image segmentation using clustering. In Advances in Image Understanding: A Festschrift for Azriel Rosenfeld, pages 65-83, IEEE Press, USA, 1966
244. A.K. Jain and J. Mao. Artificial neural networks: a tutorial. IEEE Computer, 29(3):31-44, 1996
245. A.K. Jain, M.N. Murty, and Flynn P.J. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999
246. N. Jardine and C.J. van Rijsbergen. The use of hierarchic clustering in information retrieval. Information Storage and Retrieval, 7:217-240, 1971
247. R.A. Jarvis and E.A. Patrick. Clustering using a similarity measure based on shared nearest neighbors. IEEE Transactions on Computers, C-22(11), 1973
248. T. Jebara and T. Jaakkola. Feature selection and dualities in maximum entropy discrimination. In Proceedings of the 16th UIA Conference, Stanford, CA, USA, 2000
249. T. Joachims. Text categorization with support vector machines: learning with many relevant features. In Machine Learning: ECML-98, 10th European Conference on Machine Learning, pages 137-142, 1998
250. N.L. Johnson, S. Kotz, and N. Balakrishnan. Continuous Univariate Distributions, volume 2, Wiley, New York, 1995
251. I.T. Jolliffe. Principal Component Analysis. Springer, Berlin Heildelberg New York, 1986
252. M. Jones and R. Sibson. What is projection pursuit? Journal of the Royal Statistical Society, Series A, 150:1-36, 1987
253. A. Kalton, P. Langley, K. Wagstaff, and J. Yoo. Generalized clustering, supervised learning, and data assignment. In Proceedings of the 7th ACM SIGKDD, pages 299-304, San Francisco, CA, USA, 2001
254. E. Kandogan. Visualizing multi-dimensional clusters, trends, and outliers using star coordinates. In Proceedings of the 7th ACM SIGKDD, pages 107-116, San Francisco, CA, USA, 2001
255. H. Kargupta, W. Huang, K. Sivakumar, and E.L. Johnson. Distributed clustering using collective principal component analysis. Knowledge and Information Systems, 3(4):422-448, 2001
256. R.M. Karp. Reducibility among combinatorial problems, editors Miller, R.E. and Thatcher, J.W. In Complexity of Computer Computations, pages 85-103. Plenum, New York, 1972
257. G. Karypis. CLUTO a clustering toolkit. Technical Report 02-017, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, August 2002
258. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: application in vlsi domain. In Proceedings ACM/IEEE Design Automation Conference, USA, 1997
259. G. Karypis and E.-H. Han. Concept indexing: a fast dimensionality reduction algorithm with applications to document retrieval and categorization. Technical Report TR-00-016, Department of Computer Science, University of Minnesota, Minneapolis, MN, USA, 2000
260. G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: hierarchical clustering using dynamic modeling. IEEE Computer, 32(8):68-75, 1999
261. G. Karypis, E.-H. Han, and V. Kumar. Multilevel refinement for hierarchical clustering. Technical Report 99-020, 1999
262. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal of Scientific Computation, 20(1):359-392, 1999
263. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: applications in VLSI domain. In Proceedings of the Design and Automation Conference, pages 526-529, 1997
264. R. Kass and A. Raftery. Bayes factors. Journal of American Statistical Association, 90:773-795, 1995
265. L. Kaufman and P.J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York, 1990
266. M. Kearns, Y. Mansour, and A. Ng. An informationtheoretic analysis of hard and soft assignment methods for clustering. In Proceedings of the 13th UAI, pages 282-293, 1997
267. E. Keogh, K. Chakrabarti, S. Mehrotra, and M. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. In Proceedings of the ACM SIGMOD Conference, Santa Barbara, CA, USA, 2001
268. E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems, 3(3), 2001
269. E. Keogh, S. Chu, and M. Pazzani. Ensemble-index: a new approach to indexing large databases. In Proceedings of the 7th ACM SIGKDD, pages 117-125, San Francisco, CA, USA, 2001
270. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970
271. B. King. Step-wise clustering procedures. Journal of the American Statistical Association, 69:86-101, 1967
272. J. Kleinberg and A. Tomkins. Applications of linear algebra in information retrieval and hypertext analysis. In Proceedings of 18th ACM SIGMODSIGACT-SIGART Symposium on Principles of Database System, pages 185-193, ACM Press, New York, 1999
273. E. Knorr and R. Ng. Algorithms for mining distance-based outliers in large datasets. In Proceedings of the 24h Conference on VLDB, pages 392-403, New York, NY, USA, 1998
274. E. Knorr, R. Ng, and R.H. Zamar. Robust space transformations for distancebased operations. In Proceedings of the 7th ACM SIGKDD, pages 126-135, San Francisco, CA, USA, 2001
275. M. Kobayashi, M. Aono, H. Takeuchi, and H. Samukawa. Matrix computations for information retrieval and major and minor outlier cluster detection. Journal of Computation and Applied Mathematics, 149(1):119-129, 2002
276. J. Kogan. Clustering large unstructured document sets. In M.W. Berry, editor, Computational Information Retrieval, pages 107-117, SIAM, 2000
277. J. Kogan. Means clustering for text data. In M.W. Berry, editor, Proceedings of the Workshop on Text Mining at the First SIAM International Conference on Data Mining, pages 47-54, 2001
278. J. Kogan, C. Nicholas, and V. Volkovich. Text mining with hybrid clustering schemes. In M.W. Berry and W.M. Pottenger, editors, Proceedings of the Workshop on Text Mining (held in conjunction with the Third SIAM International Conference on Data Mining), pages 5-16, 2003
279. J. Kogan, C. Nicholas, and V. Volkovich. Text mining with information-theoretical clustering. Computing in Science & Engineering, pages 52-59, November/December 2003
280. J. Kogan, M. Teboulle, and C. Nicholas. The entropic geometric means algorithm: an approach for building small clusters for large text datasets. In D. Boley et al., editor, Proceedings of the Workshop on Clustering Large Data Sets (held in conjunction with the Third IEEE International Conference on Data Mining), pages 63-71, 2003
281. J. Kogan, M. Teboulle, and C. Nicholas. Optimization approach to generating families of κ-means like algorithms. In I. Dhillon and J. Kogan, editors, Proceedings of the Workshop on Clustering High Dimensional Data and its Applications (held in conjunction with the Third SIAM International Conference on Data Mining), 2003
282. J. Kogan, M. Teboulle, and C. Nicholas. Data driven similarity measures for κ-means like clustering algorithms. Information Retrieval, 8:331-349, 2005
283. T. Kohonen. The self-organizing map. Proceedings of the IEEE, 9:1464-1479, 1990
284. T. Kohonen. Self-Organizing Maps. Springer, Berlin Heidelberg New York, 1995
285. T. Kohonen, S. Kaski, K. Lagus, J. Salojrvi, J. Honkela, V. Paatero, and A. Saarela. Self organization of a massive document collection. IEEE Transactions on Neural Networks, 11(3):574-585, 2000
286. E. Kokiopoulou and Y. Saad. Polynomial filtering in latent semantic indexing for information retrieval. In Proceedings of the 27th ACM SIGIR, pages 104-111, ACM, New York, 2004
287. E. Kolatch. Clustering algorithms for spatial databases: a survey, 2001
288. T. Kolda and B. Hendrickson. Partitioning sparse rectangular and structurally nonsymmetric matrices for parallel computation. SIAM Journal on Scientific Computing, 21(6):2048-2072, 2000
289. T. Kolda and D.O'Leary. A semidiscrete matrix decomposition for latent semantic indexing information retrieval. ACM Transactions on Information Systems, 16(4):322-346, 1998
290. T.G. Kolda. Limited-Memory Matrix Methods with Applications. PhD thesis, The Applied Mathematics Program, University of Maryland, College Park, MD, 1997
291. D. Koller and M. Sahami. Toward optimal feature selection. In Proceedings of the 13th ICML, pages 284-292, Bari, Italy, 1996
292. V.S. Koroluck, N.I. Portenko, A.V. Skorochod, and A.F. Turbin. The Handbook on Probability Theory and Mathematical Statistics. Science, Kiev, 1978
293. H.-P. Kriegel, B. Seeger, R. Schneider, and N. Beckmann. The Rß -tree: an efficient access method for geographic information systems. In Proceedings International Conference on Geographic Information Systems, Ottawa, Canada, 1990
294. D. Kroese, R. Rubinstein, and T. Taimre. Application of the cross-entropy method to clustering and vector quantization. Submitted, 2004
295. J.B. Kruskal. Toward a practical method which helps uncover the structure of a set of observations by finding the line tranformation which optimizes a new "index of condensation. Statistical Computation, R.C. Milton and J.A. Nelder editors, pages 427-440, 1969
296. W. Krzanowski and Y. Lai. A criterion for determining the number of groups in a dataset using sum of squares clustering. Biometrics, 44:23-34, 1985
297. H. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83-97, 1955
298. S. Kullback and R.A. Leibler. On information and sufficiency. Journal of Mathematical Analysis and Applications, 22:79-86, 1951
299. S. Kumar and J. Ghosh. GAMLS: a generalized framework for associative modular learning systems. In Proceedings of the Applications and Science of Computational Intelligence II, pages 24-34, Orlando, FL, 1999
300. T. Kurita. An efficient agglomerative clustering algorithm using a heap. Pattern Recognition, 24(3):205-209, 1991
301. G. Lance and W. Williams. A general theory of classification sorting strategies. Computer Journal, 9:373-386, 1967
302. K. Lang. Newsweeder: learning to filter netnews. In International Conference on Machine Learning, pages 331-339, 1995
303. B. Larsen and C. Aone. Fast and effective text mining using linear-time document clustering. In Proceedings of the 5th ACM SIGKDD, pages 16-22, San Diego, CA, USA, 1999
304. R.M. Larsen. PROPACK: a software package for the symmetric eigenvalue problem and singular value problems on Lanczos and Lanczos bidiagonalization with partial reorthogonalization. http://soi.stanford.edu/rmunk/PROPACK/
305. C.Y. Lee and E.K. Antonsson. Dynamic partitional clustering using evolution strategies. In Proceedings of the 3rd Asia-Pacific Conference on Simulated Evolution and Learning, Nagoya, Japan, 2000
306. E. Lee, D. Cook, S. Klinke, and T. Lumley. Projection pursuit for exploratory supervised classification. Technical Report 04-07, Iowa State University, Humboldt-University of Berlin, University of Washington, February 2004
307. W. Lee and S. Stolfo. Data mining approaches for intrusion detection. In Proceedings of the 7th USENIX Security Symposium, San Antonio, TX, USA, 1998
308. R. Lehoucq, D.C. Sorensen, and C. Yang. Arpack User's Guide: Solution of Large-Scale Eigenvalue Problems With Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia, 1998
309. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999
310. T.A. Letsche and M.W. Berry. Large-scale information retrieval with latent semantic indexing. Information Sciences, 100(1-4):105-137, 1997
311. E. Levine and E. Domany. Resampling method for unsupervised estimation of cluster validity. Neural Computation, 13:2573-2593, 2001
312. D.D. Lewis. Feature selection and feature extraction for text categorization. In Proceedings of Speech and Natural Language Workshop, pages 212-217, Morgan Kaufmann San Mateo, CA, February 1992
313. D. D. Lewis. Reuters-21578 text categorization test collection distribution 1.0. http://www.research.att.com/~lewis, 1999
314. L. Liebovitch and T. Toth. A fast algorithm to determine fractal dimensions by box counting. Physics Letters, 141A(8), 1989
315. F. Liese and I. Vajda. Convex Statistical Distances. Teubner, Leipzig, 1987
316. D. Lin. An information-theoretic definition of similarity. In Proceedings of the 15th ICML, pages 296-304, Madison, WI, USA, 1998
317. D. Littau. Using a Low-Memory Factored Representation to Data Mine Large Data Sets. PhD dissertation, Department of Computer Science, University of Minnesota, 2005
318. D. Littau and D. Boley. Using low-memory representations to cluster very large data sets. In D. Barbará and C. Kamath, editors, Proceedings of the 3rd SIAM International Conference on Data Mining, pages 341-345, 2003
319. D. Littau and D. Boley. Streaming data reduction using low-memory factored representations. Information Sciences, Special Issue on Some Current Issues of Streaming Data Mining, to appear
320. B. Liu, Y. Xia, and P.S. Yu. Clustering through decision tree construction. SIGMOD-00, 2000
321. H. Liu and R. Setiono. A probabilistic approach to feature selection - a filter solution. In Proceedings of the 13th ICML, pages 319-327, Bari, Italy, 1996
322. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of ACM, 41(5):960-981, 1994
323. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pages 281-296, 1967
324. H. Manilla and D. Rusakov. Decomposition of event sequences into independent components. In Proceedings of the 1st SIAM ICDM, Chicago, IL, USA, 2001
325. J. Mao and A.K. Jain. A self-organizing network for hyperellipsoidal clustering (HEC). IEEE Transactions on Neural Networks, 7(1):16-29, 1996
326. K.V. Mardia, J.T. Kent, and J.M. Bibby. Multivariate Analysis. Academic, San Diego, 1979
327. J.L. Marroquin and F. Girosi. Some extensions of the κ-means algorithm for image segmentation and pattern classification. Technical Report A.I. Memo 1390, MIT Press, Cambridge, MA, USA, 1993
328. D. Massart and L. Kaufman. The Interpretation of Analytical Chemical Data by the Use of Cluster Analysis. Wiley, New York, NY, 1983
329. A. McCallum, K. Nigam, and L.H. Ungar. Efficient clustering of highdimensional data sets with application to reference matching. In Proceedings of the 6th ACM SIGKDD, pages 169-178, Boston, MA, USA, 2000
330. A.K. McCallum. Bow: a toolkit for statistical language modeling, text retrieval, classification and clustering. http://www.cs.cmu.edu/mccallum/bow, 1996
331. G. McLachlan and K. Basford. Mixture Models: Inference and Applications to Clustering. Dekker, New York, NY, 1988
332. G.J. McLachlan and T. Krishnan. The EM Algorithm and Extentions. Wiley, New York, 1996
333. M. Meila and D. Heckerman. An experimental comparison of model-based clustering methods. Machine Learning, 42:9-29, 2001
334. M. Meila. Comparing clusterings. Technical Report 417, University of Washington, Seattle, WA, 2002
335. R.S. Michalski and R. Stepp. Learning from observations: conceptual clustering. In Machine Learning: An Artificial Intelligence Approach. Morgan Kaufmann, San Mateo, CA, 1983
336. G. Milligan and M. Cooper. An examination of procedures for determining the number of clusters in a data set. Psychometrika, 50:159-179, 1985
337. B. Mirkin. Mathematical Classification and Clustering. Kluwer, Dordrecht, 1996
338. B. Mirkin. Reinterpreting the category utility function. Machine Learning, 42(2):219-228, November 2001
339. N. Mishra and R. Motwani, editors, Special issue: Theoretical advances in data clustering. Machine Learning, 56, 2004
340. T.M. Mitchell. Machine Learning. McGraw-Hill, New York, 1997
341. D.S. Modha and W. Scott Spangler. Feature weighting in κ-means clustering. Machine Learning, 52(3):217-237, 2003
342. R.J. Mooney and L. Roy. Content-based book recommending using learning for text categorization. In Proceedings of the SIGIR-99 Workshop on Recommender Systems: Algorithms and Evaluation, pages 195-204, 1999
343. A. Moore. Very fast em-based mixture model clustering using multiresolution kd-trees. Advances in Neural Information Processing Systems, 11, 1999
344. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995
345. F. Murtagh. A survey of recent advances in hierarchical clustering algorithms. Computer Journal, 26(4):354-359, 1983
346. F. Murtagh. Multidimensional Clustering Algorithms. Physica-Verlag, Vienna, Austria, 1985
347. H. Nagesh, S. Goil, and A. Choudhary. Adaptive grids for clustering massive data sets. In Proceedings of the 1st SIAM ICDM, Chicago, IL, USA, 2001
348. A.Y. Ng, M.I. Jordan, and Y. Weiss. On spectral clustering: analysis and an algorithm. In Proceedings Neural Information Processing Systems (NIPS 2001), 2001
349. R. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), pages 144-155, Santiago, Chile, 1994
350. K. Nigam, A. McCallum, S. Thrun, and T. Mitchell. Learning to classify text from labeled and unlabeled documents. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 792-799, AAAI Press, USA, 1998
351. S. Nishisato. Analysis of Categorical Data: Dual Scaling and Its Applications. University of Toronto, Toronto, Canada, 1980
352. J. Oliver, R. Baxter, and C. Wallace. Unsupervised learning using mml. In Proceedings of the 13th ICML, Bari, Italy, 1996
353. C. Olson. Parallel algorithms for hierarchical clustering. Parallel Computing, 21:1313-1325, 1995
354. S. Oyanagi, K. Kubota, and A. Nakase. Application of matrix clustering to web log analysis and access prediction. In Proceedings of the 7th ACM SIGKDD, WEBKDD Workshop, San Francisco, CA, USA, 2001
355. B. Padmanabhan and A. Tuzhilin. Unexpectedness as a measure of interestingness in knowledge discovery. Decision Support Systems Journal, 27(3):303-318, 1999
356. B. Padmanabhan and A. Tuzhilin. Small is beautiful: discovering the minimal set of unexpected patterns. In Proceedings of the 6th ACM SIGKDD, pages 54-63, Boston, MA, USA, 2000
357. D. Pelleg and A. Moore. Accelerating exact κ-means algorithms with geometric reasoning. In Proceedings of the 5th ACM SIGKDD, pages 277-281, San Diego, CA, USA, 1999
358. D. Pelleg and A. Moore. X-means: extending κ-means with efficient estimation of the number of clusters. In Proceedings 17th ICML, Stanford University, USA, 2000
359. C. Perlich, F. Provost, and J. Simonoff. Tree induction vs. logistic regression: a learning-curve analysis. Journal of Machine Learning Research (JMLR), 4:211-255, 2003
360. G. Piatetsky-Shapiro and C.J. Matheus. The interestingness of deviations. In Proceedings of the AAAI-94 Workshop on Knowledge Discovery in Databases, 1994
361. M.F. Porter. The Porter stemming algorithm. www.tartarus.org /martin/PorterStemmer
362. M.F. Porter. An algorithm for suffix stripping. Program, 14:130-137, 1980
363. J. Puzicha, T. Hofmann, and J.M. Buhmann. A theory of proximity based clustering: structure detection by optimization. PATREC: Pattern Recognition, 33:617-634, 2000
364. J. Quesada. Creating your own LSA space. In T. Landauer, D. McNamara, S. Dennis, and W. Kintsch, editors, Latent Semantic Anlysis: A Road to Meaning. Associates Erlbaum, Mahawah, NJ, In press
365. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. Sigmoid Record, 29(2):427-438, 2000
366. W.M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66:846-850, 1971
367. E. Rasmussen. Clustering algorithms. In W. Frakes and R. Baeza-Yates, editors, Information Retrieval: Data Structures and Algorithms, pages 419-442. Prentice Hall, Englewood Cliffs, NJ, 1992
368. R. Rastogi and K. Shim. Scalable algorithms for mining large databases. In Jiawei Han, editor, KDD-99 Tutorial Notes. ACM, USA, 1999
369. P. Resnik. Using information content to evaluate semantic similarity in a taxonomy. In Proceedings of IJCAI-95, pages 448-453, Montreal, Canada, 1995
370. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978
371. J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Scientific, Singapore, 1989
372. R.T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
373. K. Rose, E. Gurewitz, and C.G. Fox. A deterministic annealing approach to clustering. Pattern Recognition Letters, 11(9):589-594, 1990
374. V. Roth, V. Lange, M. Braun, and J. Buhmann. A resampling approach to cluster validation. In COMPSTAT, http://www.cs.uni-bonn.De/~braunm, 2002
375. V. Roth, V. Lange, M. Braun, and J. Buhmann. Stability-based validation of clustering solutions. Neural Computation, 16(6):1299-1323, 2004
376. R.Y. Rubinstein. The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 2:127-190, 1999
377. G. Salton. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, Reading, MA, 1989
378. G. Salton. The SMART document retrieval project. In Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 357-358, 1991
379. G. Salton, J. Allan, and C. Buckley. Automatic structuring and retrieval of large text files. Communications of the ACM, 37(2):97-108, 1994
380. G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing & Management, 4(5):513-523, 1988
381. G. Salton and M.J. McGill. Introduction to Modern Retrieval. McGraw-Hill, New York, 1983
382. G. Salton, A. Wong, and C.S. Yang. A vector space model for automatic indexing. Communications of the ACM, 18(11):613-620, 1975
383. J. Sander, M. Ester, H.-P. Kriegel, and X. Xu. Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery, 2(2):169-194, 1998
384. I. Sarafis, A.M.S. Zalzala, and P.W. Trinder. A genetic rule-based data clustering toolkit. In Congress on Evolutionary Computation (CEC), Honolulu, USA, 2002
385. S. Savaresi and D. Boley. On performance of bisecting κ-means and pddp. In Proceedings of the 1st SIAM ICDM, Chicago, IL, USA, 2001
386. S.M. Savaresi, D.L. Boley, S. Bittanti, and G. Gazzaniga. Cluster selection in divisive clustering algorithms. In Proceedings of the 2nd SIAM ICDM, pages 299-314, Arlington, VA, USA, 2002
387. R. Schalkoff. Pattern Recognition. Statistical, Structural and Neural Approaches. Wiley, New York, NY, 1991
388. E. Schikuta. Grid-clustering: a fast hierarchical clustering method for very large data sets. In Proceedings 13th International Conference on Pattern Recognition Volume 2, pages 101-105, 1996
389. E. Schikuta and M. Erhart. The bang-clustering system: grid-based data analysis. In Proceeding of Advances in Intelligent Data Analysis, Reasoning about Data, 2nd International Symposium, pages 513-524, London, UK, 1997
390. G. Schwarz. Estimating the dimension of a model. The Annals of Statistics, 6:461-464, 1978
391. D.W. Scott. Multivariate Density Estimation. Wiley, New York, NY, 1992
392. B. Shai. A framework for statistical clustering with a constant time approximation algorithms for κ-median clustering. Proceedings of Conference on Learning Theory, formerly Workshop on Computational Learning Theory, COLT-04, to appear, 2004
393. R. Shamir and R. Sharan. Algorithmic approaches to clustering gene expression data. In T. Jiang, T. Smith, Y. Xu, and M.Q. Zhang, editors, Current Topics in Computational Molecular Biology, pages 269-300, MIT Press, Cambridge, MA, 2002
394. G. Sheikholeslami, S. Chatterjee, and A. Zhang. Wavecluster: a multi-resolution clustering approach for very large spatial databases. In Proceedings of the 24th Conference on VLDB, pages 428-439, New York, NY, 1998
395. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, August 2000
396. R. Sibson. SLINK: an optimally efficient algorithm for the single link cluster method. Computer Journal, 16:30-34, 1973
397. A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 8(6):970-974, 1996
398. A. Singhal, C. Buckley, M. Mitra, and G. Salton. Pivoted document length normalization. In ACM SIGIR, 1996
399. S. Sirmakessis, editor. Text Mining and its Applications (Results of the NEMIS Launch Conference), Springer, Berlin Heidelberg New York, 2004
400. N. Slonim and N. Tishby. Document clustering using word clusters via the Information Bottleneck Method. Proceedings SIGIR, pages 208-215, 2000
401. N. Slonim and N. Tishby. The power of word clusters for text classification. In 23rd European Colloquium on Information Retrieval Research (ECIR), Darmstadt, 2001
402. P. Smyth. Model selection for probabilistic clustering using cross-validated likelihood. Technical Report ICS Tech Report 98-09, Statistics and Computing, 1998
403. P. Smyth. Probabilistic model-based clustering of multivariate and sequential data. In Proceedings of the 7th International Workshop on AI and Statistics, pages 299-304, 1999
404. P.H. Sneath and R.R. Sokal. Numerical Taxonomy. Freeman, New York, 1973
405. H. Spath. Cluster Analysis Algorithms. Ellis Horwood, Chichester, England, 1980
406. C. Spearman. Footrule for measuring correlations. British Journal of Psychology, 2:89-108, July 1906
407. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In Proceedings of the 6th ACM SIGKDD, World Text Mining Conference, Boston, MA, USA, 2000
408. M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In KDD Workshop on Text Mining, 2000
409. A. Strehl and J. Ghosh. A scalable approach to balanced, high-dimensional clustering of market baskets. In Proceedings of 17th International Conference on High Performance Computing, pages 525-536, Bangalore, India, 2000
410. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research (JMLR), 3(Dec):583-617, 2002
411. A. Strehl and J. Ghosh. Value-based customer grouping from large retail datasets. In Proceedings of the SPIE Conference on Data Mining and Knowledge Discovery, Orlando, volume 4057, pages 33-42, SPIE, April 2000
412. A. Strehl and J. Ghosh. Relationship-based clustering and visualization for high-dimensional data mining. INFORMS Journal on Computing, 15(2):208-230, 2003
413. A. Strehl, J. Ghosh, and R. Mooney. Impact of similarity measures on webpage clustering. In Proceedings of 17th National Conference on AI: Workshop on AI for Web Search (AAAI 2000), pages 58-64, AAAI, USA, July 2000
414. C. Sugar and G. James. Finding the number of clusters in a data set: an information theoretic approach. Journal of the American Statistical Association, 98:750-763, 2003
415. M. Teboulle. Entropic proximal mappings with application to nonlinear programming. Mathematics of Operation Research, 17:670-690, 1992
416. M. Teboulle. On φ-divergence and its applications. In F.Y. Phillips and J. Rousseau, editors, Systems and Management Science by Extremal Methods - Research Honoring Abraham Charnes at Age 70, pages 255-273, Kluwer, Norwell, MA, 1992
417. M. Teboulle. Convergence of proximal-like algorithms. SIAM Journal of Optimization, 7:1069-1083, 1997
418. M. Teboulle and J. Kogan. Deterministic annealing and a κ-means type smoothing optimization algorithm for data clustering. In I. Dhillon, J. Ghosh, and J. Kogan, editors, Proceedings of the Workshop on Clustering High Dimensional Data and its Applications (held in conjunction with the Fifth SIAM International Conference on Data Mining), pages 13-22, SIAM, Philadelphia, PA, 2005
419. S. Thomopoulos, D. Bougoulias, and C.-D. Wann. Dignet: an unsupervisedlearning clustering algorithm for clustering and data fusion. IEEE Transactions on Aerospace and Electrical Systems, 31(1-2):1-38, 1995
420. R. Tibshirani, G. Walther, and T. Hastie. Estimating the number of clusters via the gap statistic. Journal of Royal Statistical Society B, 63(2):411-423, 2001
421. N. Tishby, F.C. Pereira, and W. Bialek. The information bottleneck method. In Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing, pages 368-377, 1999
422. W.S. Torgerson. Multidimensional scaling, I: Theory and method. Psychometrika, 17:401-419, 1952
423. TREC. Text REtrieval conference. http://trec.nist.gov, 1999
424. J.W. Tukey. Exploratory Data Analysis. Addison-Wesley, Reading, MA, 1977
425. A.K.H. Tung, J. Han, L.V.S. Lakshmanan, and R.T. Ng. Constraint-based clustering in large databases. In Proceedings of the 2001 International Conference on Database Theory (ICDT'01), 2001
426. A.K.H. Tung, J. Hou, and J. Han. Spatial clustering in the presence of obstacles. In Proceedings of the 17th ICDE, pages 359-367, Heidelberg, Germany, 2001
427. H. Turtle. Inference Networks for Document Retrieval. PhD thesis, University of Massachusetts, Amherst, 1990
428. S. van Dongen. A cluster algorithm for graphs. Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, The Netherlands, 2000
429. C.J. van Rijsbergen. Information Retrieval, second edition, Butterworths, London, 1979
430. V. Vapnik. The Nature of Statistical Learning Theory. Springer, Berlin Heidelberg New York, 1995
431. S. Vempala, R. Kannan, and A. Vetta. On clusterings - good, bad and spectral. In Proceedings of the 41st Symposium on the Foundation of Computer Science, FOCS, 2000
432. V. Volkovich, J. Kogan, and C. Nicholas. κ-means initialization by sampling large datasets. In I. Dhillon and J. Kogan, editors, Proceedings of the Workshop on Clustering High Dimensional Data and its Applications (held in conjunction with SDM 2004), pages 17-22, 2004
433. E.M. Voorhees. Implementing agglomerative hierarchical clustering algorithms for use in document retrieval. Information Processing and Management, 22(6):465-476, 1986
434. E.M. Voorhees. The cluster hypothesis revisited. In Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 95-104, 1985
435. C. Wallace and D. Dowe. Intrinsic classification by MML - the Snob program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, pages 37-44, Armidale, Australia, 1994
436. C. Wallace and P. Freeman. Estimation and inference by compact coding. Journal of the Royal Statistical Society, Series B, 49(3):240-265, 1987
437. W. Wang, J. Yang, and R. Muntz. STING: a statistical information grid approach to spatialdata mining. In Proceedings of the 23rd Conference on VLDB, pages 186-195, Athens, Greece, 1997
438. W. Wang, J. Yang, and R.R. Muntz. Pk-tree: a spatial index structure for high dimensional point data. In Proceedings of the 5th International Conference of Foundations of Data Organization, USA, 1998
439. W. Wang, J. Yang, and R.R. Muntz. Sting+: an approach to active spatial data mining. In Proceedings 15th ICDE, pages 116-125, Sydney, Australia, 1999
440. C.-D. Wann and S.A. Thomopoulos. A comparative study of self-organizing clustering algorithms Dignet and ART2. Neural Networks, 10(4):737-743, 1997
441. J.H. Ward. Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58:236-244, 1963
442. S.Watanabe. Knowing and Guessing - A Formal and Quantative Study. Wiley, New York, 1969
443. P. Willet. Recent trends in hierarchical document clustering: A criticial review. Information Processing and Management, 24(5):577-597, 1988
444. I.H. Witten, A. Moffat, and T.C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York, 1994
445. D.I. Witter and M.W. Berry. Downdating the latent semantic indexing model for conceptual information retrieval. The Computer Journal, 41(8):589-601, 1998
446. X. Xu, M. Ester, H.-P. Kriegel, and J. Sander. A distribution-based clustering algorithm for mining large spatial datasets. In Proceedings of the 14th ICDE, pages 324-331, Orlando, FL, USA, 1998
447. Y. Yang. An evaluation of statistical approaches to text categorization. Journal of Information Retrieval, 1(1/2):67-88, May 1999
448. Y. Yang and J.O. Pedersen. A comparative study on feature selection in text categorization. In Proceedings of the 14th International Conference on Machine Learning, pages 412-420, Morgan Kaufmann, San Fransisco, 1997
449. A. Yao. On constructing minimum spanning trees in κ-dimensional space and related problems. SIAM Journal on Computing, 11(4):721-736, 1982
450. C.T. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20(1):68-86, January 1971
451. O. Zamir, O. Etzioni, O. Madani, and R.M. Karp. Fast and intuitive clustering of web documents. In D. Heckerman, H. Mannila, D. Pregibon, and R. Uthurusamy, editors, Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD-97), page 287, AAAI Press, USA, 1997
452. D. Zeimpekis and E. Gallopoulos. PDDP(l): towards a flexible principal direction divisive partitioning clustering algorithm. In D. Boley em et al, editors, Proceedings of the Workshop on Clustering Large Data Sets (held in conjunction with the Third IEEE International Conference on Data Mining), pages 26-35, 2003
453. D. Zeimpekis and E. Gallopoulos. CLSI: a flexible approximation scheme from clustered term-document matrices. In Proceedings of the 5th SIAM International Conference on Data Mining, pages 631-635, Newport Beach, SIAM, CA, 2005
454. H. Zha, C. Ding, M. Gu, X. He, and H. Simon. Spectral relaxation for κ means clustering. In Neural Information Processing Systems, volume 14, pages 1057-1064, 2001
455. H. Zha, X. He, C. Ding, H. Simon, and M. Gu. Bipartite graph partitioning and data clustering. In CIKM, 2001
456. H. Zha and H.D. Simon. On updating problems in latent semantic indexing. SIAM Journal on Scientific Computing, 21(2):782-791, March 2000
457. B. Zhang. Generalized κ-harmonic means - dynamic weighting of data in unsupervised learning. In Proceedings of the 1st SIAM ICDM, Chicago, IL, USA, 2001
458. G. Zhang, B. Kleyner and M. Hsu. A local search approach to κ-clustering. Technical Report HPL-1999-119, 1999
459. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, Montreal, Canada, 1996
460. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: a new data clustering algorithm and its applications. Journal of Data Mining and Knowledge Discovery, 1(2):141-182, 1997
461. Y. Zhang, A.W. Fu, C.H. Cai, and P.-A. Heng. Clustering categorical data. In Proceedings of the 16th ICDE, page 305, San Diego, CA, USA, 2000
462. Y. Zhao and G. Karypis. Criterion functions for document clustering: experiments and analysis. Technical Report CS Department 01-40, University of Minnesota, 2001
463. Y. Zhao and G. Karypis. Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning, 55(3):311-331, 2004
464. S. Zhong and J. Ghosh. A comparative study of generative models for document clustering. Knowledge and Intelligent Systems, 2005
465. D. Zuckerman. NP-complete problems have a version that's hard to approximate. In Proceedings of the 8th Annual Structure in Complexity Theory Conference, pages 305-312, IEEE Computer Society, Los Alamitos, CA, 1993