om Method for Computing Large Kernel Eigensystems
暂无分享,去创建一个
[1] J. Douglas Carroll,et al. Two-Way Multidimensional Scaling: A Review , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).
[2] Maoguo Gong,et al. Fast density-weighted low-rank approximation spectral clustering , 2011, Data Mining and Knowledge Discovery.
[3] Marco Marcello,et al. Interactive segmentation of clustered cells via geodesic commute distance and constrained density weighted Nyström method , 2010, Cytometry. Part A : the journal of the International Society for Analytical Cytology.
[4] James T. Kwok,et al. Clustered Nyström Method for Large Scale Manifold Learning and Dimension Reduction , 2010, IEEE Transactions on Neural Networks.
[5] Patrick J. Wolfe,et al. On landmark selection and sampling in high-dimensional data analysis , 2009, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[6] James T. Kwok,et al. Simplifying Mixture Models Through Function Approximation , 2006, IEEE Transactions on Neural Networks.
[7] Michael I. Jordan,et al. Learning Spectral Clustering, With Application To Speech Separation , 2006, J. Mach. Learn. Res..
[8] James T. Kwok,et al. Block-quantized kernel matrix for fast spectral embedding , 2006, ICML.
[9] Petros Drineas,et al. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..
[10] D.M. Mount,et al. An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[11] Petros Drineas,et al. An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition , 2001, Panhellenic Conference on Informatics.
[12] Mikhail Belkin,et al. Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.
[13] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[14] Christopher K. I. Williams,et al. The Effect of the Input Density Distribution on Kernel-based Classifiers , 2000, ICML.
[15] Andrew W. Moore,et al. Accelerating exact k-means algorithms with geometric reasoning , 1999, KDD '99.
[16] Kaizhong Zhang,et al. Evaluating a class of distance-mapping algorithms for data mining and clustering , 1999, KDD '99.
[17] Bernhard Schölkopf,et al. Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.
[18] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[19] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[20] Songcan Chen,et al. Sparsity preserving projections with applications to face recognition , 2010, Pattern Recognit..
[21] Yoshua Bengio,et al. Greedy Spectral Embedding , 2005, AISTATS.
[22] John Platt,et al. FastMap, MetricMap, and Landmark MDS are all Nystrom Algorithms , 2005, AISTATS.
[23] Jitendra Malik,et al. Spectral grouping using the Nystrom method , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] Alexander J. Smola,et al. Kernels and Regularization on Graphs , 2003, COLT.
[25] Joshua B. Tenenbaum,et al. Global Versus Local Methods in Nonlinear Dimensionality Reduction , 2002, NIPS.
[26] Bernhard Schölkopf,et al. Cluster Kernels for Semi-Supervised Learning , 2002, NIPS.
[27] Christopher K. I. Williams,et al. Using the Nyström Method to Speed Up Kernel Machines , 2000, NIPS.
[28] William H. Press,et al. Numerical Recipes in C, 2nd Edition , 1992 .
[29] Allen Gersho,et al. Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.
[30] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.