HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

Contributor : Open Archive Toulouse Archive Ouverte (oatao) Connect in order to contact the contributor
Submitted on : Monday, April 13, 2015 - 8:52:09 AM
Last modification on : Tuesday, March 22, 2022 - 8:47:15 AM
Long-term archiving on: : Monday, September 14, 2015 - 7:20:17 AM


Files produced by the author(s)



Gwenael Bothorel, Mathieu Serrurier, Christophe Hurter. Visualization of Frequent Itemsets with Nested Circular Layout and Bundling Algorithm. International Symposium on Visual Computing - ISVC 2013, Jul 2013, Rethymnon, Greece. pp.396-405, ⟨10.1007/978-3-642-41939-3_38⟩. ⟨hal-01141434⟩



Record views


Files downloads