Principal direction divisive partitioning with kernels and k-means steering

Survey of Text Mining II: Clustering, Classification, and Retrieval

Volumn , Issue , 2008, Pages 45-64

  Zeimpekis, Dimitrios ^a   Gallopoulos, Efstratios ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77953615023     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84800-046-9_3     Document Type: Chapter

References (36)

1. [AKY99] C. J. Alpert, A. B. Kahng, and S.-Z. Yao. Spectral partitioning with multiple eigenvectors. Discrete Applied Mathematics, 90:3-26, 1999.
2. [AY95] C. J. Alpert and S.-Z. Yao. Spectral partitioning: the more eigenvectors, the better. In Proc. 32nd ACM/IEEE Design Automation Conf., pages 195-200. ACM Press, 1995. Available from World Wide Web: http://doi.acm.org/10. 1145/217474.217529.
3. [Ber92] M. W. Berry. Large scale singular value decomposition. Int'l. J. Supercomp. Appl., 6:13-49, 1992.
4. [Ber06] P. Berkhin. A survey of clustering data mining techniques. In J. Kogan, C. Nicholas, and M. Teboulle, editors, Grouping Multidimensional Data: Recent Advances in Clustering, pages 25-72. Springer, Berlin, 2006.
5. [BGRS99] K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In Lecture Notes in Computer Science, volume 1540, pages 217-235. Sprnger, London, 1999.
6. [BHHSV01] A. Ben-Hur, D. Horn, H. T. Siegelmann, and V. Vapnik. Support vector clustering. Machine Learning Research, 2:125-137, 2001.
7. [Bol98] D. Boley. Principal direction divisive partitioning. Data Mining and Knowledge Discovery, 2(4):325-344, 1998.
8. [Bol01] D. Boley. A scalable hierarchical algorithm for unsupervised clustering. In R. Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, and R. Namburu, editors, Data Mining for Scientific and Engineering Applications. Kluwer Academic Publishers, Norwell, MA, 2001.
9. [CST00] N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines and Other Kernel-Base Learning Methods. Cambridge University Press, Cambridge, UK, 2000.
10. [CV05] F. Camastra and A. Verri. A novel kernel method for clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(5):801-804, 2005.
11. [DGK04] I. S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means: spectral clustering and normalized cuts. In Proc. 10th ACM SIGKDD, pages 551-556, ACM Press, New York, 2004.
12. [DH73] W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs. IBM J. Res. Develop., 17:420-425, 1973.
13. [DH04] C. Ding and X. He. Cluster structure of k-means clustering via principal component analysis. In PAKDD, pages 414-418, 2004. Available from World Wide Web: http://springerlink.metapress.com/openurl.asp? genre=article&issn=0302-9743&volume=3056&spage=414.
14. [Dhi01] I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proc. 7th ACM SIGKDD, pages 269-274, ACM Press, New York, 2001.
15. [FJ05] T. Finley and T. Joachims. Supervised clustering with support vector machines. In ICML'05: Proceedings of the 22nd international conference on Machine learning, pages 217-224, New York, 2005.
16. [HL95] B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput., 16(2):452-469, 1995. Available from World Wide Web: citeseer.nj.nec.com/ hendrickson95improved.html.
17. [KDN04] J. Kogan, I. S. Dhillon, and C. Nicholas. Feature selection and document clustering. In M. Berry, editor, A Comprehensive Survey of Text Mining. Springer, New York, 2004.
18. [KMN+02] T. Kanungo, D. M. Mount, N. S. Netanyahu, D. Platko, and A. Y. Wu. An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. PAMI, 24(7):881-892, 2002.
19. [Kog07] J. Kogan. Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press, New York, 2007.
20. [KS05] E. Kokiopoulou and Y. Saad. PCA and kernel PCA using polynomial filtering: a case study on face recognition. In SIAM Conf. on Data Mining, 2005.
21. [Lar] R. M. Larsen. Propack: a software package for the symmetric eigenvalue problem and singular value problems on Lanczos and Lanczos bidiagonalization with partial reorthogonalization. Available from World Wide Web: http://sun. stanford.edu/?rmunk/PROPACK/. Stanford University.
22. [LB06] D. Littau and D. Boley. Clustering very large datasets with PDDP. In J. Kogan, C. Nicholas, and M. Teboulle, editors, Grouping Multidimensional Data: Recent Advances in Clustering, pages 99-126. Springer, New York, 2006.
23. [Llo82] S. P. Lloyd. Least squares quantization in PCM. IEEE Trans. Information Theory, 28:129-137, 1982.
24. [MMR+01] K. R. Müller, S. Mika, G. Rätsch, K. Tsuda, and B. Schölkopf. An introduction to kernel-based learning algorithms. IEEE Transactions on Neural Networks, 12(2):181-202, 2001.
25. [SB88] G. Salton and C. Buckley. Term weighting approaches in automatic text retrieval. Information Processing and Management, 24(5):513-523, 1988.
26. [SBBG02] S. Savaresi, D. Boley, S. Bittanti, and G. Gazzaniga. Choosing the cluster to split in bisecting divisive clustering algorithms. In Second SIAM International Conference on Data Mining (SDM'2002), 2002.
27. [SEKX98] 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.
28. [SKK00] M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In 6th ACM SIGKDD, World Text Mining Conference, Boston, MA, 2000. Available from World Wide Web: citeseer.nj.nec.com/ steinbach00comparison. html.
29. [SM97] A. J. Schölkopf, B. Smola and K. R. Müller. Kernel principal component analysis. In Proc. International Conference on Artificial Neural Networks, pages 583-588, 1997.
30. [SSM98] B. Schölkopf, A. J. Smola, and K. R. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998.
31. [XZ04] S. Xu and J. Zhang. A parallel hybrid Web document clustering algorithm and its performance study. J. Supercomputing, 30(2):117-131, 2004.
32. [YAK00] M. H. Yang, N. Ahuja, and D. J. Kriegman. Face recognition using kernel eigenfaces. In Proc. International Conference on Image Processing, 2000.
33. [ZC03] D. Q. Zhang and S. C. Chen. Clustering incomplete data using kernel-based fuzzy c-means algorithm. Neural Processing Letters, 18(3):155-162, 2003.
34. [ZG03] D. Zeimpekis and E. Gallopoulos. PDDP (l): towards a flexible principal direction divisive partitioning clustering algorithm. In D. Boley, I. Dhillon, J. Ghosh, and J. Kogan, editors, Proc. Workshop on Clustering Large Data Sets (held in conjunction with the Third IEEE Int'l. Conf. Data Min.), pages 26-35, Melbourne, FL, November 2003.
35. [ZG06] D. Zeimpekis and E. Gallopoulos. TMG: A MATLAB toolbox for generating term-document matrices from text collections. In J. Kogan, C. Nicholas, and M. Teboulle, editors, Grouping Multidimensional Data: Recent Advances in Clustering, pages 187-210. Springer, New York, 2006.
36. [ZHD+01] H. Zha, X. He, C. Ding, M. Gu, and H. Simon. Spectral relaxation for kmeans clustering. In NIPS, pages 1057-1064, 2001. Available from World Wide Web: http://www-2.cs.cmu.edu/Groups/NIPS/NIPS2001/papers/psgz/AA41.ps.gz.