earticle

논문검색

Performance Comparison of Decision Trees of J48 and Reduced-Error Pruning

초록

영어

Data mining reveals the recent prominence of Machine Learning. It means to acquire the skills and knowledge that can be acquired information efficiently. It is machine learning of new information it may be due to him from the new data to predict the outcome. This paper attempts to compare the classification performance of an exemplary algorithm J48 and REPTree of ML algorithms. Confirm that provide more accurate classification algorithm by which the performance comparison results in finding a more accurate prediction is possible algorithm that is the goal of this paper. This classification was carried out in the data collected for the experiment. As a result classification success rate of J48 is about 96%, classification success rate was found to be about 94% of REPTree. Fine, but it was confirmed that the classification performance is better than the J48 REPTree. In other words, J48 algorithm showed that slightly more accurate forecasts as possible.

목차

Abstract
 1. INTRODUCTION
 2. RELATED RESEARCH
  2.1 J48
  2.2 REPTree
 3. SIMULATION
 4. CONCLUSION
 REFERENCES

저자정보

  • Yong Gyu Jung Department of Medical IT Marketing, Eulji University, Korea
  • Hoon Jin Dept. of Computer Engineering, Sungkyunkwan University, Korea
  • Byung Heun Cha Department of Biomedical Laboratory Science, Eulji University, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.