earticle

논문검색

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

초록

영어

With the advent of big data, data mining is more increasingly utilized in various decision-making fields by extracting hidden and meaningful information from large amounts of data. Even as exponential increase of the request of unrevealing the hidden meaning behind data, it becomes more and more important to decide to select which data mining algorithm and how to use it. There are several mainly used data mining algorithms in biology and clinics highlighted; Logistic regression, Neural networks, Supportvector machine, and variety of statistical techniques. In this paper it is attempted to compare the classification performance of an exemplary algorithm J48 and REPTree of ML algorithms. It is confirmed that more accurate classification algorithm is provided by the performance comparison results. More accurate prediction is possible with the algorithm for the goal of experiment. Based on this, it is expected to be relatively difficult visually detailed classification and distinction.

목차

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

저자정보

  • Hoon Jin Dept. of Computer Engineering, Sungkyunkwan University, Korea
  • Yong Gyu Jung Department of Medical IT Marketing, Eulji University, Korea

참고문헌

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

    함께 이용한 논문

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

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