1 |
Y. Deng, Q. Dai, R. Wang, Z. Zhang, "Commute time guided transformation for feature extraction," Computer Vision and Image Understanding 116(2012) pp. 473-483.
DOI
ScienceOn
|
2 |
M. Belkin and P. Niyogi, "Laplacian eigenmaps for dimensionality reduction and data representation," Neural Computation15(6), pp.1373-1396, 2003.
DOI
ScienceOn
|
3 |
M. Brito, E. Chavez, A. Quiroz, and J. Yukich, "Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection," Statistics and Probability Letter, 1997.
|
4 |
F. Chung, Spectral graph theory, American Mathematical Society, 1997.
|
5 |
R.R. Coifman and S. Lafon, "Diffusion maps," Applied and Computational Harmonic Analysis, pp.5-30, 2006.
|
6 |
D.L. Donoho and C. Grimes,"Hessian eigenmaps: new locally linear embedding techniques for high dimensional data," Proceedings of the National Academy of Sciences, pp.5591-5596, 2003.
|
7 |
M. Cho, Y. Lee, and E. Kim, "Dimensionality reduction by manifold learning," IEEK Fall Conference 2008.
|
8 |
H. Qiu and E.R. Hancock, "Clustering and embedding using commute times," IEEE Trans. PAMI, Vol. 29, No. 11, Nov., 2007.
|
9 |
S.T. Roweis and L.K. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science Vol.290, 2000.
|
10 |
M. Saerens, F. Fouss, L. Yen, and P. Dupont, "The principal component analysis of a graph, and its relationships to spectral clustering," Machine Learning: ECML 2004, pp. 371-383.
|
11 |
K.M. Taylor, "The geometry of signal and image patch-sets," PhD Thesis, University of Colorado, Boulder, Dept. of Applied Mathematics, June 2011.
|
12 |
U. von Luxburg, A. Radl, and M. Hein, "Getting lost in space: Large sample analysis of the commute distance," Neural Information Processing Systems (NIPS), 2010.
|
13 |
J.B. Tenenbaum, V. deSilva, and J.C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, Vol. 290, pp.2319-2323, 2000.
DOI
ScienceOn
|