Please use this identifier to cite or link to this item:
Title: Minimum description length principle: Generators are preferable to closed patterns
Authors: Li, J.
Li, H.
Wong, L. 
Pei, J.
Dong, G.
Issue Date: 2006
Source: Li, J.,Li, H.,Wong, L.,Pei, J.,Dong, G. (2006). Minimum description length principle: Generators are preferable to closed patterns. Proceedings of the National Conference on Artificial Intelligence 1 : 409-414. ScholarBank@NUS Repository.
Abstract: The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent itemsets, while the closed pattern is the maximum one. As a generator is usually smaller than the closed pattern in cardinality, by the Minimum Description Length Principle, the generator is preferable to the closed pattern in inductive inference and classification. To efficiently discover frequent generators from a large dataset, we develop a depth-first algorithm called Gr-growth. The idea is novel in contrast to traditional breadth-first bottom-up generator-mining algorithms. Our extensive performance study shows that Gr-growth is significantly faster (an order or even two orders of magnitudes when the support thresholds are low) than the existing generator mining algorithms. It can be also faster than the state-of-the-art frequent closed itemset mining algorithms such as FPclose and CLOSET+. Copyright © 2006, American Association for Artificial Intelligence ( All rights reserved.
Source Title: Proceedings of the National Conference on Artificial Intelligence
ISBN: 1577352815
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 13, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.