원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
Vol.9 No.3
2016.03
pp.87-94
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
In data mining one of the challenging problems is how to handle high dimensional and complex datasets. Decision trees when applied to high dimensional and complex datasets produce decision trees which are very complex in nature and thereby reducing generalization. To address this issue we propose an algorithm know as Radom Matrix Projection with Outlier Detection (RMPOD). The proposed algorithm is validated on 24 UCI datasets against accuracy and tree size metrics. The results of the proposed algorithm with compared algorithm suggest an improvement in accuracy and tree size for better generalization.
목차
Abstract
1. Introduction
2. Literature Review
3. Radom Matrix Projection with Outlier Detection (RMPOD)
4. Experimental Design and Algorithms Compared
5. Results and Discussions
6. Conclusion
Acknowledgments
References
1. Introduction
2. Literature Review
3. Radom Matrix Projection with Outlier Detection (RMPOD)
4. Experimental Design and Algorithms Compared
5. Results and Discussions
6. Conclusion
Acknowledgments
References
저자정보
참고문헌
자료제공 : 네이버학술정보
