Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Probabilistic evaluation of counterfactual queries
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bayesian Networks for Data Mining
Data Mining and Knowledge Discovery
Data Mining and Knowledge Discovery
A Bayesian approach to learning causal networks
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
A template model for multidimensional inter-transactional association rules
The VLDB Journal — The International Journal on Very Large Data Bases
Data mining of Bayesian networks using cooperative coevolution
Decision Support Systems
Information Sciences—Informatics and Computer Science: An International Journal
ACM Transactions on Database Systems (TODS)
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Causal Subgroup Analysis for Detecting Confounding
Applications of Declarative Programming and Knowledge Management
Information Sciences: an International Journal
The Journal of Machine Learning Research
Search bound strategies for rule mining by iterative deepening
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
A rough set approach to mining connections from information systems
Proceedings of the 2010 ACM Symposium on Applied Computing
A rough set approach to multiple dataset analysis
Applied Soft Computing
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Mining interesting XML-enabled association rules with templates
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Towards association rules with hidden variables
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An approach to mining local causal relationships from databases
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Automatic construction of bayesian networks for conversational agent
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
A method for assessing influence relationships among KPIs of service systems
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
TaPP'13 Proceedings of the 5th USENIX conference on Theory and Practice of Provenance
Proceedings of the 5th USENIX Workshop on the Theory and Practice of Provenance
From Association Analysis to Causal Discovery
Proceedings of Workshop on Machine Learning for Sensory Data Analysis
Software project risk analysis using Bayesian networks with causality constraints
Decision Support Systems
Causality-based cost-effective action mining
Intelligent Data Analysis
Hi-index | 0.00 |
Mining for association rules in market basket data has proved a fruitful area of research. Measures such as conditional probability (confidence) and correlation have been used to infer rules of the form “the existence of item A implies the existence of item B.” However, such rules indicate only a statistical relationship between A and B. They do not specify the nature of the relationship: whether the presence of A causes the presence of B, or the converse, or some other attribute or phenomenon causes both to appear together. In applications, knowing such causal relationships is extremely useful for enhancing understanding and effecting change. While distinguishing causality from correlation is a truly difficult problem, recent work in statistics and Bayesian learning provide some avenues of attack. In these fields, the goal has generally been to learn complete causal models, which are essentially impossible to learn in large-scale data mining applications with a large number of variables.In this paper, we consider the problem of determining casual relationships, instead of mere associations, when mining market basket data. We identify some problems with the direct application of Bayesian learning ideas to mining large databases, concerning both the scalability of algorithms and the appropriateness of the statistical techniques, and introduce some initial ideas for dealing with these problems. We present experimental results from applying our algorithms on several large, real-world data sets. The results indicate that the approach proposed here is both computationally feasible and successful in identifying interesting causal structures. An interesting outcome is that it is perhaps easier to infer the lack of causality than to infer causality, information that is useful in preventing erroneous decision making.