메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Decision jungles: Compact and rich models for classification

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; LEARNING ALGORITHMS; MERGING;

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

References (29)
  • 1
    • 84859376731 scopus 로고
    • Randomized inquiries about shape; An application to handwritten digit recognition
    • University of Chicago IL, Nov
    • Y. Amit and D. Geman. Randomized inquiries about shape; an application to handwritten digit recognition. Technical Report 401, Dept. of Statistics, University of Chicago, IL, Nov 1994.
    • (1994) Technical Report 401, Dept. of Statistics
    • Amit, Y.1    Geman, D.2
  • 5
  • 8
    • 0026135919 scopus 로고
    • Optimal partitioning for classification and regression trees
    • P. Chou. Optimal partitioning for classification and regression trees. IEEE Trans. PAMI, 13(4), 1991.
    • (1991) IEEE Trans. PAMI , vol.13 , Issue.4
    • Chou, P.1
  • 12
    • 77953205895 scopus 로고    scopus 로고
    • Decomposing a scene into geometric and semantically consistent regions
    • S. Gould, R. Fulton, and D. Koller. Decomposing a scene into geometric and semantically consistent regions. In Proc. IEEE ICCV, 2009.
    • (2009) Proc IEEE ICCV
    • Gould, S.1    Fulton, R.2    Koller, D.3
  • 15
    • 0001815269 scopus 로고
    • Constructing optimal binary decision trees is NP-complete
    • L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
    • (1976) Information Processing Letters , vol.5 , Issue.1 , pp. 15-17
    • Hyafil, L.1    Rivest, R.L.2
  • 19
    • 33745821131 scopus 로고    scopus 로고
    • Keypoint recognition using randomized trees
    • V. Lepetit and P. Fua. Keypoint recognition using randomized trees. IEEE Trans. PAMI, 2006.
    • (2006) IEEE Trans. PAMI
    • Lepetit, V.1    Fua, P.2
  • 23
    • 0142036370 scopus 로고
    • Using the minimum description length principle to infer reduced ordered decision graphs
    • A. L. Oliveira and A. Sangiovanni-Vincentelli. Using the minimum description length principle to infer reduced ordered decision graphs. Machine Learning, 12, 1995.
    • (1995) Machine Learning , vol.12
    • Oliveira, A.L.1    Sangiovanni-Vincentelli, A.2
  • 24
    • 0005178917 scopus 로고
    • Decision graphs - An extension of decision trees
    • Monash University, Victoria, Australia
    • J. J. Oliver. Decision graphs - an extension of decision trees. Technical Report 92/173, Dept. of Computer Science, Monash University, Victoria, Australia, 1992.
    • (1992) Technical Report 92/173, Dept. of Computer Science
    • Oliver, J.J.1
  • 26
    • 84888364466 scopus 로고    scopus 로고
    • Large margin DAGs for multiclass classification
    • J. C. Platt, N. Cristianini, and J. Shawe-Taylor. Large margin DAGs for multiclass classification. In Proc. NIPS, pages 547-553, 2000.
    • (2000) Proc. NIPS , pp. 547-553
    • Platt, J.C.1    Cristianini, N.2    Shawe-Taylor, J.3


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