DisClose: Discovering colossal closed itemsets via a memory efficient compact row-tree

DisClose: Discovering colossal closed itemsets via a memory efficient compact row-tree

A recent focus in itemset mining has been the discovery of frequent itemsets from high-dimensional datasets. With exponentially increasing running time as average row length increases, mining such datasets renders most conventional algorithms impractical. Unfortunately, large cardinality itemsets ar...

Full description

Bibliographic Details
Main Authors: Zulkurnain , N.F., Haglin, David J., Keane, John A
Format: Book Chapter
Language:English
English
Published: Springer Berlin Heidelberg 2013
Subjects:
TK7885 Computer engineering
Online Access:http://irep.iium.edu.my/51446/
http://irep.iium.edu.my/51446/1/DisClose_2013.pdf
http://irep.iium.edu.my/51446/4/51446-DisClose_Discovering_Colossal_Closed_Itemsets-SCOPUS.pdf

Similar Items

Similar Items