Spectral kernel methods for clustering

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Cristianini, Nello ^a   Shawe Taylor, John ^b   Kandola, Jaz ^b  

^a Biowif Technologies   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; UNSUPERVISED LEARNING;

GRAPH-THEORETIC; KERNEL MATRICES; LABELED DATASET; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; RELATED MATRICES; SIMPLE ALGORITHM; SPECTRAL KERNELS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84898954907     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M.W. Berry, B. Hendrickson, and P. Raghavan. Sparse matrix reordering schemes for browsing hypertext. In The Matematics of Numerical Analysis, pages 99-123. AMS, 1996.
2. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, 2000.
3. www.support-vector.net.
4. Nello Cristianini, Andre Elisseeff, John Shawe-Taylor, and Jaz Kandola. On kernel- Target alignment. In submitted to Proceedings of Neural Information Processing Systems (NIPS), 2001.
5. Nello Cristianini, Huma Lodhi, and John Shawe-Taylor. Latent semantic kernels for feature selection. Technical Report NC-TR-00-080, NeuroCOLT Working Group, http://www.neurocolt.org 2000.
6. A. Pothen, H. Simon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal, 2(3):430-452, 1990.