Abstract
Nowadays, Bayesian Networks (BNs) have constituted one of the most complete, self-sustained and coherent formalisms useful for knowledge acquisition, representation and application through computer systems. Yet, the learning of these BNs structures from data represents a problem classified at an NP-hard range of difficulty. As such, it has turned out to be the most exciting challenge in the learning machine area. In this context, the present work’s major objective lies in setting up a further solution conceived to be a remedy for the intricate algorithmic complexity problems imposed during the learning of BN-structure through a massively-huge data backlog. Our present work has been constructed according to the following framework; on a first place, we are going to proceed by defining BNs and their related problems of structure-learning from data. We, then, go on to propose a novel heuristic designed to reduce the algorithmic complexity without engendering any loss of information. Ultimately, our conceived approach will be tested on a car diagnosis as well as on a Lymphography diagnosis data-bases, while our achieved results would be discussed, along with an exposition of our conducted work’s interests as a closing step to this work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nefian, V.: Learning SNP using embedded Bayesian Networks. In: IEEE Computational Systems Bioinformatics Conference (2006)
Cooper, G., Hersovits, E.: A Bayesian method for the induction of probabilistic networks from data. Machine learning 9, 309–347 (1992)
Neapolitan, R.E.: Learning Bayesian Networks. Prentice Hall, Newyork (2003)
Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, 2nd edn. The MIT Press (2000)
Shulin, Y., Chang, K.: Comparison of Score Metrics for Bayesian Network Learning. IEEE Transactions on Systems, Man and Cybernetics-part A: Systems and Humans 32(3), 419–428 (2002)
Bouchaala, L., Masmoudi, A., Gargouri, F., Rebai, A.: Improving algorithm for structure learning in Bayesian Networks using a new implicit score. Expert Systems with Application 37, 5470–5475 (2010)
Mourad, R., Sinoquet, C., Leray, P.: A hierarchical Bayesian Network approach for linkage disequilibrium modelling and data dimensionality reduction prior to genome-wide association studies. BMC Bioinformatics 16 (2011)
Zhang, Y., Ji, L.: Clustering of SNPs by structural EM algorithm. In: Proceeding of International Joint Conference on Bioinformatics. Systems Biology and Intelligent Computing, pp. 147–150 (2009)
Hwang, K.-B., Kim, B.-H., Zhang, B.-T.: Learning Hierarchical Bayesian Networks for Large-Scale Data Analysis. In: King, I., Wang, J., Chan, L.-W., Wang, D. (eds.) ICONIP 2006. LNCS, vol. 4232, pp. 670–679. Springer, Heidelberg (2006)
Mourad, R., Sinoquet, C., Leray, P.: Learning hierarchical Bayesian Networks for genome-wide association studies. In: 19th International Conference on Computational Statistics, COMPSTAT, pp. 549–556 (2010)
Judea, P., Tom, V.: A theory of inferred causation. In: Allen, J., Fikes, R., Sandewall, E. (eds.) KR 1991, Principles of Knowledge Representation and Reasoning, pp. 441–452 (1991)
Robinson, R.W.: Counting unlabeled acyclic digraphs. Combinatorial Mathematics 622, 28–43 (1977)
Tufféry, S.: Data mining et statistique décisionnelle: l’intelligence des données. Editions TECHNIP (2010)
Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recognition Letters 31, 651–666 (2010)
Chavent, M., Kuentz, V., Liquet, B., Saracco, J.: ClustOfVar: an R package for the clustering of variables. In: The R User Conference, University of Warwick Coventry UK (2011)
Chavent, M., Kuentz, V., Saracco, J.: A partitioning method for the clustering of categorical variables. In: Locarek-Junge, H., Weihs, C. (eds.) Classification as a Tool for Research, International Federation of Classification Societies Conference. Springer (2009)
Lerman, I.C.: Likelihood linkage analysis (LLA) classification method: An example treated by hand. Biochimie. 75(5), 379–397 (1993)
Spirtes, P., Glymour, C., Scheines, R.: Causation prediction and search (1993)
Chow, C., Liu, C.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14(3), 462–467 (1968)
Francois, O., Leray, P.: Evaluation d’algorithmes d’apprentissage de structure pour les réseaux bayésiens. In: 14ème Congrès Francophone Reconnaissance des Formes et Intelligence Artificielle, pp. 1453–1460 (2004)
Heckerman, D., Geiger, D., Chickering, M.: Learning Bayesian Networks: The combination of knowledge and statistical data. In: 10th Conference on Uncertainty in Artificial Intelligence, pp. 293–301 (1994)
Kruskal, J.: On the shortest spanning subtree of a graph and traveling salesman problem. The American Mathematical Society 7, 48–50 (1956)
Murphy, K.: The BayesNet Toolbox for Matlab. Computing Science and Statistics: Proceedings of Interface, vol. 33, http://www.ai.mit.edu/~murphyk/Software/BNT/bnt.html
Sprinthall, R.C.: Basic Statistical Analysis, 7th edn. (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouhamed, H., Masmoudi, A., Lecroq, T., Rebaï, A. (2012). A New Learning Structure Heuristic of Bayesian Networks from Data. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2012. Lecture Notes in Computer Science(), vol 7376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31537-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-31537-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31536-7
Online ISBN: 978-3-642-31537-4
eBook Packages: Computer ScienceComputer Science (R0)