Tai Nguyen So - Vietnam National University, Ha Noi - VNU >
TRƯỜNG ĐẠI HỌC CÔNG NGHỆ >
PTN Micro Nano >
Articles of Universities of Vietnam from Scopus >
Search
|
Please use this identifier to cite or link to this item:
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/12361
|
Title: | Mining traditional association rules using frequent itemsets lattice |
Authors: | Vo B. Le B. |
Keywords: | Association rules Frequent itemsets Frequent itemsets lattice Hash table |
Issue Date: | 2009 |
Publisher: | 2009 International Conference on Computers and Industrial Engineering, CIE 2009 |
Citation: | Volume , Issue , Page 1401-1406 |
Abstract: | There are many methods which have been developed for improvement of time inmining frequent itemsets. However, the methods which deal with the time ofmining association rules were not put in deep research. In reality, in case ofdatabase which contains many frequent itemsets (from ten thousands up tomillions), the time of mining association rules is much larger than that neededfor mining frequent itemsets. In this paper, we present an application oflattice in mining traditional association rules which will reduce greatly thetime for mining rules-our method includes two phases: (1) building frequentitemsets lattice and (2) mining association rules from lattice. We based on theparent-child relationships in lattice to fast discover the association rules.The experiments show that the mining rules from lattice is more effective thanthe direct mining from frequent itemsets using hash table. © 2009 IEEE. |
URI: | http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/12361 |
ISSN: | |
Appears in Collections: | Articles of Universities of Vietnam from Scopus
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|