메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Relaxed clipping: A global training method for robust regression and classification

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; REGRESSION ANALYSIS;

EID: 85162048991     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (47)

References (31)
  • 2
    • 0030194054 scopus 로고    scopus 로고
    • On the unification of line processes, outlier rejection, and robust statistics with applications in early vision
    • M. Black and A. Rangarajan. On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. International Journal of Computer Vision, 19(1):57-91, 1996.
    • (1996) International Journal of Computer Vision , vol.19 , Issue.1 , pp. 57-91
    • Black, M.1    Rangarajan, A.2
  • 5
    • 18244390064 scopus 로고    scopus 로고
    • On robustness properties of convex risk minimization methods for pattern recognition
    • A. Christmann and I. Steinwart. On robustness properties of convex risk minimization methods for pattern recognition. Journal of Machine Learning Research, 5:1007-1034, 2004.
    • (2004) Journal of Machine Learning Research , vol.5 , pp. 1007-1034
    • Christmann, A.1    Steinwart, I.2
  • 6
    • 42449093653 scopus 로고    scopus 로고
    • Consistency and robustness of kernel-based regression in convex risk minimization
    • A. Christmann and I. Steinwart. Consistency and robustness of kernel-based regression in convex risk minimization. Bernoulli, 13(3):799-819, 2007.
    • (2007) Bernoulli , vol.13 , Issue.3 , pp. 799-819
    • Christmann, A.1    Steinwart, I.2
  • 7
    • 0036643072 scopus 로고    scopus 로고
    • Logistic regression, AdaBoost and Bregman distances
    • M. Collins, R. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48, 2002.
    • (2002) Machine Learning , vol.48
    • Collins, M.1    Schapire, R.2    Singer, Y.3
  • 9
    • 0031211090 scopus 로고    scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and Systems Sciences, 55(1):119-139, 1997.
    • (1997) Journal of Computer and Systems Sciences , vol.55 , Issue.1 , pp. 119-139
    • Freund, Y.1    Schapire, R.2
  • 14
    • 0035575628 scopus 로고    scopus 로고
    • Relative loss bounds for multidimensional regression problems
    • J. Kivinen and M. Warmuth. Relative loss bounds for multidimensional regression problems. Machine Learning, 45:301-329, 2001.
    • (2001) Machine Learning , vol.45 , pp. 301-329
    • Kivinen, J.1    Warmuth, M.2
  • 16
    • 83555170269 scopus 로고    scopus 로고
    • Random classification noise defeats all convex potential boosters
    • P. Long and R. Servedio. Random classification noise defeats all convex potential boosters. Machine Learning, 78:287-304, 2010.
    • (2010) Machine Learning , vol.78 , pp. 287-304
    • Long, P.1    Servedio, R.2
  • 18
    • 77956005954 scopus 로고    scopus 로고
    • On the design of loss functions for classification: Theory, robustness to outliers, and SavageBoost
    • H. Masnadi-Shirazi and N. Vasconcelos. On the design of loss functions for classification: theory, robustness to outliers, and SavageBoost. In Advances in Neural Information Processing Systems (NIPS), volume 21, pages 1049-1056, 2008.
    • (2008) Advances in Neural Information Processing Systems (NIPS) , vol.21 , pp. 1049-1056
    • Masnadi-Shirazi, H.1    Vasconcelos, N.2
  • 21
    • 34250080273 scopus 로고
    • Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
    • M. Overton and R. Womersley. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Mathematical Programming, 62(2):321-357, 1993.
    • (1993) Mathematical Programming , vol.62 , Issue.2 , pp. 321-357
    • Overton, M.1    Womersley, R.2
  • 26
    • 0033189795 scopus 로고    scopus 로고
    • Robust parameter estimation in computer vision
    • C. Stewart. Robust parameter estimation in computer vision. SIAM Review, 41(3), 1999.
    • (1999) SIAM Review , vol.41 , Issue.3
    • Stewart, C.1
  • 27
    • 35348869458 scopus 로고    scopus 로고
    • Robust truncated hinge loss support vector machines
    • Y. Wu and Y. Liu. Robust truncated hinge loss support vector machines. Journal of the American Statistical Association, 102(479):974-983, 2007.
    • (2007) Journal of the American Statistical Association , vol.102 , Issue.479 , pp. 974-983
    • Wu, Y.1    Liu, Y.2
  • 31
    • 77951160087 scopus 로고    scopus 로고
    • A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
    • J. Yu, S. Vishwanathan, S. Günter, and N. Schraudolph. A quasi-Newton approach to nonsmooth convex optimization problems in machine learning. J. of Machine Learning Research, 11:1145-1200, 2010.
    • (2010) J. of Machine Learning Research , vol.11 , pp. 1145-1200
    • Yu, J.1    Vishwanathan, S.2    Günter, S.3    Schraudolph, N.4


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