Schema design for causal law mining from incomplete database

Kazunori Matsumoto, Kazuo Hashimoto

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

5 Citations (Scopus)

Abstract

The paper describes the causal law mining from an incomplete database. First we extend the definition of association rules in order to deal with uncertain attribute values in records. As Agrawal’s well-know algorithm generates too many irrelevant association rules, a filtering technique based on minimal AIC principle is applied here. The graphic representation of association rules validated by a filter may have directed cycles. The authors propose a method to exclude useless rules with a stochastic test, and to construct Bayesian networks from the remaining rules. Finally, a schem for Causal Law Mining is proposed as an integration of the techniques described in the paper.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages92-102
Number of pages11
Volume1721
ISBN (Print)354066713X, 9783540667131
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event2nd International Conference on Discovery Science, DS 1999 - Tokyo, Japan
Duration: 1999 Dec 61999 Dec 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1721
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Discovery Science, DS 1999
CountryJapan
CityTokyo
Period99/12/699/12/8

Fingerprint

Association rules
Association Rules
Schema
Mining
Bayesian networks
Bayesian Networks
Filtering
Attribute
Filter
Cycle
Design

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Matsumoto, K., & Hashimoto, K. (1999). Schema design for causal law mining from incomplete database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1721, pp. 92-102). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1721). Springer Verlag. https://doi.org/10.1007/3-540-46846-3_9

Schema design for causal law mining from incomplete database. / Matsumoto, Kazunori; Hashimoto, Kazuo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1721 Springer Verlag, 1999. p. 92-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1721).

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

Matsumoto, K & Hashimoto, K 1999, Schema design for causal law mining from incomplete database. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1721, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1721, Springer Verlag, pp. 92-102, 2nd International Conference on Discovery Science, DS 1999, Tokyo, Japan, 99/12/6. https://doi.org/10.1007/3-540-46846-3_9
Matsumoto K, Hashimoto K. Schema design for causal law mining from incomplete database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1721. Springer Verlag. 1999. p. 92-102. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-46846-3_9
Matsumoto, Kazunori ; Hashimoto, Kazuo. / Schema design for causal law mining from incomplete database. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1721 Springer Verlag, 1999. pp. 92-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c12f038b5a0b45a1859f9a16e6cee8d1,
title = "Schema design for causal law mining from incomplete database",
abstract = "The paper describes the causal law mining from an incomplete database. First we extend the definition of association rules in order to deal with uncertain attribute values in records. As Agrawal’s well-know algorithm generates too many irrelevant association rules, a filtering technique based on minimal AIC principle is applied here. The graphic representation of association rules validated by a filter may have directed cycles. The authors propose a method to exclude useless rules with a stochastic test, and to construct Bayesian networks from the remaining rules. Finally, a schem for Causal Law Mining is proposed as an integration of the techniques described in the paper.",
author = "Kazunori Matsumoto and Kazuo Hashimoto",
year = "1999",
doi = "10.1007/3-540-46846-3_9",
language = "English",
isbn = "354066713X",
volume = "1721",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "92--102",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Schema design for causal law mining from incomplete database

AU - Matsumoto, Kazunori

AU - Hashimoto, Kazuo

PY - 1999

Y1 - 1999

N2 - The paper describes the causal law mining from an incomplete database. First we extend the definition of association rules in order to deal with uncertain attribute values in records. As Agrawal’s well-know algorithm generates too many irrelevant association rules, a filtering technique based on minimal AIC principle is applied here. The graphic representation of association rules validated by a filter may have directed cycles. The authors propose a method to exclude useless rules with a stochastic test, and to construct Bayesian networks from the remaining rules. Finally, a schem for Causal Law Mining is proposed as an integration of the techniques described in the paper.

AB - The paper describes the causal law mining from an incomplete database. First we extend the definition of association rules in order to deal with uncertain attribute values in records. As Agrawal’s well-know algorithm generates too many irrelevant association rules, a filtering technique based on minimal AIC principle is applied here. The graphic representation of association rules validated by a filter may have directed cycles. The authors propose a method to exclude useless rules with a stochastic test, and to construct Bayesian networks from the remaining rules. Finally, a schem for Causal Law Mining is proposed as an integration of the techniques described in the paper.

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

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

U2 - 10.1007/3-540-46846-3_9

DO - 10.1007/3-540-46846-3_9

M3 - Conference contribution

AN - SCOPUS:84957807724

SN - 354066713X

SN - 9783540667131

VL - 1721

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 92

EP - 102

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -