Finding Causal Patterns from Frequent Itemsets

L. Xiao, Z. Chen, Qiuming Zhu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Mining association rules in transaction databases has received much attention in the field of data mining. Although progress has been made on techniques of mining association rules, the results often only indicate the mutual correlative relationships among the frequent items, paying no attention to the directional, or causal relations. For example, when a data set indicates an association between items A and B, it is often not clear whether the access of A caused the access of B, or the converse. In real world applications, however, knowing such causal relations is extremely useful for decision support. People would not only be interested in the facts that A and B are related, but also in the possible sequences and directions among the items. Mining transaction databases for this kind of knowledge offers the potential for deep analysis of business situations and finding strategies of operation. In this paper, we employ a Bayesian approach to mining causal relations from frequent itemsets. The results of our research include two algorithms based on Bayesian statistics model: a serial and diverging connection discovery algorithm (SDCD) and a converging connection discovery algorithm (CCD). Experimental results indicate that the performance of the algorithms is scalable.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
Pages442-445
Number of pages4
StatePublished - Dec 1 2002
EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
Duration: Mar 8 2002Mar 13 2002

Publication series

NameProceedings of the Joint Conference on Information Sciences
Volume6

Conference

ConferenceProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
CountryUnited States
CityResearch Triange Park, NC
Period3/8/023/13/02

Fingerprint

Association rules
Data mining
Statistics
Industry

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Xiao, L., Chen, Z., & Zhu, Q. (2002). Finding Causal Patterns from Frequent Itemsets. In J. H. Caulfield, S. H. Chen, H. D. Cheng, R. Duro, J. H. Caufield, S. H. Chen, H. D. Cheng, R. Duro, ... V. Honavar (Eds.), Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 (pp. 442-445). (Proceedings of the Joint Conference on Information Sciences; Vol. 6).

Finding Causal Patterns from Frequent Itemsets. / Xiao, L.; Chen, Z.; Zhu, Qiuming.

Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. ed. / J.H. Caulfield; S.H. Chen; H.D. Cheng; R. Duro; J.H. Caufield; S.H. Chen; H.D. Cheng; R. Duro; V. Honavar. 2002. p. 442-445 (Proceedings of the Joint Conference on Information Sciences; Vol. 6).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xiao, L, Chen, Z & Zhu, Q 2002, Finding Causal Patterns from Frequent Itemsets. in JH Caulfield, SH Chen, HD Cheng, R Duro, JH Caufield, SH Chen, HD Cheng, R Duro & V Honavar (eds), Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. Proceedings of the Joint Conference on Information Sciences, vol. 6, pp. 442-445, Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002, Research Triange Park, NC, United States, 3/8/02.
Xiao L, Chen Z, Zhu Q. Finding Causal Patterns from Frequent Itemsets. In Caulfield JH, Chen SH, Cheng HD, Duro R, Caufield JH, Chen SH, Cheng HD, Duro R, Honavar V, editors, Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. 2002. p. 442-445. (Proceedings of the Joint Conference on Information Sciences).
Xiao, L. ; Chen, Z. ; Zhu, Qiuming. / Finding Causal Patterns from Frequent Itemsets. Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002. editor / J.H. Caulfield ; S.H. Chen ; H.D. Cheng ; R. Duro ; J.H. Caufield ; S.H. Chen ; H.D. Cheng ; R. Duro ; V. Honavar. 2002. pp. 442-445 (Proceedings of the Joint Conference on Information Sciences).
@inproceedings{5f4ac088b6ae4323ba3abebcaf89eee0,
title = "Finding Causal Patterns from Frequent Itemsets",
abstract = "Mining association rules in transaction databases has received much attention in the field of data mining. Although progress has been made on techniques of mining association rules, the results often only indicate the mutual correlative relationships among the frequent items, paying no attention to the directional, or causal relations. For example, when a data set indicates an association between items A and B, it is often not clear whether the access of A caused the access of B, or the converse. In real world applications, however, knowing such causal relations is extremely useful for decision support. People would not only be interested in the facts that A and B are related, but also in the possible sequences and directions among the items. Mining transaction databases for this kind of knowledge offers the potential for deep analysis of business situations and finding strategies of operation. In this paper, we employ a Bayesian approach to mining causal relations from frequent itemsets. The results of our research include two algorithms based on Bayesian statistics model: a serial and diverging connection discovery algorithm (SDCD) and a converging connection discovery algorithm (CCD). Experimental results indicate that the performance of the algorithms is scalable.",
author = "L. Xiao and Z. Chen and Qiuming Zhu",
year = "2002",
month = "12",
day = "1",
language = "English (US)",
isbn = "0970789017",
series = "Proceedings of the Joint Conference on Information Sciences",
pages = "442--445",
editor = "J.H. Caulfield and S.H. Chen and H.D. Cheng and R. Duro and J.H. Caufield and S.H. Chen and H.D. Cheng and R. Duro and V. Honavar",
booktitle = "Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002",

}

TY - GEN

T1 - Finding Causal Patterns from Frequent Itemsets

AU - Xiao, L.

AU - Chen, Z.

AU - Zhu, Qiuming

PY - 2002/12/1

Y1 - 2002/12/1

N2 - Mining association rules in transaction databases has received much attention in the field of data mining. Although progress has been made on techniques of mining association rules, the results often only indicate the mutual correlative relationships among the frequent items, paying no attention to the directional, or causal relations. For example, when a data set indicates an association between items A and B, it is often not clear whether the access of A caused the access of B, or the converse. In real world applications, however, knowing such causal relations is extremely useful for decision support. People would not only be interested in the facts that A and B are related, but also in the possible sequences and directions among the items. Mining transaction databases for this kind of knowledge offers the potential for deep analysis of business situations and finding strategies of operation. In this paper, we employ a Bayesian approach to mining causal relations from frequent itemsets. The results of our research include two algorithms based on Bayesian statistics model: a serial and diverging connection discovery algorithm (SDCD) and a converging connection discovery algorithm (CCD). Experimental results indicate that the performance of the algorithms is scalable.

AB - Mining association rules in transaction databases has received much attention in the field of data mining. Although progress has been made on techniques of mining association rules, the results often only indicate the mutual correlative relationships among the frequent items, paying no attention to the directional, or causal relations. For example, when a data set indicates an association between items A and B, it is often not clear whether the access of A caused the access of B, or the converse. In real world applications, however, knowing such causal relations is extremely useful for decision support. People would not only be interested in the facts that A and B are related, but also in the possible sequences and directions among the items. Mining transaction databases for this kind of knowledge offers the potential for deep analysis of business situations and finding strategies of operation. In this paper, we employ a Bayesian approach to mining causal relations from frequent itemsets. The results of our research include two algorithms based on Bayesian statistics model: a serial and diverging connection discovery algorithm (SDCD) and a converging connection discovery algorithm (CCD). Experimental results indicate that the performance of the algorithms is scalable.

UR - http://www.scopus.com/inward/record.url?scp=1642357499&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1642357499&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0970789017

SN - 9780970789013

T3 - Proceedings of the Joint Conference on Information Sciences

SP - 442

EP - 445

BT - Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002

A2 - Caulfield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Caufield, J.H.

A2 - Chen, S.H.

A2 - Cheng, H.D.

A2 - Duro, R.

A2 - Honavar, V.

ER -