With the development and the wide application of DBMS, large-scale database system is popularized in daily life. Data mining is a process of fetching valuable or important information from magnanimous database. Association rules mining is one important research topic of data mining area. Above all most important of all is research on increment association rules mining. In order to renew association rules effectively, the paper introduces the idea of Apriori algorithm; meanwhile it has already analyzed the classic association rule algorithm FUP and IUA, it pointing out its advantages and disadvantages. Finally, it also gives narrative to another improved NIUP and NFUP algorithm. NFUP algorithm joins strong large itemsets into small quantitative of candidate itemsets based on strong large itemsets concept, and adopts early pruning strategy to cut down the times of scanning database.
[1]
Xiao Xin-feng.
The Web Data Mining and Its Application in E-Commerce
,
2007
.
[2]
Xuan Bin.
Application of Web Mining Techniques in E-Commerce
,
2006
.
[3]
Hou Rui.
Improved incremental updating algorithm for association rules
,
2010
.
[4]
Shashi Shekhar,et al.
A join-less approach for co-location pattern mining: a summary of results
,
2005,
Fifth IEEE International Conference on Data Mining (ICDM'05).
[5]
Ian Witten,et al.
Data Mining
,
2000
.
[6]
Richard J. Roiger,et al.
Data Mining: A Tutorial Based Primer
,
2002
.
[7]
Ramakrishnan Srikant,et al.
Fast Algorithms for Mining Association Rules in Large Databases
,
1994,
VLDB.