Iterative Bayesian network implementation by using annotated association rules

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

Volumn 4248 LNAI, Issue , 2006, Pages 326-333

  Fauré, Clément ^a,b   Delprat, Sylvie ^a   Boulicaut, Jean François ^b   Mille, Alain ^c  

^a AIRBUS GROUP INNOVATIONS   (Germany)

^b CNRS   (France)

^c UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; DATA MINING; DATA STRUCTURES; ITERATIVE METHODS; MATHEMATICAL MODELS;

BAYESIAN NETWORK; KNOWLEDGE MODEL; RULE RELEVANCY;

KNOWLEDGE BASED SYSTEMS;

EID: 33750717816     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11891451_29     Document Type: Conference Paper

References (12)

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining, AAAI Press (1996) 307-328.
2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings CL 2000. Volume 1861 of LNCS., London, UK, Springer-Verlag (2000) 972-986.
3. Boulicaut, J.F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Proceedings PKDD 2000. Volume 1910 of LNCS., Lyon, F, Springer-Verlag (2000) 75-85.
4. Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7(1) (2003) 5-22.
5. Liu, B., Hsu, W., Mun, L.F., Lee, H.: Finding interesting patterns using user expectations. IEEE Transactions on Knowledge and Data Engineering 11(6) (1999) 817-832.
6. Jaroszewicz, S., Simovici, D.A.: Interestingness of frequent itemsets using bayesian networks as background knowledge. Proceedings ACM SIGKDD 2004, New York, USA, ACM Press (2004) 178-186.
7. Fauré, C., Delprat, S., Mille, A., Boulicaut, J.F.: Utilisation des réseaux bayésiens dans le cadre de l'extraction de rg̀les d'association. Proceedings EGC 2006, Lille, F, Cepadues (2006) 569-580 In French.
8. Padmanabhan, B., Tuzhilin, A.: A belief-driven method for discovering unexpected patterns. Proceedings KDD 1998, New York, USA, AAAI Press (1998) 94-100.
9. Padmanabhan, B., Tuzhilin, A.: Small is beautiful: discovering the minimal set of unexpected patterns. Proceedings ACM SIGKDD 2000, Boston, USA, ACM Press (2000) 54-63.
10. Jaroszewicz, S., Scheffer, T.: Fast discovery of unexpected patterns in data, relative to a bayesian network. Proceedings ACM SIGKDD 2005, Chicago, USA, ACM Press (2005) 118-127.
11. Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann (1988).
12. Druzdzel, M.J., Diez, F.: Criteria for combining knowledge from different sources in probabilistic networks (2000).