• Aucun résultat trouvé

Iterative bayesian network implementation by using annotated association rules

N/A
N/A
Protected

Academic year: 2022

Partager "Iterative bayesian network implementation by using annotated association rules"

Copied!
1
0
0

Texte intégral

(1)

Iterative bayesian network implementation by using annotated association rules

Cl´ement Faur´e1,2, Sylvie Delprat1, Jean-Fran¸cois Boulicaut2, and Alain Mille3

1 EADS CCR, Learning Systems Department, Centreda 1, F-31700 Blagnac, {clement.faure, sylvie.delprat}@eads.net

2 LIRIS UMR 5205, INSA Lyon, Bˆatiment Blaise Pascal, F-69621 Villeurbanne

3 LIRIS UMR 5205, Universit´e Lyon 1, Nautibus, F-69622 Villeurbanne {amille, jboulica}@liris.cnrs.fr

Abstract. This paper concerns the iterative implementation of a knowl- edge model in a data mining context. The proposed approach relies on coupling a bayesian network design with an association rule discovery technique. First, discovered association rule relevancy is enhanced by exploiting the expert knowledge encoded within a bayesian network, i.e., avoiding to provide trivial rules w.r.t. the available expertise. Moreover, the bayesian network can be updated thanks to an expert-driven annota- tion process on computed association rules. Our approach is experimen- tally validated on both synthetic and real data. We sketch a practical case study for which the data report on operational interruptions in the aeronautic industry.

1 Introduction

One major goal of the knowledge discovery from databases (KDD) community is to support the discovery of valuable information or patterns within the data. In the so-called transactional data sets (say 0/1 data), the association rule mining technique is quite popular. It has been studied extensively from the computa- tional perspective. Many researchers have been considered the relevancy as well.

Clearly, valuable patterns have to be valid statements (e.g., w.r.t. some objective interestingness criteria like confidence or lift). It is also needed that we support the discovery of useful ones w.r.t. expert expectation, i.e., the so-called subjective interestingness criteria. In this research, we consider that expert expectation is related to novelty, i.e., patterns like association rules are valuable if they provide some information which is somehow new given the encoded domain knowledge.

Furthermore, the encoded knowledge for Processnmight be updated for Process n+ 1 by using the expert-driven annotation of the relevancy for the patterns extracted during Processn. More concretely, we focus on association rule mining when a bayesian network (BN) captures domain knowledge. Given the BN, some extracted rules can be filtered out. Then, we suggest to perform an expert-driven annotation of the presented rules and these annotations are then used to per- form updates on the BN. Doing so, we propose a methodology which iteratively

Références

Documents relatifs

This model is used to classify images and automatically extend existing annotations to new images by taking into account semantic relations be- tween keywords.. The proposed method

We use Disassembly Petri Nets (DPN) to model the disassembly process. Briefly, the DPN clearly describe the precedence constraints between operations in the

According to (Rubin, 1976), the assumptions about the missing data mechanisms may be classified into three categories : 1) missing completely at random (MCAR) : the probability that

In contrast, although the initial search queries of downloaders located at hubs not connected to the up- loader were submitted earlier (e.g., H4 in Figure 1), these downloaders

Having a set of known data - chemical indicators of pollution and immunological parameters, we need to determine the effect of pollution on the performance

The body of the business rule executes the requested action – returns the result of the classification task in suitable form (set of attributes with values,

The proposed approach consists in using the association rules for the enrichment of an existing ontology, by applying the Apriori algorithm.. Our approach goes through the

In order to obtain distance-based association rules, one could use the Apriori algorithm to mine all association rules whose supports and confidences satisfy the thresholds, and