View(s) :
2 (0 ULiège)
Download(s) :
0 (0 ULiège)
Mining Databases with Multiple Tables : Problems and Perspectives
p. 173-192
Abstract
We consider the problem of discovering patterns from a given logic that are significant (i.e. interesting and sufficiently valid) with respect to a given data set. We first define two types of patterns that extend the notions of query and clause, and we propose new measures of interest and confidence. In this framework, we establish connections between our measures, first-order logic and logics of probability of Halpern. Then, we present mining algorithms based on the generic levelwise search method proposed by Mannila, and discuss implementation issues in a relational database environment. Finally, we offer concluding remarks and suggestions for future research.
Index
Text
References
Bibliographical reference
A. Faye, A. Giacometti, D. Laurent and N. Spyratos, « Mining Databases with Multiple Tables : Problems and Perspectives », CASYS, 6 | 2000, 173-192.
Electronic reference
A. Faye, A. Giacometti, D. Laurent and N. Spyratos, « Mining Databases with Multiple Tables : Problems and Perspectives », CASYS [Online], 6 | 2000, Online since 19 June 2024, connection on 27 December 2024. URL : http://popups.uliege.be/3041-539x/index.php?id=189
Authors
A. Faye
LRI – Université Paris 11 – 91405 Orsay Cedex France
A. Giacometti
LI/E3I – Université de Tours – 3, place J. Jaures – 41000 Blois France
D. Laurent
LRI – Université Paris 11 – 91405 Orsay Cedex France ; LI/E3I – Université de Tours – 3, place J. Jaures – 41000 Blois France
N. Spyratos
LRI – Université Paris 11 – 91405 Orsay Cedex France