Evolutionary Bayesian Network design for high dimensional experiments

Chemometrics and Intelligent Laboratory Systems

Volumn 135, Issue , 2014, Pages 172-182

  Slanzi, Debora ^a   Poli, Irene ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b EUROPEAN CENTRE FOR LIVING TECHNOLOGY   (Italy)

Author keywords

Design of experiments; Evolutionary Bayesian networks; High dimensional systems; Optimisation; Vesicles self organisation process

Indexed keywords

ARTICLE; BAYES THEOREM; BIOCHEMISTRY; CONTROLLED STUDY; EVOLUTION; EVOLUTIONARY BAYESIAN NETWORK DESIGN; EXPERIMENTAL DESIGN; INTERMETHOD COMPARISON; PERFORMANCE; PRIORITY JOURNAL; SIMULATION;

EID: 84899952640     PISSN: 01697439     EISSN: 18733239     Source Type: Journal    
DOI: 10.1016/j.chemolab.2014.04.013     Document Type: Article

References (67)

1. Georgiou S., Koukouvinos C., Mantas P. On multi-level supersaturated designs. J. Stat. Plan. Infer. 2006, 136(8):2805-2819.
2. Georgiou S.D. Supersaturated designs.a review of their construction and analysis. J. Stat. Plan. Infer. 2012, (0). 10.1016/j.jspi.2012.09.014.
3. Marley C.J., Woods D.C. A comparison of design and model selection methods for supersaturated experiments. Comput. Stat. Data Anal. 2010, 54(12):3158-3167.
4. Sun F., Lin D.K.J., Liu M.Q. On construction of optimal mixed-level supersaturated designs. Ann. Stat. 2011, 39(2):1310-1333.
5. Booth K.H.V., Cox D.R. Some systematic supersaturated designs. Technometrics 1962, 4:489-495.
6. Fedorov V.V. Theory of Optimal Experiments 1972, Academic Press, New York.
7. Nguyen N.K., Miller A.J. A review of some exchange algorithms for constructing discrete D-optimal designs. Comput. Stat. Data Anal. 1992, 14(4):489-498.
8. Ogungbenro K., Graham G., Gueorguieva I., Aarons L. The use of a modified fedorov exchange algorithm to optimise sampling times for population pharmacokinetic experiments. Comput. Methods Prog. Biomed. 2005, 80(2):115-125.
9. Smucker B., Castillo E.D., Rosenberger J.L. Exchange algorithms for constructing model-robust experimental designs. J. Qual. Technol. 2011, 43:29-44.
10. Levy S., Steinberg D. Computer experiments.a review. Adv. Stat. Anal. 2010, 94(4):311-324.
11. Kuhnt S., Steinberg D. Design and analysis of computer experiments. Adv. Stat. Anal. 2010, 94(4):307-309. 10.1007/s10182-010-0143-0.
12. Auder B., Crecy A.D., Iooss B., Marques M. Screening and metamodeling of computer experiments with functional outputs. application to thermalhydraulic computations. Reliab. Eng. Syst. Saf. 2012, 107:122-131.
13. Crapps J., Daniewicz S. A study of combined roughness and plasticity induced fatigue crack closure for long cracks using a modified strip-yield model. Int. J. Fatigue 2012, 43:98-104.
14. Zakharov V., Shamin R. Statistics of rogue waves in computer experiments. JETP Lett. 2012, 96(1):66-69.
15. Mhlenstdt T., Gsling M., Kuhnt S. How to choose the simulation model for computer experiments.a local approach. Appl. Stoch. Model. Bus. Ind. 2012, 28(4):354-361.
16. Sun F., Liu M.Q., Lin D.K.J. Construction of orthogonal Latin hypercube designs. Biometrika 2009, 96(4):971-974.
17. Gu L., Yang J.F. Construction of nearly orthogonal Latin hypercube designs. Metrika 2013, 76(6):819-830.
18. Cawse J. Experimental Design for Combinatorial and High Throughput Material Developments 2003, Springer-Verlag, New York.
19. Pelikan M., Goldberg D., Lobo F. A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 2002, 21(1):5-20.
20. Baragona R., Battaglia F., Poli I. Evolutionary Statistical Procedures 2011, Springer-Verlag, Berlin.
21. Poli R., Kennedy J., Blackwell T. Particle swarm optimization. Swarm Intell. 2007, 1(1):33-57.
22. Forlin M., Slanzi D., Poli I. Combining probabilistic dependency models and particle swarm optimization for parameter inference in stochastic biological systems. Proceedings of the 2011 2nd International Congress on Computer Applications and Computational Science, vol. 145 of Advances in Intelligent and Soft Computing 2012, 437-443. Springer, Berlin Heidelberg. F.L. Gaol, Q.V. Nguyen (Eds.).
23. Cowell R., Dawid A., Lauritzen S., Spiegelhalter D. Probabilistic Networks and Expert Systems 1999, Springer Verlag, New York.
24. Borgelt C., Kruse R. Graphical Models.Methods for Data Analysis and Mining 2002, Wiley & Son, New York.
25. Atkinson A., Donev A., Tobias R. Optimum Experimental Designs, with SAS 2007, Oxford University Press, Oxford, UK.
26. Maruri-Aguilar H., Saenz-de Cabezon E., Wynn H. Betti numbers of polynomial hierarchical models for experimental designs. Ann. Math. Artif. Intell. 2012, 64(4):411-426.
27. Dette H., Melas V.B., Shpilev P. Robust t-optimal discriminating designs. Ann. Stat. 2013, 41(4):1693-1715.
28. Forlin M., Poli I., De March D., Packard N., Gazzola G., Serra R. Evolutionary experiments for self-assembling amphiphilic systems. Chemom. Intell. Lab. Syst. 2008, 90(2):153-160.
29. Caschera F., Gazzola G., Bedau M.A., Bosch Moreno C., Buchanan A., Cawse J., Packard N., Hanczyc M.M. Automated discovery of novel drug formulations using predictive iterated high throughput experimentation. PLoS ONE 2010, 5(1).
30. Cawse J.N., Gazzola G., Packard N. Efficient discovery and optimization of complex high-throughput experiments. Catal. Today 2011, 159(1):55-63.
31. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning 1989, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.
32. Limmun W., Borkowski J.J., Chomtee B. Using a genetic algorithm to generate d-optimal designs for mixture experiments. Qual. Reliab. Eng. Int. 2013, 29(7):1055-1068.
33. Kennedy J., Eberhart R. Particle swarm optimization. IEEE 1995, vol.4:1942-1948.
34. Zemella G., March D.D., Borrotti M., Poli I. Optimised design of energy efficient building facades via evolutionary neural networks. Energy Build. 2011, 43(12):3297-3302.
35. Borrotti M., Poli I. Nave bayes ant colony optimization for experimental design. Synergies of Soft Computing and Statistics for Intelligent Data Analysis, Vol. 190 of Advances in Intelligent Systems and Computing 2013, 489-497. Springer, Berlin Heidelberg. R. Kruse, M.R. Berthold, C. Moewes, M. Gil, P. Grzegorzewski, O. Hryniewicz (Eds.).
36. Jensen F. Bayesian Networks and Decision Graphs 2001, Springer-Verlag, New York.
37. Darwiche A. Modeling and Reasoning with Bayesian Networks 2009, Cambridge University Press, Cambridge, UK.
38. Neapolitan R. Learning Bayesian Networks 2003, Prentice Hall.
39. Yang S., Chang K. Comparison of score metrics for Bayesian network learning. IEEE Trans. Syst. Man Cybern. Syst. Hum. 2002, 32(3):419-428.
40. Liu Z., Malone B., Yuan C. Empirical evaluation of scoring functions for Bayesian network model selection. BMC Bioinforma. 2012, 13(15):1-16.
41. Chow C., Liu C. Approximating discrete probability distributions with dependence trees. IEEE Trans. Inf. Theory 1968, 14(3):462-467.
42. Herskovits E., Cooper G.F. Kutato.an entropy-driven system for construction of probabilistic expert systems from databases. Proceedings of the Sixth conference on Uncertainty in Artificial Intelligence, UAI'90 1990, 54-62. AUAI Press, Cambridge, MA, USA.
43. Lam W., Bacchus F. Learning Bayesian belief networks.An approach based on the MDL principle. Comput. Intell. 1994, 10:269-293.
44. Friedman N., Goldszmidt M. Learning Bayesian networks with local structure. Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, UAI'96 1996, 252-262. Morgan Kaufmann, Reed College, Portland, Oregon, USA.
45. Cooper G., Herskovits E. A Bayesian method for the induction of probabilistic networks from data. Mach. Learn. 1992, 9:309-347.
46. Heckerman D., Geiger D., Chickering D. Learning Bayesian networks.the combinations of knowledge and statistical data. Mach. Learn. 1995, 20:197-243.
47. Daly R., Shen Q., Aitken S. Learning Bayesian networks.approaches and issues. Knowl. Eng. Rev. 2011, 26:99-157.
48. Nagarajan R., Scutari M., Lbre S. Bayesian Networks in R.with Applications in Systems Biology 2013, Springer Publishing Company, Incorporated.
49. Henrion M. Propagating uncertainty in Bayesian networks by probabilistic logic sampling. Uncertainty in Artificial Intelligence 1988, vol. 2:149-163. Elsevier Science Publishing Company, Inc., New York, USA.
50. Rosenbrock H.H. An automatic method for finding the greatest or least value of a function. Comput. J. 1960, 3(3):175-184.
51. Yongjian Y., Yumei L. A new discrete filled function algorithm for discrete global optimization. J. Comput. Appl. Math. 2007, 202(2):280-291.
52. Woon S.F., Rehbock V. A critical review of discrete filled function methods in solving nonlinear discrete optimization problems. Appl. Math. Comput. 2010, 217(1):25-41.
53. Wheeler B. optMonteCarlo. AlgDesign. The R project for statistical computing, R package version 1.1-7 2011.
54. Stocki R. A method to improve design reliability using optimal Latin hypercube sampling. Comput. Assist. Mech. Eng. Sci. 2005, 12:87-105.
55. van Dam E.R., Rennen G., Husslage B. Bounds for maximin Latin hypercube designs. Oper. Res. 2009, 57(3):595-608.
56. Scrucca L. GA.a package for genetic algorithms in R. J. Stat. Softw. 2013, 53(4):1-37.
57. Zambrano-Bigiarini M., Rojas R. A model-independent particle swarm optimisation software for model calibration. Environ. Model Softw. 2013, 43:5-25.
58. Zambrano-Bigiarini M., Rojas R. hydroPSO.Particle Swarm Optimisation, with focus on Environmental Models, R Package Version 0.3-3 2013.
59. Stano P., Carrara P., Kuruma Y., Pereira de Souza T., Luisi P.L. Compartmentalized reactions as a case of soft-matter biotechnology.synthesis of proteins and nucleic acids inside lipid vesicles. J. Mater. Chem. 2011, 21:18887-18902.
60. Pereira de Souza T., Steiniger F., Stano P., Fahr A., Luisi P.L. Spontaneous crowding of ribosomes and proteins inside vesicles.a possible mechanism for the origin of cell metabolism. ChemBioChem 2011, 12(15):2325-2330.
61. Pickett S.D., Green D.V.S., Hunt D.L., Pardoe D.A., Hughes I. Automated lead optimization of MMP-12 inhibitors using a genetic algorithm. ACS Med. Chem. Lett. 2011, 2(1):28-33.
62. Caschera F., Hanczyc M., Rasmussen S. Machine learning for drug design, molecular machines and evolvable artificial cells. Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO'11 2011, 831-832. ACM, New York, NY, USA.
63. Caschera F., Rasmussen S., Hanczyc M. Machine learning optimization of evolvable artificial cells. Proceedings of the 2nd European Future Technologies Conference and Exhibition 2011, Vol. 7 of Procedia Computer Science 2011, 187-189. Elsevier Science. E. Giacobino, R. Pfeifer (Eds.).
64. Bedau M.A., Buchanan A., Gazzola G., Hanczyc M., Maeke T., Mccaskill J., Poli I., Packard N.H. Evolutionary design of a DDPD model of ligation. Lecture Notes in Computer Science 3871 2005, 201-212. Springer.
65. Theis M., Gazzola G., Forlin M., Poli I., Hanczyc M., Bedau M. Optimal formulation of complex chemical systems with a genetic algorithm. ECCS06 online Proceedings, Oxford 2006, 193-197.
66. Friedman N., Goldszmidt M., Wyner A. Data analysis with Bayesian networks.A bootstrap Approach 1999.
67. Scutari M., Nagarajan R. Identifying significant edges in graphical models of molecular networks. Artif. Intell. Med. 2013, 57(3):207-217.