A Fast Distributed Algorithm for Association Rule Mining Based on Binary Coding Mapping Relation

Association rule mining is an important issue in data mining. The paper proposed an binary system based method to generate candidate frequent itemsets and corresponding supporting counts efficiently, which needs only some operations such as "and", "or" and "xor". Applying this idea in the existed di...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Wuhan University journal of natural sciences Ročník 11; číslo 1; s. 27 - 30
Hlavní autoři: Geng, Chen, Wei-wei, Ni, Yu-quan, Zhu, Zhi-hui, Sun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Department of Computer and Engineering,Southeast University,Nanjing 210096, Jiangsu, China%School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, Jiangsu, China 2006
Témata:
ISSN:1007-1202, 1993-4998
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Association rule mining is an important issue in data mining. The paper proposed an binary system based method to generate candidate frequent itemsets and corresponding supporting counts efficiently, which needs only some operations such as "and", "or" and "xor". Applying this idea in the existed distributed association rule mining al gorithm FDM, the improved algorithm BFDM is proposed. The theoretical analysis and experiment testify that BFDM is effective and efficient.
Bibliografie:frequent itemsets; distributed association rule mining; relation of itemsets-binary data
42-1405/N
TP311.13
distributed association rule mining
relation of itemsets-binary data
frequent itemsets
SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:1007-1202
1993-4998
DOI:10.1007/BF02831698