Các bài báo công bố quốc tế

Phuong-Thanh La, Bac Le, Bay Vo; Incrementally building frequent closed itemset lattice; Expert Systems with Applications, Vol. 41 (2014), pp. 2703–2712 (SCIE).

Abstract

A concept lattice is an ordered structure between concepts. It is particularly effective in mining association rules. However, a concept lattice is not efficient for large databases because the lattice size increases with the number of transactions. Finding an efficient strategy for dynamically updating the lattice is an important issue for real-world applications, where new transactions are constantly inserted into databases. To build an efficient storage structure for mining association rules, this study proposes a method for building the initial frequent closed itemset lattice from the original database. The lattice is updated when new transactions are inserted. The number of database rescans over the entire database is reduced in the maintenance process. The proposed algorithm is compared with building a lattice in batch mode to demonstrate the effectiveness of the proposed algorithm.

Keywords

Data mining; Incremental mining; Iceberg lattice; Frequent closed itemsets