메뉴 건너뛰기




Volumn 54, Issue 12, 2010, Pages 3212-3226

Outlier detection and least trimmed squares approximation using semi-definite programming

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; STATISTICS;

EID: 77955405267     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csda.2009.09.037     Document Type: Article
Times cited : (39)

References (27)
  • 1
    • 0035963359 scopus 로고    scopus 로고
    • New algorithms for computing the least trimmed squares regression estimator
    • Agullo, J., 2001. New algorithms for computing the least trimmed squares regression estimator. Computational Statistics and Data Analysis 36, 425-439.
    • (2001) Computational Statistics and Data Analysis , vol.36 , pp. 425-439
    • Agullo, J.1
  • 2
    • 0002867286 scopus 로고
    • Simulated annealing for the detection of multiple outliers using least squares and least median of squares fitting
    • Atkinson, A.C., Weisberg, S., 1991. Simulated annealing for the detection of multiple outliers using least squares and least median of squares fitting. Directions in Robust Statistics and Diagnostics, Part 17-20.
    • (1991) Directions in Robust Statistics and Diagnostics , pp. 17-20
    • Atkinson, A.C.1    Weisberg, S.2
  • 3
    • 34247479715 scopus 로고    scopus 로고
    • Classification and regression via integer optimization
    • Bertsimas, D., Shioda, R., 2007. Classification and regression via integer optimization. Operations Research 55 (2), 252-271.
    • (2007) Operations Research , vol.55 , Issue.2 , pp. 252-271
    • Bertsimas, D.1    Shioda, R.2
  • 6
    • 33646866996 scopus 로고    scopus 로고
    • A numerical approach for solving some convex maximization problems
    • Enkhbat, R., Barsbold, B., Kamada, Masaru, 2006. A numerical approach for solving some convex maximization problems. Journal of Global Optimization 35(1), 85-101.
    • (2006) Journal of Global Optimization , vol.35 , Issue.1 , pp. 85-101
    • Enkhbat, R.1    Barsbold, B.2    Kamada, M.3
  • 7
    • 38149147670 scopus 로고
    • The feasible solution algorithm for least trimmed squares regression
    • Hawkins, D.M., 1993. The feasible solution algorithm for least trimmed squares regression. Computational Statistics and Data Analysis 17, 185-196.
    • (1993) Computational Statistics and Data Analysis , vol.17 , pp. 185-196
    • Hawkins, D.M.1
  • 8
    • 0021482113 scopus 로고
    • Location of several outliers in multiple regression data using elemental sets
    • Hawkins, D.M., Bradu, D., Kass, G.V., 1984. Location of several outliers in multiple regression data using elemental sets. Technometrics 26, 197-208.
    • (1984) Technometrics , vol.26 , pp. 197-208
    • Hawkins, D.M.1    Bradu, D.2    Kass, G.V.3
  • 12
    • 84947791529 scopus 로고    scopus 로고
    • second ed. John Wiley and Sons, New York.
    • Huber, P.J., 2009. Robust Statistics, second ed. John Wiley and Sons, New York.
    • (2009) Robust Statistics
    • Huber, P.J.1
  • 14
    • 0346111798 scopus 로고    scopus 로고
    • Finite exact branch-and-bound algorithms for concave minimization over polytopes
    • Locatelli, Marco, Thoai, Nguyen V., 2000. Finite exact branch-and-bound algorithms for concave minimization over polytopes. Journal of Global Optimization 18(2), 107-128.
    • (2000) Journal of Global Optimization , vol.18 , Issue.2 , pp. 107-128
    • Locatelli, M.1    Thoai Nguyen, V.2
  • 19
    • 85030590588 scopus 로고    scopus 로고
    • RelaxMCD: Smooth optimisation for the minimum covariance determinant estimator
    • submitted for publication.
    • Schyns, M., Haesbroeck, G., Critchley, F., 2009. RelaxMCD: Smooth optimisation for the minimum covariance determinant estimator. Computational Statistics and Data Analysis (submitted for publication).
    • (2009) Computational Statistics and Data Analysis
    • Schyns, M.1    Haesbroeck, G.2    Critchley, F.3
  • 24
    • 17444382397 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
    • Vandenbussche, D., Nemhauser, G., 2005a. A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Mathematical Programming 102 (3), 559-575.
    • (2005) Mathematical Programming , vol.102 , Issue.3 , pp. 559-575
    • Vandenbussche, D.1    Nemhauser, G.2
  • 25
    • 17444372087 scopus 로고    scopus 로고
    • A polyhedral study of nonconvex quadratic programs with box constraints
    • Vandenbussche, D., Nemhauser, G., 2005b. A polyhedral study of nonconvex quadratic programs with box constraints. Mathematical Programming 102 (3), 531-557.
    • (2005) Mathematical Programming , vol.102 , Issue.3 , pp. 531-557
    • Vandenbussche, D.1    Nemhauser, G.2
  • 27
    • 18244384955 scopus 로고    scopus 로고
    • Deleting outliers in robust regression with mixed integer programming
    • Zioutas, G., Avramidis, A., 2005. Deleting outliers in robust regression with mixed integer programming. Acta Mathematicae Applicatae Sinica 21 (2), 323-334.
    • (2005) Acta Mathematicae Applicatae Sinica , vol.21 , Issue.2 , pp. 323-334
    • Zioutas, G.1    Avramidis, A.2


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