Learning Functional Dependency Networks Based on Genetic Programming

Authors:
Wing-Ho Shum;Kwong-Sak Leung;Man-Leung Wong
Affiliations:
Chinese University of Hong Kong;Chinese University of Hong Kong;Lingnan University
Venue:
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Year:
2005

Citing 7
Cited 0

Bayesian Network Refinement Via Machine Learning Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Data Mining and Knowledge Discovery with Evolutionary Algorithms

Data Mining and Knowledge Discovery with Evolutionary Algorithms
Gaussian Process Networks

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
B-Course: A Web Service for Bayesian Data Analysis

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Evolutionary program induction directed by logic grammars

Evolutionary Computation
Learning Bayesian networks from incomplete data with stochastic search algorithms

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
An efficient data mining method for learning Bayesian networks using an evolutionary algorithm-based hybrid approach

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle discrete values only; it cannot handle continuous, interval and ordinal ones, which must be converted to discrete values and the order information is lost. Thus, BN tends to have higher network complexity and lower understandability. In this paper, we present a novel dependency network which can handle discrete, continuous, interval and ordinal values through functions; it has lower network complexity and stronger expressive power; it can represent any kind of relationships; and it can incorporate a-priori knowledge though user-defined functions. We also propose a novel Genetic Programming (GP) to learn dependency networks. The novel GP does not use any knowledge-guided nor application-oriented operator, thus it is robust and easy to replicate. The experimental results demonstrate that the novel GP can successfully discover the target novel dependency networks, which have the highest accuracy and the lowest network complexity.