메뉴 건너뛰기




Volumn 22, Issue , 2012, Pages 458-466

SpeedBoost: Anytime prediction with uniform near-optimality

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

EID: 84954211749     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (36)

References (18)
  • 2
    • 80053452142 scopus 로고    scopus 로고
    • Submodu-lar meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection
    • Abhimanyu Das and David Kempe. Submodu-lar meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In Proceedings of the 28th International Conference on Machine Learning, 2011.
    • (2011) Proceedings of the 28th International Conference on Machine Learning
    • Das, A.1    Kempe, D.2
  • 4
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • J. H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29:1189-1232, 2000.
    • (2000) Annals of Statistics , vol.29 , pp. 1189-1232
    • Friedman, J.H.1
  • 5
    • 0027842081 scopus 로고
    • Matching pursuits with time-frequency dictionaries
    • dec
    • S.G. Mallat and Zhifeng Zhang. Matching pursuits with time-frequency dictionaries. Signal Processing, IEEE Transactions on, 41(12):3397-3415, dec 1993.
    • (1993) Signal Processing IEEE Transactions on , vol.41 , Issue.12 , pp. 3397-3415
    • Mallat, S.G.1    Zhang, Z.2
  • 15
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • Joel A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50:2231-2242, 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , pp. 2231-2242
    • Tropp, J.A.1
  • 16
    • 72849144638 scopus 로고    scopus 로고
    • Anytime classification using the nearest neighbor algorithm with applications to stream mining
    • Ken Ueno, Xiaopeng Xi, Eamonn Keogh, and Dah-Jye Lee. Anytime classification using the nearest neighbor algorithm with applications to stream mining. Data Mining, IEEE International Conference on, 0:623-632, 2006.
    • (2006) Data Mining IEEE International Conference on , pp. 623-632
    • Ueno, K.1    Xi, X.2    Keogh, E.3    Lee, D.4
  • 18
    • 0030230721 scopus 로고    scopus 로고
    • Using anytime algorithms in intelligent systems
    • Shlomo Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996.
    • (1996) AI Magazine , vol.17 , Issue.3 , pp. 73-83
    • Zilberstein, S.1


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