A Data Science Central Community
In recent years, I proposed three new kinds of data structure to represent itemsets. They are Node-list [1], N-list [2], and Nodeset [3]. They use prefix-tree nodes to represent itemsets instead of the set of tranaction ids.
Since prefix-tree is usually high compressed, Node-list [1], N-list [2], and Nodeset [3] are much shorten than Tidset or diffset, which are two classical vertical representatnion of itemsets. Therefore, for frequent itemset mining, the algorithms based on Node-list,…
Added by Zhi-Hong Deng on April 10, 2014 at 8:13pm — No Comments
© 2021 TechTarget, Inc.
Powered by
Badges | Report an Issue | Privacy Policy | Terms of Service
Most Popular Content on DSC
To not miss this type of content in the future, subscribe to our newsletter.
Other popular resources
Archives: 2008-2014 | 2015-2016 | 2017-2019 | Book 1 | Book 2 | More
Most popular articles