Research on Algorithm in Association Rule in an Early Warning System of College Students


Article Preview

The student early warning is a type of the problem that involves intelligence factor and non-intelligence factor and indetermination factor, the challenge lies in ascertaining early-warning factor. In this paper, basing on analyzing association rule and the principle of Apriori algorithm, a new Apriori algorithm has been designed for solving complexity of predictors in an early warning system of college students. At first, make sure the count K of item gathering the largest frequent itemset. Then directly make the largest frequent itemset LK by the items, whose count of item is larger than K or equal to K. We can acquire the k-1、k-2 frequent itemset with the same method. We carry on an experiment on the new algorithm. As a result, the efficiency of the new Algorithm is raised obviously. And along with data quantity aggrandizement, the time consumed changes inconspicuously. That is to say the algorithm keeps very high efficiency.



Key Engineering Materials (Volumes 460-461)

Edited by:

Yanwen Wu




L. J. Zhou et al., "Research on Algorithm in Association Rule in an Early Warning System of College Students", Key Engineering Materials, Vols. 460-461, pp. 445-450, 2011

Online since:

January 2011




[1] R Agrawal, TImielinski, A Swamj. Proceedings of the ACM SIG MOD International Conference on Management of data. Washington DC, (1993), pp.207-216.

[2] Hall P. Beck, William D. Davidson. Research in Higher Education, Vol. 42 (2001), pp.709-723.

[3] Xinzheng Li. Control & Automation, Vol. 3 (2006), pp.193-194.

[4] Ye Zhu, Gaoying Ye. Modern Electronic Technique, Vol. 31 (2008), pp.78-80.

[5] Xiaohong Li, Jin Shang. Computer Science, Vol. 34 (2007), p.1~3.

[6] Lijuan Zhou, Shuang Li. International Asia Conference on Informatics in Control, Automation and Robotics (2010), pp.216-219.

Fetching data from Crossref.
This may take some time to load.