메뉴 건너뛰기




Volumn 7, Issue 4, 2013, Pages 319-327

An entropy-based approach to enhancing Random Forests

Author keywords

Data classification; entropy; information gain; Random Forests

Indexed keywords

DATA CLASSIFICATION; HISTORICAL DATA; INFORMATION GAIN; INFORMATION-THEORETIC APPROACH; NUMBER OF TREES; PREDICTIVE POWER; RANDOM FORESTS; TWO PARAMETER;

EID: 84888587807     PISSN: 18724981     EISSN: 18758843     Source Type: Journal    
DOI: 10.3233/IDT-130171     Document Type: Article
Times cited : (4)

References (17)
  • 2
    • 0035478854 scopus 로고    scopus 로고
    • Random forests
    • L. Breiman, Random forests, Machine Learning 45(1) (2001), 5-32.
    • (2001) Machine Learning , vol.45 , Issue.1 , pp. 5-32
    • Breiman, L.1
  • 3
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • L. Breiman, Bagging predictors, Machine Learning 24(2) (1996), 123-140.
    • (1996) Machine Learning , vol.24 , Issue.2 , pp. 123-140
    • Breiman, L.1
  • 5
    • 84860145416 scopus 로고    scopus 로고
    • An improved random forests approach with application to the performance prediction challenge datasets
    • C. Dahinden, An improved Random Forests approach with application to the performance prediction challenge datasets. Hands on Pattern Recognition. Microtome, 2009.
    • (2009) Hands on Pattern Recognition. Microtome
    • Dahinden, C.1
  • 7
    • 56349166187 scopus 로고    scopus 로고
    • Neural Networks 2008. IJCNN 2008.(IEEE World Congress on Computational Intelligence). IEEE International Joint Conference on (pp. 3062-3069). IEEE June
    • J. Thongkam, G. Xu and Y. Zhang, AdaBoost algorithm with random forests for predicting breast cancer survivability. In Neural Networks, 2008. IJCNN 2008.(IEEE World Congress on Computational Intelligence). IEEE International Joint Conference on (pp. 3062-3069). IEEE, (2008, June).
    • (2008) AdaBoost Algorithm with Random Forests for Predicting Breast Cancer Survivability
    • Thongkam, J.1    Xu, G.2    Zhang, Y.3
  • 13
    • 0001492549 scopus 로고    scopus 로고
    • Shape quantization and recognition with randomized trees
    • Y. Amit and D. Geman, Shape quantization and recognition with randomized trees, Neural Computation 9(7) (1997), 1545-1588.
    • (1997) Neural Computation , vol.9 , Issue.7 , pp. 1545-1588
    • Amit, Y.1    Geman, D.2
  • 15
    • 84875995425 scopus 로고    scopus 로고
    • Classifying very-high dimensional data with random forests of oblique decision trees
    • Studies in Computational Intelligence. Springer-Verlag Berlin Heidelberg
    • T.N. Do, P. Lenca, S. Lallich and N.K. Pham, Classifying very-high dimensional data with random forests of oblique decision trees. In: Advances in Knowledge Discovery and Management. Volume 292 of Studies in Computational Intelligence. Springer-Verlag Berlin Heidelberg, 2010, 3955.
    • (2010) Advances in Knowledge Discovery and Management , vol.292 , pp. 3955
    • Do, T.N.1    Lenca, P.2    Lallich, S.3    Pham, N.K.4
  • 16
    • 0030387631 scopus 로고    scopus 로고
    • Data mining: An overview from a database perspective. Knowledge and data Engineering
    • M.S. Chen, J. Han and P.S. Yu, Data mining: an overview from a database perspective. Knowledge and data Engineering, IEEE Transactions on 8(6) (1996), 866-883.
    • (1996) IEEE Transactions on , vol.8 , Issue.6 , pp. 866-883
    • Chen, M.S.1    Han, J.2    Yu, P.S.3
  • 17
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • July and October
    • C.E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal 27 (July and October, 1948), pp. 379423 and 623656.
    • (1948) Bell System Technical Journal , vol.27 , pp. 379423-623656
    • Shannon, C.E.1


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