Building a Decision Tree Model for Campus Information Score Based on the Algorithm C5.0

Abstract:

Network technology accelerates the development of educational information, campus portal building is considered as an important part of it in every university, almost all information of teaching and research appeared on the web. Meanwhile, the utilization rate of some websites was lower in university, information was updated slowly, information classifications were complex and not standardized on a platform. They didn’t emphasis on using and sharing but building and developing, and this phenomenon was widespread. So the paper proposed a decision tree model for score sorting information based on C5.0 algorithm, setting up a statistical model for data mining by adding a line weight value for portal information. Finally, the results verify the correctness and science of the model by giving an example.

• Periodical: Applied Mechanics and Materials (Volumes 719-720)
• Pages: 805-811
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.719-720.805
• Online since: January 2015
• Authors: Cong Lin Ran*, Xiao Jing Wang
• Keywords: C5.0, Data Mining, Decision Tree, Score

References

[1] Ma Hua.: Promote the process of education information-Improved small-scale website information channels Campus. p.31–32. China Education Info, Beijing (2003).

[2] Provost F, Kolluri V.: A survey of methods for scaling up inductive algorithms. vol. 3, p.132–169. Data Mining and Knowledge Discovery (1999).

[3] Pan Zheng-gao, Hou Chuan-yu, Tan Cheng-fang,: Text categorization of Web news based on named entity. Vol. 34, p.1178–1180. Journal of Hefei University of Technology, Anhui (2011).

[4] BAI J S, FAN B, XUE J Y .: Knowledge representation and acquisition approach based on decision tree. 2003 IEEE International Conference on Natural Language Processing and Knowledge Engineering.

DOI: 10.1109/nlpke.2003.1275962

[5] Zhang Xingang, Wang Yan.: Investigation on construction and application status of higher educational informationization in Henan Province. Vol. 30, p.110–115. Experimental Technology and Management(2013).

[6] Morgan Kaufmann .: Quinian JR. C4. 5. Programs for Machine Learning. SanMateo, 1993.

[7] Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1): 35–41.

DOI: 10.2307/3033543

[8] Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12): 7821–7826.

DOI: 10.1073/pnas.122653799

[9] Golbeck J, Hendler JA (2004) Reputation network analysis for email filtering. In: Proceedings of the first conference on email and anti-spam (CEAS), Mountain View, CA.

[10] Golub GH, van Van Loan CF (1996) Matrix computations, 3rd edn. The Johns Hopkins University Press, Baltimore, MD.

[11] Gomes LH, Castro FDO, Almeida RB, Bettencourt LMA, Almeida VAF, Almeida JM (2005) Improving spam detection based on structural similarity. Computing Research Repository (CoRR) abs/cs/0504012.

[12] Gomez JC, Boiy E, Moens M-F (2012) Highly discriminative statistical features for email classification. Knowl Inf Syst 31(3): 23–57.

DOI: 10.1007/s10115-011-0403-7