A Data Science Central Community
In recent years, I proposed three new kinds of data structure to represent itemsets. They are Node-list , N-list , and Nodeset . They use prefix-tree nodes to represent itemsets instead of the set of tranaction ids.
Since prefix-tree is usually high compressed, Node-list , N-list , and Nodeset  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