메뉴 건너뛰기




Volumn 15, Issue 2, 2006, Pages 287-311

Conjugate direction boosting

Author keywords

Forward stepwise variable selection; High dimensional linear regression; L0 and L1 penalization; Least angle regression; Orthogonal greedy algorithm

Indexed keywords


EID: 33745303526     PISSN: 10618600     EISSN: None     Source Type: Journal    
DOI: 10.1198/106186006X113548     Document Type: Article
Times cited : (5)

References (23)
  • 1
    • 0346786584 scopus 로고    scopus 로고
    • Arcing classifier (Pkg: P801-849)
    • Breiman, L. (1998), "Arcing Classifier (Pkg: p801-849)," The Annals of Statistics, 26, 801-824.
    • (1998) The Annals of Statistics , vol.26 , pp. 801-824
    • Breiman, L.1
  • 2
    • 0000275022 scopus 로고    scopus 로고
    • Prediction games and arcing algorithms
    • _ (1999), "Prediction Games and Arcing Algorithms," Neural Computation, 11, 1493-1517.
    • (1999) Neural Computation , vol.11 , pp. 1493-1517
  • 3
    • 84950771789 scopus 로고
    • Estimating optimal transformations for multiple regression and correlation (C/R: P598-619)
    • Breiman, L., and Friedman, J. H. (1985), "Estimating Optimal Transformations for Multiple Regression and Correlation (C/R: p598-619)," Journal of the American Statistical Association, 80, 580-598.
    • (1985) Journal of the American Statistical Association , vol.80 , pp. 580-598
    • Breiman, L.1    Friedman, J.H.2
  • 8
    • 58149321460 scopus 로고
    • Boosting a weak learning algorithm by majority
    • Freund, Y. (1995), "Boosting a Weak Learning Algorithm by Majority," Information and Computation, 121, 256-285.
    • (1995) Information and Computation , vol.121 , pp. 256-285
    • Freund, Y.1
  • 10
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • Friedman, J. H. (2001), "Greedy Function Approximation: A Gradient Boosting Machine," The Annals of Statistics, 29, 1189-1232.
    • (2001) The Annals of Statistics , vol.29 , pp. 1189-1232
    • Friedman, J.H.1
  • 12
    • 0027842081 scopus 로고
    • Matching pursuits with time-frequency dictionaries
    • Mallat, S., and Zhang, Z. (1993), "Matching Pursuits With Time-Frequency Dictionaries," IEEE Transactions on Signal Processing, 41, 3397-3415.
    • (1993) IEEE Transactions on Signal Processing , vol.41 , pp. 3397-3415
    • Mallat, S.1    Zhang, Z.2
  • 13
    • 1542276975 scopus 로고    scopus 로고
    • An introduction to boosting and leveraging
    • eds. S. Mendelson and A. Smola, New York: Springer
    • Meir, R., and Rätsch, G. (2003), "An Introduction to Boosting and Leveraging," in Advanced Lectures on Machine Learning, eds. S. Mendelson and A. Smola, New York: Springer, pp. 119-184.
    • (2003) Advanced Lectures on Machine Learning , pp. 119-184
    • Meir, R.1    Rätsch, G.2
  • 15
  • 16
    • 0036062572 scopus 로고    scopus 로고
    • Exploiting the connection between PLS, lanczos methods and conjugate gradients: Alternative proofs of some properties of PLS
    • Phatak, A., and de Hoog, F. (2002), "Exploiting the Connection Between PLS, Lanczos Methods and Conjugate Gradients: Alternative Proofs of Some Properties of PLS," Journal of Chemometries, 16, 361-367.
    • (2002) Journal of Chemometries , vol.16 , pp. 361-367
    • Phatak, A.1    De Hoog, F.2
  • 17
    • 0036643047 scopus 로고    scopus 로고
    • Sparse regression ensembles in infinite and finite hypothesis spaces
    • Rätsch, G., Demiriz, A., and Bennett, K. (2002), "Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces," Machine Learning, 48, 193-221.
    • (2002) Machine Learning , vol.48 , pp. 193-221
    • Rätsch, G.1    Demiriz, A.2    Bennett, K.3
  • 19
    • 0025448521 scopus 로고
    • The strength of weak learnability
    • Schapire, R. E. (1990), "The Strength of Weak Learnability," Machine Learning, 5, 197-227.
    • (1990) Machine Learning , vol.5 , pp. 197-227
    • Schapire, R.E.1


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