Paper Title:
Research on Algorithm in Association Rule in an Early Warning System of College Students
  Abstract

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.

  Info
Periodical
Key Engineering Materials (Volumes 460-461)
Edited by
Yanwen Wu
Pages
445-450
DOI
10.4028/www.scientific.net/KEM.460-461.445
Citation
L. J. Zhou, S. Li, Z. Zhang, "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
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: You Fa Sun, Xiao Xiao Liang, Xu Chong Guo, Cai Yan Liu
Abstract:Algorithm of call auction price is designed according to the determining principles popular in international stock markets. Basing on the...
981
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765