메뉴 건너뛰기




Volumn , Issue , 2013, Pages

On the sample complexity of subspace learning

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS; PRINCIPAL COMPONENT ANALYSIS;

EID: 84898969606     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (36)

References (26)
  • 2
    • 0042378381 scopus 로고    scopus 로고
    • Laplacian eigenmaps for dimensionality reduction and data representation
    • M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural computation, 15(6):1373-1396, 2003.
    • (2003) Neural Computation , vol.15 , Issue.6 , pp. 1373-1396
    • Belkin, M.1    Niyogi, P.2
  • 4
    • 33947233031 scopus 로고    scopus 로고
    • Out-of-sample extensions for lle, isomap, mds, eigenmaps, and spectral clustering
    • Y. Bengio, J.F. Paiement, and al. Out-of-sample extensions for lle, isomap, mds, eigenmaps, and spectral clustering. Advances in neural information processing systems, 16:177-184, 2004.
    • (2004) Advances in Neural Information Processing Systems , vol.16 , pp. 177-184
    • Bengio, Y.1    Paiement, J.F.2
  • 6
    • 33847676413 scopus 로고    scopus 로고
    • Statistical properties of kernel principal component analysis
    • G. Blanchard, O. Bousquet, and L. Zwald. Statistical properties of kernel principal component analysis. Machine Learning, 66(2):259-294, 2007.
    • (2007) Machine Learning , vol.66 , Issue.2 , pp. 259-294
    • Blanchard, G.1    Bousquet, O.2    Zwald, L.3
  • 10
    • 0037948870 scopus 로고    scopus 로고
    • Hessian eigenmaps: Locally linear embedding techniques for highdimensional data
    • D.L. Donoho and C. Grimes. Hessian eigenmaps: Locally linear embedding techniques for highdimensional data. Proceedings of the National Academy of Sciences, 100(10):5591-5596, 2003.
    • (2003) Proceedings of the National Academy of Sciences , vol.100 , Issue.10 , pp. 5591-5596
    • Donoho, D.L.1    Grimes, C.2
  • 13
    • 77958550281 scopus 로고    scopus 로고
    • K-dimensional coding schemes in hilbert spaces
    • Andreas Maurer and Massimiliano Pontil. K-dimensional coding schemes in hilbert spaces. IEEE Transactions on Information Theory, 56(11):5839-5846, 2010.
    • (2010) IEEE Transactions on Information Theory , vol.56 , Issue.11 , pp. 5839-5846
    • Maurer, A.1    Pontil, M.2
  • 14
    • 0001638327 scopus 로고
    • Optimum bounds for the distributions of martingales in banach spaces
    • Iosif Pinelis. Optimum bounds for the distributions of martingales in banach spaces. The Annals of Probability, pages 1679-1706, 1994.
    • (1994) The Annals of Probability , pp. 1679-1706
    • Pinelis, I.1
  • 15
    • 0010853295 scopus 로고
    • Hilbert space: Compact operators and the trace theorem
    • Cambridge University Press
    • J.R. Retherford. Hilbert Space: Compact Operators and the Trace Theorem. London Mathematical Society Student Texts. Cambridge University Press, 1993.
    • (1993) London Mathematical Society Student Texts
    • Retherford, J.R.1
  • 16
    • 0034704222 scopus 로고    scopus 로고
    • Nonlinear dimensionality reduction by locally linear embedding
    • S.T. Roweis and L.K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, 2000.
    • (2000) Science , vol.290 , Issue.5500 , pp. 2323-2326
    • Roweis, S.T.1    Saul, L.K.2
  • 17
    • 2342517502 scopus 로고    scopus 로고
    • Think globally, fit locally: Unsupervised learning of low dimensional manifolds
    • L.K. Saul and S.T. Roweis. Think globally, fit locally: unsupervised learning of low dimensional manifolds. The Journal of Machine Learning Research, 4:119-155, 2003.
    • (2003) The Journal of Machine Learning Research , vol.4 , pp. 119-155
    • Saul, L.K.1    Roweis, S.T.2
  • 21
    • 33746329499 scopus 로고    scopus 로고
    • The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem
    • J. Sun, S. Boyd, L. Xiao, and P. Diaconis. The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem. SIAM review, 48(4):681-699, 2006.
    • (2006) SIAM Review , vol.48 , Issue.4 , pp. 681-699
    • Sun, J.1    Boyd, S.2    Xiao, L.3    Diaconis, P.4
  • 22
    • 0034704229 scopus 로고    scopus 로고
    • A global geometric framework for nonlinear dimensionality reduction
    • J.B. Tenenbaum, V. De Silva, and J.C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
    • (2000) Science , vol.290 , Issue.5500 , pp. 2319-2323
    • Tenenbaum, J.B.1    De Silva, V.2    Langford, J.C.3
  • 25
    • 33744949513 scopus 로고    scopus 로고
    • Unsupervised learning of image manifolds by semidefinite programming
    • K.Q.Weinberger and L.K. Saul. Unsupervised learning of image manifolds by semidefinite programming. International Journal of Computer Vision, 70(1):77-90, 2006.
    • (2006) International Journal of Computer Vision , vol.70 , Issue.1 , pp. 77-90
    • Weinberger, K.Q.1    Saul, L.K.2
  • 26
    • 0036165146 scopus 로고    scopus 로고
    • On a connection between kernel pca and metric multidimensional scaling
    • C.K.I. Williams. On a connection between kernel pca and metric multidimensional scaling. Machine Learning, 46(1):11-19, 2002.
    • (2002) Machine Learning , vol.46 , Issue.1 , pp. 11-19
    • Williams, C.K.I.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.