Abstract

. 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 varia...

Keywords

Computer scienceCausality (physics)Association rule learningScalabilityMachine learningConverseData miningBayesian probabilityArtificial intelligenceProbabilistic logicData scienceTheoretical computer scienceMathematics

Affiliated Institutions

Related Publications

Publication Info

Year
1998
Type
article
Pages
594-605
Citations
111
Access
Closed

External Links

Citation Metrics

111
OpenAlex

Cite This

Craig Silverstein, Sergey Brin, Rajeev Motwani et al. (1998). Scalable Techniques for Mining Causal Structures. , 594-605.