메뉴 건너뛰기




Volumn 4, Issue , 2012, Pages 2573-2581

Non-linear metric learning

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DATA; FUNCTION SPACES; HYPER-PARAMETER; K-NN CLASSIFICATIONS; LEARNING SETTINGS; LINEAR MAPPING; METRIC LEARNING; NONLINEAR MAPPINGS;

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

References (33)
  • 1
    • 77953185204 scopus 로고    scopus 로고
    • Similarity metrics for categorization: From monolithic to category specific
    • IEEE
    • B. Babenko, S. Branson, and S. Belongie. Similarity metrics for categorization: from monolithic to category specific. In ICCV '09, pages 293-300. IEEE, 2009.
    • (2009) ICCV '09 , pp. 293-300
    • Babenko, B.1    Branson, S.2    Belongie, S.3
  • 2
    • 0037403111 scopus 로고    scopus 로고
    • Mirror descent and nonlinear projected subgradient methods for convex optimization
    • A. Beck and M. Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3):167-175, 2003.
    • (2003) Operations Research Letters , vol.31 , Issue.3 , pp. 167-175
    • Beck, A.1    Teboulle, M.2
  • 5
  • 6
    • 24644436425 scopus 로고    scopus 로고
    • Learning a similarity metric discriminatively, with application to face verification
    • IEEE
    • S. Chopra, R. Hadsell, and Y. LeCun. Learning a similarity metric discriminatively, with application to face verification. In CVPR '05, pages 539-546. IEEE, 2005.
    • (2005) CVPR '05 , pp. 539-546
    • Chopra, S.1    Hadsell, R.2    Lecun, Y.3
  • 8
    • 5044227712 scopus 로고    scopus 로고
    • 3D texture recognition using bidirectional feature histograms
    • O.G. Cula and K.J. Dana. 3D texture recognition using bidirectional feature histograms. International Journal of Computer Vision, 59(1):33-60, 2004.
    • (2004) International Journal of Computer Vision , vol.59 , Issue.1 , pp. 33-60
    • Cula, O.G.1    Dana, K.J.2
  • 11
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J.H. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, pages 1189-1232, 2001.
    • (2001) Annals of Statistics , pp. 1189-1232
    • Friedman, J.H.1
  • 12
    • 77956001253 scopus 로고    scopus 로고
    • Multi-class object localization by combining local contextual interactions
    • C. Galleguillos, B. McFee, S. Belongie, and G. Lanckriet. Multi-class object localization by combining local contextual interactions. CVPR '10, pages 113-120, 2010.
    • (2010) CVPR '10 , pp. 113-120
    • Galleguillos, C.1    McFee, B.2    Belongie, S.3    Lanckriet, G.4
  • 13
    • 84864030708 scopus 로고    scopus 로고
    • Metric learning by collapsing classes
    • MIT Press
    • A. Globerson and S. Roweis. Metric learning by collapsing classes. In NIPS '06, pages 451-458. MIT Press, 2006.
    • (2006) NIPS '06 , pp. 451-458
    • Globerson, A.1    Roweis, S.2
  • 14
    • 84862283468 scopus 로고    scopus 로고
    • Visualizing pairwise similarity via semidefinite programming
    • A. Globerson and S. Roweis. Visualizing pairwise similarity via semidefinite programming. In AISTATS '07, pages 139-146, 2007.
    • (2007) AISTATS '07 , pp. 139-146
    • Globerson, A.1    Roweis, S.2
  • 17
    • 84873687590 scopus 로고    scopus 로고
    • Easy as CBA: A simple probabilistic model for tagging music
    • M. Hoffman, D. Blei, and P. Cook. Easy as CBA: A simple probabilistic model for tagging music. In ISMIR '09, pages 369-374, 2009.
    • (2009) ISMIR '09 , pp. 369-374
    • Hoffman, M.1    Blei, D.2    Cook, P.3
  • 20
    • 78149293273 scopus 로고    scopus 로고
    • The quadratic-chi histogram distance family
    • O. Pele and M. Werman. The quadratic-chi histogram distance family. ECCV '10, pages 749-762, 2010.
    • (2010) ECCV '10 , pp. 749-762
    • Pele, O.1    Werman, M.2
  • 24
    • 5044238103 scopus 로고    scopus 로고
    • Adjustment learning and relevant component analysis
    • Springer-Verlag
    • N. Shental, T. Hertz, D. Weinshall, and M. Pavel. Adjustment learning and relevant component analysis. In ECCV '02, volume 4, pages 776-792. Springer-Verlag, 2002.
    • (2002) ECCV '02 , vol.4 , pp. 776-792
    • Shental, N.1    Hertz, T.2    Weinshall, D.3    Pavel, M.4
  • 26
    • 84864062501 scopus 로고    scopus 로고
    • Large margin component analysis
    • L. Torresani and K. Lee. Large margin component analysis. NIPS '07, pages 1385-1392, 2007.
    • (2007) NIPS '07 , pp. 1385-1392
    • Torresani, L.1    Lee, K.2
  • 28
    • 84873421395 scopus 로고    scopus 로고
    • Parallel boosted regression trees for web search ranking
    • ACM
    • S. Tyree, K.Q. Weinberger, K. Agrawal, and J. Paykin. Parallel boosted regression trees for web search ranking. In WWW '11, pages 387-396. ACM, 2011.
    • (2011) WWW '11 , pp. 387-396
    • Tyree, S.1    Weinberger, K.Q.2    Agrawal, K.3    Paykin, J.4
  • 30
    • 56449127513 scopus 로고    scopus 로고
    • Fast solvers and efficient implementations for distance metric learning
    • ACM
    • K.Q. Weinberger and L.K. Saul. Fast solvers and efficient implementations for distance metric learning. In ICML '08, pages 1160-1167. ACM, 2008.
    • (2008) ICML '08 , pp. 1160-1167
    • Weinberger, K.Q.1    Saul, L.K.2
  • 31
    • 61749090884 scopus 로고    scopus 로고
    • Distance metric learning for large margin nearest neighbor classification
    • K.Q.Weinberger and L.K. Saul. Distance metric learning for large margin nearest neighbor classification. The Journal of Machine Learning Research, 10:207-244, 2009.
    • (2009) The Journal of Machine Learning Research , vol.10 , pp. 207-244
    • Weinberger, K.Q.1    Saul, L.K.2
  • 32
    • 84879571292 scopus 로고    scopus 로고
    • Distance metric learning, with application to clustering with side-information
    • MIT Press
    • E. P. Xing, A. Y. Ng, M. I. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. In NIPS '02, pages 505-512. MIT Press, 2002.
    • (2002) NIPS '02 , pp. 505-512
    • Xing, E.P.1    Ng, A.Y.2    Jordan, M.I.3    Russell, S.4
  • 33
    • 0027188633 scopus 로고
    • Data structures and algorithms for nearest neighbor search in general metric spaces
    • P.N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In ACM-SIAM Symposium on Discrete Algorithms '93, pages 311-321, 1993.
    • (1993) ACM-SIAM Symposium on Discrete Algorithms '93 , pp. 311-321
    • Yianilos, P.N.1


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