Using disjunctions in association mining

Authors:
Martin Ralbovsky;Tomáš Kuchař
Affiliations:
Department of Information and Knowledge Engineering, University of Economics, Prague, Praha 3, Czech Republic;Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Venue:
ICDM'07 Proceedings of the 7th industrial conference on Advances in data mining: theoretical aspects and applications
Year:
2007

Citing 4
Cited 6

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
Formal logics of discovery and hypothesis formation by machine

Theoretical Computer Science
Logic of Association Rules

Applied Intelligence

Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets

Data & Knowledge Engineering
Semantic Analytical Reports: A Framework for Post-processing Data Mining Results

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
The GUHA method and its meaning for data mining

Journal of Computer and System Sciences
An XML format for association rule models based on the GUHA method

RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
Generalization of association rules through disjunction

Annals of Mathematics and Artificial Intelligence
Key roles of closed sets and minimal generators in concise representations of frequent patterns

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper focuses on usage of disjunction of items in association rules mining. We used the GUHA method instead of the traditional apriori algorithm and enhanced the former implementations of the method with ability of disjunctions setting between items. Experiments were conducted in our Ferda data mining environment on data from the medical domain. We found strong and meaningful association rules that could not be obtained without the usage of disjunction.