Efficient kernel clustering using random Fourier features

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2012, Pages 161-170

  Chitta, Radha ^a   Jin, Rong ^a   Jain, Anil K ^a  

^a Michigan State University   (United States)

Author keywords

Kernel means; Kernel clustering; Random Fourier features; Scalability

Indexed keywords

DATA MATRICES; DATA POINTS; EFFICIENT KERNELS; EMPIRICAL STUDIES; EUCLIDEAN DISTANCE; FOURIER FEATURES; FOURIER MAPS; IMPROVED SCHEME; INNER PRODUCT; KERNEL CLUSTERING; LARGE DATASETS; LARGE SCALE CLASSIFICATIONS; LOW-DIMENSIONAL SPACES; NONLINEAR STRUCTURE; REAL WORLD DATA; SINGULAR VECTORS;

DATA MINING; FOURIER TRANSFORMS; SCALABILITY;

CLUSTERING ALGORITHMS;

EID: 84874095062     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2012.61     Document Type: Conference Paper

References (41)

1. A. Jain, "Data clustering: 50 years beyond k-means," Pattern Recognition Letters, vol. 31, no. 8, pp. 651-666, 2010.
2. A. Rahimi and B. Recht, "Random features for large-scale kernel machines," Advances in Neural Information Processing Systems, vol. 20, pp. 1177-1184, 2007.
3. L. Bo and C. Sminchisescu, "Efficient match kernel between sets of features for visual recognition," Advances in Neural Information Processing Systems, vol. 22, pp. 135-143, 2009.
4. O. Maillard and R. Munos, "Compressed least-squares regression," Advances in Neural Information Processing Systems, vol. 22, pp. 1213-1221, 2009.
5. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes from shift-invariant kernels," Advances in Neural Information Processing Systems, vol. 22, pp. 1509-1517, 2009.
6. B. Scholkopf, A. Smola, and K. Muller, "Nonlinear component analysis as a kernel eigenvalue problem," Neural Computation, vol. 10, no. 5, pp. 1299-1314, 1996.
7. I. Dhillon, Y. Guan, and B. Kulis, "A unified view of kernel κ-means, spectral clustering and graph cuts," University of Texas at Austin, Tech. Rep., 2004, (Tech. rep. TR-04-25).
8. F. Can, "Incremental clustering for dynamic information processing," ACM Transactions on Information Systems, vol. 11, no. 2, pp. 143-164, 1993.
9. P. Bradley, U. Fayyad, and C. Reina, "Scaling em (expectation-maximization) clustering to large databases," Microsoft Research, Tech. Rep., 1998.
10. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan, "Clustering data streams: Theory and practice," IEEE Transactions on Knowledge and Data Engineering, pp. 515-528, 2003.
11. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: an efficient data clustering method for very large databases," ACM SIGMOD Record, vol. 25, no. 2, pp. 103-114, 1996.
12. S. Guha, R. Rastogi, and K. Shim, "CURE: an efficient clustering algorithm for large databases," Information Systems, vol. 26, no. 1, pp. 35-58, 2001.
13. R. Ng and J. Han, "CLARANS: A method for clustering objects for spatial data mining," IEEE Transactions on Knowledge and Data Engineering, pp. 1003-1016, 2002.
14. B. Bahmani, B. Moseley, A. Vattani, R. Kumar, and S. Vassilvitskii, "Scalable k-means++," Proceedings of the VLDB Endowment, vol. 5, no. 7, pp. 622-633, 2012.
15. A. Ene, S. Im, and B. Moseley, "Fast clustering using mapreduce," in Proceedings of the International Conference on Knowledge discovery and Data mining, 2011, pp. 681-689.
16. T. Liu, C. Rosenberg, and H. Rowley, "Clustering billions of images with large scale nearest neighbor search," in Proceedings of the IEEE Workshop on Applications of Computer Vision, 2007, pp. 28-33.
17. R. Ferreira Cordeiro, C. Traina Junior, A. Machado Traina, J. López, U. Kang, and C. Faloutsos, "Clustering very large multi-dimensional datasets with mapreduce," in Proceedings of the International Conference on Knowledge Discovery and Data mining, 2011, pp. 690-698.
18. A. McCallum, K. Nigam, and L. Ungar, "Efficient clustering of high-dimensional data sets with application to reference matching," in Proceedings of International Conference on Knowledge Discovery and Data mining, 2000, pp. 169-178.
19. C. Ranger, R. Raghuraman, A. Penmetsa, G. Bradski, and C. Kozyrakis, "Evaluating mapreduce for multi-core and multiprocessor systems," in IEEE Symposium on High Performance Computer Architecture, 2007, pp. 13-24.
20. S. Owen, R. Anil, T. Dunning, and E. Friedman, Mahout in Action. Manning Publications Co., 2011.
21. U. Von Luxburg, "A tutorial on spectral clustering," Statistics and Computing, vol. 17, no. 4, pp. 395-416, 2007.
22. D. MacDonald and C. Fyfe, "The kernel self-organising map," in Proceedings of the International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies, vol. 1, 2002, pp. 317-320.
23. C. Williams and M. Seeger, "Using the nystrom method to speed up kernel machines," Advances in Neural Information Processing Systems, vol. 13, pp. 682-688, 2001.
24. C. Fowlkes, S. Belongie, F. Chung, and J. Malik, "Spectral grouping using the nystrom method," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 214-225, 2004.
25. T. Sakai and A. Imiya, "Fast spectral clustering with random projection and sampling," Machine Learning and Data Mining in Pattern Recognition, pp. 372-384, 2009.
26. W. Chen, Y. Song, H. Bai, C. Lin, and E. Chang, "Parallel spectral clustering in distributed systems," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 3, pp. 568-586, 2011.
27. R. Chitta, R. Jin, T. Havens, and A. Jain, "Approximate kernel k-means: Solution to large scale kernel clustering," in Proceedings of the International Conference on Knowledge Discovery and Data mining, 2011, pp. 895-903.
28. P. Kar and H. Karnick, "Random feature maps for dot product kernels," in Proceedings of the International Conference on Artificial Intelligence and Statistics, 2012, pp. 583-591.
29. W. Rudin, Fourier Analysis on Groups. Wiley-Interscience, 1990, vol. 12.
30. M. Belabbas and P. J. Wolfe, "Spectral methods in machine learning and new strategies for very large data sets," Proceedings of the National Academy of Sciences of the USA, vol. 106, pp. 369-374, 2009.
31. J. Doornik, "An improved ziggurat method to generate normal random samples," University of Oxford, 2005.
32. A. Frieze, R. Kannan, and S. Vempala, "Fast monte-carlo algorithms for finding low-rank approximations," Journal of the ACM, vol. 51, no. 6, pp. 1025-1041, 2004.
33. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, "Gradient-based learning applied to document recognition," Proceedings of the IEEE, vol. 86, no. 11, pp. 2278-2324, 1998.
34. J. Blackard and D. Dean, "Comparative accuracies of artificial neural networks and discriminant analysis in predicting forest cover types from cartographic variables," Computers and Electronics in Agriculture, vol. 24, no. 3, pp. 131-152, 1999.
35. R. Cattral, F. Oppacher, and D. Deugo, "Evolutionary data mining with automatic rule generalization," Recent Advances in Computers, Computing and Communications, pp. 296-300, 2002.
36. S. Stolfo, W. Fan, W. Lee, A. Prodromidis, and P. Chan, "Cost-based modeling for fraud and intrusion detection: Results from the jam project," in Proceedings of the DARPA Information Survivability Conference and Exposition, vol. 2, 2000, pp. 130-144.
37. C. Alzate and J. Suykens, "Multiway spectral clustering with out-of-sample extensions through weighted kernel pca," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 2, pp. 335-347, 2010.
38. P. Perona and L. Zelnik-Manor, "Self-tuning spectral clustering," Advances in Neural Information Processing Systems, vol. 17, pp. 1601-1608, 2004.
39. T. Kvalseth, "Entropy and correlation: Some comments," IEEE Transactions on Systems, Man and Cybernetics, vol. 17, no. 3, pp. 517-519, 1987.
40. S. Smale and D. Zhou, "Learning theory estimates via integral operators and their approximations," Constructive approximation, vol. 26, no. 2, pp. 153-172, 2007.
41. G. W. Stewart and J. Guang Sun, Matrix Perturbation Theory. Academic Press, 1990.