Visual post-analysis of association rules
Journal of Visual Languages & ComputingPublished 17 October 2003
Dario Bruzzese, Cristina Davino
Citations21
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
By combining methodological and graphical pruning techniques, AR post-analysis tools are proposed, which will ensure the statistical significance of the AR which were not pruned, while the graphical ones will provide interactive and powerful visualization tools.
Abstract
Association rules (AR) represent a consolidated tool in data mining applications as they are able to discover regularities in large data sets. The information mined by the rules is very often difficult to exploit because of the presence of too many associations where to detect the really relevant logical implications. In this framework, by combining methodological and graphical pruning techniques, AR post-analysis tools are proposed. The methodological techniques will ensure the statistical significance of the AR which were not pruned, while the graphical ones will provide interactive and powerful visualization tools.
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Correspondence Analysis in Practice
2,027 Citations2007Michael Greenacre
The aim of this work is to provide a Discussion of the Foundations of Correspondence Analysis and its Applications to Stability and Inference.
Beyond market baskets
1,287 Citations1997Sergey Brin, Rajeev Motwani +1 more
This work develops the notion of mining rules that identify correlations (generalizing associations), and proposes measuring significance of associations via the chi-squared test for correlation from classical statistics, enabling the mining problem to reduce to the search for a border between correlated and uncorrelated itemsets in the lattice.
Correspondence Analysis in Practice
1,064 Citations2017Michael Greenacre
Finding interesting rules from large sets of discovered association rules
717 Citations1994Mika Klemettinen, Heikki Mannila +3 more
It is shown how a simple formalism of rule templates makes it possible to easily describe the structure of interesting rules, and how a visualization tool interfaces with rule templates.
Mining the most interesting rules
651 Citations1999Roberto J. Bayardo, Rakesh Agrawal
It is argued that by returning a broader set of rules than previous algorithms, these techniques allow for improved insight into the data and support more user-interaction in the optimized rule-mining process.
Pruning and summarizing the discovered associations
424 Citations1999Bing Liu, Wynne Hsu +1 more
The technique first prunes the discovered associations to remove those insignificant associations, and then finds a special subset of the unpruned associations to form a summary of the discovered association rules, which are then called the direction setting rules.
Visualizing association rules for text mining
145 Citations2003Pak Chung Wong, Paul Whitney +1 more
The results indicate that the design can easily handle hundreds of multiple antecedent association rules in a three-dimensional display with minimum human interaction, low occlusion percentage, and no screen swapping.
SSRN Electronic JournalVisual Data Mining with Parallel Coordinates
68 Citations1998Alfred Inselberg
The display of multivariate datasets in parallel coordinates, transforms the search for relations among the variables into a 2-D pattern recognition problem, and is the basis for the application to Visual Data Mining.
Lecture notes in computer scienceVisually Aided Exploration of Interesting Association Rules
58 Citations1999Bing Liu, Wynne Hsu +2 more
This paper proposes a new framework to allow the user to explore the discovered rules to identify those interesting ones, and has two components, an interestingness analysis component, and a visualization component.
Computational StatisticsVisual Comparison of Association Rules
37 Citations2001Heike Hofmann, Adalbert Wilhelm
A new quality measure for association rules, the doc, will be introduced which overcomes some of the problems of support and confidence of association rules and can be visualised even for hundreds of rules in one diagram.
Computational StatisticsStatistical Pruning of Discovered Association Rules
10 Citations2001Dario Bruzzese, Cristina Davino
This paper proposes a three step strategy to select only interesting association rules after the mining process based on the introduction of statistical tests in order to prune logical implications that are not significant.
COMPSTATValidation of association rules by interactive mosaic plots
3 Citations2000Adalbert Wilhelm, Heike Hofmann
Association Rules have been proposed by Agrawal et al. (1993) in the context of market basket analysis to provide an automated process, which could find connections among items, that were not known before, to answer questions like: “which items are likely to be bought together?”.