Visualization of Frequent Itemsets with Nested Circular Layout and Bundling Algorithm

Abstract : Frequent itemset mining is one of the major data mining issues. Once generated by algorithms, the itemsets can be automatically processed, for instance to extract association rules. They can also be explored with visual tools, in order to analyze the emerging patterns. Graphical itemsets representation is a convenient way to obtain an overview of the global interaction structure. However, when the complexity of the database increases, the network may become unreadable. In this paper, we propose to display itemsets on concentric circles, each one being organized to lower the intricacy of the graph through an optimization process. Thanks to a graph bundling algorithm, we finally obtain a compact representation of a large set of itemsets that is easier to exploit. Colors accumulation and interaction operators facilitate the exploration of the new bundle graph and to illustrate how much an itemset is supported by the data.
Type de document :
Chapitre d'ouvrage
Advances in Visual Computing, 8034, Springer, pp.396-405, 2013, Lecture Notes in Computer Science, 978-3-642-41938-6. 〈10.1007/978-3-642-41939-3_38〉
Liste complète des métadonnées

https://hal-enac.archives-ouvertes.fr/hal-01096106
Contributeur : Laurence Porte <>
Soumis le : mardi 16 décembre 2014 - 17:35:31
Dernière modification le : mercredi 23 mai 2018 - 17:58:06

Lien texte intégral

Identifiants

Collections

Citation

Gwenael Bothorel, Mathieu Serrurier, Christophe Hurter. Visualization of Frequent Itemsets with Nested Circular Layout and Bundling Algorithm. Advances in Visual Computing, 8034, Springer, pp.396-405, 2013, Lecture Notes in Computer Science, 978-3-642-41938-6. 〈10.1007/978-3-642-41939-3_38〉. 〈hal-01096106〉

Partager

Métriques

Consultations de la notice

114