DocumentCode :
2200901
Title :
A-Close+: An Algorithm for Mining Frequent Closed Itemsets
Author :
Shekofteh, Maryam ; Rahmani, Amir Masoud ; Dezfuli, Mashaallah Abbasi
Author_Institution :
Islamic Azad Univ., Sarvestan
fYear :
2008
fDate :
20-22 Dec. 2008
Firstpage :
638
Lastpage :
642
Abstract :
Association Rule Mining (ARM) is the most essential technique for data mining that mines hidden associations between data in large databases. The most important function of ARM is to find frequent itemsets. Frequent closed itemsets (FCI) is an important condense representation method for frequent itemsets, and because of its importance in recent years, there have been many algorithms implemented for it. One of the most fundamental algorithms for frequent closed itemset is A-close. In this paper, we optimize this algorithm using both optimized techniques "reducing pruning time" and "reducing database size", called "A-close+"..Results show that the performance cost of our algorithm is considerably less than A-close.
Keywords :
data mining; very large databases; A-Close+; association rule mining; condense representation method; data mining; frequent closed itemsets; hidden associations; itemsets mining; large databases; optimized techniques; Association rules; Costs; Dairy products; Data mining; Itemsets; Nuclear and plasma sciences; Physics computing; Transaction databases; association rule mining; frequent closed itemsets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-0-7695-3489-3
Type :
conf
DOI :
10.1109/ICACTE.2008.135
Filename :
4737035
Link To Document :
بازگشت