DocumentCode
2924330
Title
EMIA: A new efficient algorithm for indirect associations mining
Author
Lin, Wen-Yang ; Chen, Yi-Ching
Author_Institution
Dept. of Comp. Sci. & Inf. Eng., Nat. Univ. of Kaohsiung, Kaohsiung, Taiwan
fYear
2011
fDate
8-10 Nov. 2011
Firstpage
404
Lastpage
409
Abstract
Indirect association is a new type of infrequent pattern, which is to “indirectly” connect two rarely co-occurred items via a frequent itemset called mediator, and if appropriately utilized it can help to identify real interesting “infrequent itempairs” from databases. In this paper, we propose a new efficient algorithm, namely EMIA, for mining indirect associations. The proposed EMIA algorithm improves the deficiency of the leading algorithm HI-mine*, alleviating unnecessary data transforming processes, thus can generate all indirect associations more efficiently using less memory storage. Experiments on both synthetic and real datasets are also made to show the effectiveness of the proposed approaches.
Keywords
data mining; HI-mine* algorithm; data transforming process; efficient mining of indirect association; frequent itemset; infrequent itempairs; infrequent pattern; mediator; Algorithm design and analysis; Data mining; Data structures; Indexes; Itemsets; Memory management; Data mining; indirect association; infrequent pattern; mediator;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2011 IEEE International Conference on
Conference_Location
Kaohsiung
Print_ISBN
978-1-4577-0372-0
Type
conf
DOI
10.1109/GRC.2011.6122631
Filename
6122631
Link To Document