메뉴 건너뛰기




Volumn 382, Issue , 2009, Pages

SimpleNPKL : Simple non-parametric kernel learning

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED FORM SOLUTIONS; COMPUTATION COSTS; DATA SETS; EMPIRICAL RESULTS; ITERATIVE ALGORITHM; KERNEL LEARNING; LANCZOS ALGORITHM; NON-PARAMETRIC; OPTIMIZATION TASK; PAIRWISE CONSTRAINTS; REAL APPLICATIONS; SADDLE POINT; SEMI-DEFINITE PROGRAMMING; SIDE INFORMATION; TIME COMPLEXITY;

EID: 70049084031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1553374.1553537     Document Type: Conference Paper
Times cited : (6)

References (25)
  • 1
    • 0031141136 scopus 로고    scopus 로고
    • Complementarity and nondegeneracy in semidefinite programming
    • Alizadeh, F., Haeberly, J.-P. A., & Overton, M. L. (1997). Complementarity and nondegeneracy in semidefinite programming. Math. Program., 77, 111-128.
    • (1997) Math. Program , vol.77 , pp. 111-128
    • Alizadeh, F.1    Haeberly, J.-P.A.2    Overton, M.L.3
  • 2
    • 85161978168 scopus 로고    scopus 로고
    • Diffrac: A discriminative and flexible framework for clustering
    • Bach, F., & Harchaoui, Z. (2008). Diffrac: a discriminative and flexible framework for clustering. Neural Information Processing Systems (pp. 49-56).
    • (2008) Neural Information Processing Systems , pp. 49-56
    • Bach, F.1    Harchaoui, Z.2
  • 5
    • 33646249113 scopus 로고    scopus 로고
    • Least-squaures covariance matrix adjustment
    • Boyd, S., & Xiao, L. (2005). Least-squaures covariance matrix adjustment. SIAM Journal of Matrix Anal. Appl., 27, 532-546.
    • (2005) SIAM Journal of Matrix Anal. Appl , vol.27 , pp. 532-546
    • Boyd, S.1    Xiao, L.2
  • 11
    • 29644444223 scopus 로고    scopus 로고
    • A unifying framework for several cutting plane methods for semidefinite programming
    • Kartik Krishnan, J. E. M. (2006). A unifying framework for several cutting plane methods for semidefinite programming. Optimization Methods and Software, 21, 57-74.
    • (2006) Optimization Methods and Software , vol.21 , pp. 57-74
    • Kartik Krishnan, J.E.M.1
  • 17
    • 0003851780 scopus 로고    scopus 로고
    • Arpack users guide: Solution of large scale eigenvalue problems with implicitly restarted arnoldi methods
    • Lehoucq, R. B., Sorensen, D. C., & Yang, C. (1998). Arpack users guide: Solution of large scale eigenvalue problems with implicitly restarted arnoldi methods (Technical Report).
    • (1998) Technical Report
    • Lehoucq, R.B.1    Sorensen, D.C.2    Yang, C.3
  • 18
    • 0042338416 scopus 로고
    • On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
    • MSRR-604, Carnegie Mellon University
    • Pataki, G. (1995). On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues (Technical Report MSRR-604). Carnegie Mellon University.
    • (1995) Technical Report
    • Pataki, G.1
  • 21
    • 56449127513 scopus 로고    scopus 로고
    • Fast solvers and efficient implementations for distance metric learning
    • Winberger, K. Q., & Saul, L. K. (2008). Fast solvers and efficient implementations for distance metric learning. International Conference on Machine Learning (pp. 1160-1167).
    • (2008) International Conference on Machine Learning , pp. 1160-1167
    • Winberger, K.Q.1    Saul, L.K.2
  • 23


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