By Topic

Array-Tree: A persistent data structure to compactly store frequent itemsets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Elena Baralis ; Politecnico di Torino - Dipartimento di Automatica e Informatica, Corso Duca Degli Abruzzi, 24 - 10129 - ITALY ; Tania Cerquitelli ; Silvia Chiusano ; Alberto Grand

Frequent itemset mining discovers correlations among data items in a transactional dataset. A huge amount of itemsets is often extracted, which is usually hard to process and analyze. The efficient management of the extracted frequent itemsets is still an open research issue. This paper presents a new persistent structure, the Array-Tree, that compactly stores frequent itemsets. It is an array-based structure exploiting both prefix-path sharing and subtree sharing to reduce data replication in the tree, thus increasing its compactness. The Array-Tree can be profitably exploited to efficiently query extracted itemsets by enforcing user-defined item or support constraints. Experiments performed on real and synthetic datasets show both the compactness of the Array-Tree data representation and its efficient support to user queries.

Published in:

2010 5th IEEE International Conference Intelligent Systems

Date of Conference:

7-9 July 2010