DocumentCode :
2001120
Title :
An New Algorithm of Association Rule Mining
Author :
Gao, Jun
Author_Institution :
Shanghai Inst. of Technol., Shanghai, China
Volume :
2
fYear :
2008
fDate :
13-17 Dec. 2008
Firstpage :
117
Lastpage :
121
Abstract :
Efficiency is critical to data mining algorithm. Based on fully analyzing the PF_growth, an association rule mining algorithm, we in this paper give a new association rule mining algorithm called MFP. MFP algorithm converts a transaction database to an MFP_tree through scanning the transaction database only once, then prune the tree and at last mine the tree. Because the MFP algorithm scans a transaction database one time less than the FP_growth algorithm, the MFP algorithm is more efficient under certain conditions.
Keywords :
data mining; transaction processing; tree data structures; MFP algorithm; association rule mining; data mining; transaction database; tree data structure; Algorithm design and analysis; Association rules; Computational intelligence; Costs; Data mining; Data security; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security, 2008. CIS '08. International Conference on
Conference_Location :
Suzhou
Print_ISBN :
978-0-7695-3508-1
Type :
conf
DOI :
10.1109/CIS.2008.42
Filename :
4724748
Link To Document :
بازگشت