Recursive kernel trick for network segmentation

International Journal of Robust and Nonlinear Control

Volumn 21, Issue 15, 2011, Pages 1807-1822

  Kung, S Y ^a   Luo, Yuhui ^a  

^a Princeton University   (United States)

Author keywords

computational saving; graph partitioning; kernel k means for cluster discovery and network segmentation; recursive kernel trick; sparsity

Indexed keywords

COMPUTATIONAL SAVINGS; GRAPH PARTITIONING; KERNEL K-MEANS; RECURSIVE KERNEL; SPARSITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS;

MATRIX ALGEBRA;

EID: 80053187942     PISSN: 10498923     EISSN: 10991239     Source Type: Journal    
DOI: 10.1002/rnc.1723     Document Type: Article

References (8)

1. Courant R, Hilbert D, Methods of Mathematical Physics. Interscience: New York, 1953.
2. Duda RO, Hart PE, Pattern Classification. Wiley: New York, 1973 and 2001.
3. Dhillon IS, Guan Y, Kulis B, kernel k-means, spectral clustering and normalized cuts. Proceedings of the 10th ACM KDD Conference, Seattle, WA, August 2004.
4. Dhillon I, Guan Y, Kulis B, Unified view of kernel k-means, spectral clustering and graph cuts. UTCS Technical Report TR-04-25, 2005.
5. Graepel T et al., Classification on pairwise proximity data. Advances in Neural Information Processing Systems, vol. 11. MIT Press: Cambridge, MA, 1999; 438-444.
6. Roth V, Laub J, Buhmann JM, Muller K-R, Going metric: denoising pairwise data. Advances in Neural Information Processing Systems 15. MIT Press: Cambridge, MA, 2003; 817-824.
7. Kung SY, Kernel approaches to unsupervised and supervised machine learning. Proceedings, PCM 2009, Bangkok, Thailand, Muneesawang, et al. (eds). Leature Notes in Computer Science, vol. 5879. Springer: Berlin, December 2009; 1-32.
8. Aizerman M, Braverman E, Rozonoer L, Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control 1964; 25: 821-837.