Treffer: Towards better understanding of frequent itemset relationships through tree-like data structures

Title:
Towards better understanding of frequent itemset relationships through tree-like data structures
Source:
Expert systems with applications. 42(3):1717-1729
Publisher Information:
Amsterdam: Elsevier, 2015.
Publication Year:
2015
Physical Description:
print, 3/4 p
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
University of Zagreb, Faculty of Electrical Engineering and Computing, Unska 3, 10000 Zagreb, Croatia
ISSN:
0957-4174
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.28928486
Database:
PASCAL Archive

Weitere Informationen

A common goal of descriptive data mining techniques is presenting new information in concise, easily interpretable and understandable ways. In this paper we propose a technique for modeling relationships between frequent itemsets through visually descriptive tree-like data structures. We define and discuss algorithms for forming these structures as well as suggest new measures for evaluating their informative value. We also present our visualization tool which implements proposed concepts and solutions. Finally, we apply our research on two different dataset types and discuss the results. The first dataset proves the applicability of our visualization technique for common market basket analysis. The second dataset is an example of a dense dataset, a troublesome type for frequent itemset mining since it commonly produces a significantly large number of frequent itemsets. We demonstrate a modified variant of our technique which allows efficient visual representation of such datasets as well.