Summary
Graphical log-linear model search is usually performed by using stepwise procedures in which edges are sequentially added or eliminated from the independence graph. In this paper we implement the search procedure as a genetic algorithm and propose a crossover operator which operates on subgraphs. In a simulation study the proposed procedure is shown to perform better than an automatic backward elimination procedure at the cost of a small increase of computational time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akaike, H. (1973), Information theory and an extension of the maximum likelihood principle. In2nd International Symposium on Information Theory, (eds. B. N. Petrov and F. Csaki), 267–281. Budapest: Akademia Kiado.
Badsberg, J. H. (1991), A guide to CoCo.Technical Report 91-43, Institute for Electronic Systems, University of Aalborg.
Baker, J. (1987), Reducing bias and inefficiency in the selection algorithm. InGenetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms (ed. J. J. Grefenstette), Erlbaum.
Bishop, Y. M., Fienberg, S. andHolland, P. (1975),Discrete Multivariate Analysis, Cambridge, Mass.: M.I.T. Press.
Box, G. E. P. (1957), Evolutionary operation: A method for increasing industrial productivity.J. Roy. Statist. Soc., C 6, 2, 81–101.
Cowell, R. G., Dawid, A. P., Lauritzen, S. L. andSpiegelhalter, D. J. (1999),Probabilistic Networks and Expert Systems. New York: Springer-Verlag.
Darroch, J. N., Lauritzen, S. L. andSpeed, T. P. (1980), Markov fields and log-linear interaction models for contingency tables.Ann. Statist., 11, 3, 724–738.
Dawid, A. P., Lauritzen, S. L. (1993), Hyper Markov laws in the statistical analysis of decomposable graphical models.Ann. Statist., 21, 1272–1317.
Edwards, D. E. (1995),Introduction to Graphical Modelling. New York: Springer-Verlag.
Edwards, D. E. andHavránek, T. (1987), A Fast Model Selection Procedure for Large Families of Models.J. Amer. Statist. Assoc., 82, 205–213.
Goldberg, D. E. (1989),Genetic Algorithms in Search, Optimisation, and Machine Learning. Addison-Wesley.
Holland, J. H. (1975),Adaptation in Natural and Artificial Systems, Ann Arbor: The University of Michigan Press.
Holland, J. H. (1995),Hidden Order, how adaptation builds complexity. Reading: Addison-Wesley Publishing Corporation, Inc.
Larrañaga, P., Murga, R. H., Poza, M. andKuijpers, C. M. H. (1996), Structure learning of Bayesian networks by hybrid genetic algorithms. InLearning from Data: Artificial Intelligence and Statistics V, (eds. D. Fisher and H. Lenz), 165–174. New York: Springer-Verlag.
Lauritzen, S. L. (1996),Graphical Models. Oxford: Oxford University Press.
Malvestuto, F. M. (1996), An axiomatisation of log-linear models with an application to the model-search problem. InLearning from Data: Artificial Intelligence and Statistics V, (eds. D. Fisher and H. Lenz), 175–184. New York: Springer-Verlag.
Mitchell, M. (1996),An Introduction to Genetic Algorithms. M.I.T. Press.
Whittaker, J. (1990),Graphical Models in Applied Multivariate Statistics. Chichester: Whiley.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Poli, I., Roverato, A. A genetic algorithm for graphical model selection. J. Ital. Statist. Soc. 7, 197–208 (1998). https://doi.org/10.1007/BF03178929
Issue Date:
DOI: https://doi.org/10.1007/BF03178929