원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.8 No.4
2015.08
pp.163-170
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
With the rapid development of the 3G network, traditional calculation methods are unable to adapt to the data scene that telecom users' Network access behavior's data scale increase rapidly dozens of TB. The cloud techniques such as Hadoop platform are introduced to solve the data storage problem. The appropriate data mining algorithms are designed from the perspective of practical application. This paper improves the traditional decision tree SPRINT algorithms, proposes a parallel computing program and successfully applies to the Hadoop platform.
목차
Abstract
1. Introduction
2. Design and Implementation of Hadoop Platform
2.1. Basic Design Ideas.
2.2. System Structural Model.
3. Parallelized Layout of Sprint Algorithm
3.1. Main Features of Sprint Method.
3.2. Paralleling Strategy of the Algorithm.
4. Experiment Design and Discussion
4.1. Analysis of rationality.
4.2. Analysis of Effectiveness.
4.3. Analysis of accuracy.
5. Conclusion
References
1. Introduction
2. Design and Implementation of Hadoop Platform
2.1. Basic Design Ideas.
2.2. System Structural Model.
3. Parallelized Layout of Sprint Algorithm
3.1. Main Features of Sprint Method.
3.2. Paralleling Strategy of the Algorithm.
4. Experiment Design and Discussion
4.1. Analysis of rationality.
4.2. Analysis of Effectiveness.
4.3. Analysis of accuracy.
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보