P. Larra naga, C.M.H. Kuijpers, R.H. Murga, and Y. Yurramendi, `Learning Bayesian network structures by searching for the best ordering with genetic algorithms', IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 26(4), 487--493, (1996).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....using probabilities. Unfortunately, finding the optimal M requires searching through all possible structures, which has been proven to be NP hard (Chickering et al. 11] Although promising results have been obtained using global search techniques (Chickering et al. 12] Larra naga et al. [34], Larra naga et al. 35] Wong et al. 59] their computation cost makes them unfeasible for our problem. We need to find M as fast as possible, so a simple algorithm which returns a good structure, even if it is not optimal, will be preferred. 3 Let Y;Z and W be three disjoint sets of ....

Larra~naga, P., Kuijpers, C.M.H., Murga, R.H., and Yurramendi, Y., Learning Bayesian network structures by searching for the best ordering with genetic algorithms, IEEE T. 24 Syst. Man Cy. A, 26(4), 487-493, 1996.

.... 87] Europhysics Letters, 107] Evolutionary Computation, 112] Future Generation Computer Systems, 117] IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 149] IEEE Transactions on Evolutionary Computing, 69] IEEE Transactions on Systems, Man, and Cybernetics, [60, 116] IEICE Transaction on Information and Systems, 56] Information Sciences, 94] J. Inf. Optimization Sci. India) 163] J. KISS(A) Comput. Syst. Theory (South Korea) 86] J. Korea Inf. Sci. Soc. South Korea) 47] J. Syst. Eng. UK) 26] Journal of Heuristics, 70] Journal of Japanese ....

....J. 138] Kita, Hajime, 24] Klimasauskas, Casimir C. 132] Kobayashi, Shigenobu, 161] Kolen, Antoon, 19] Kopfer, Herbert, 133] Krasnogor, Natalio, 13] Kuang, Lu, 64] Kubota, Naoyuki, 58] Kubota, N. 88] Kuester, Rebecca L. 110] Kuijpers, C. M. H. 93] Kuijpers, Cindy M. H. [60] 14 Genetic algorithms in TSP Kureichick, V. 59] Laarhoven, P. J. M. van, 144] Laporte, G. 70] Larra naga, Pedro, 60] Larra naga, P. 93] Lee, Kang Ku, 47] Lee, Keon Myung, 86] Lee, Kyung Mi, 86] Lee, Seong Whan, 47] Leung, Henry, 52] Leung, K. S. 18] Lidd, Mark L. 134] ....

[Article contains additional citation context not shown here]

Pedro Larra~naga, Cindy M. H. Kuijpers, Roberto H. Murga, and Yosu Yurramendi. Learning Bayesian network structures by searching for best ordering with genetic algorithm. IEEE Transactions on Systems, Man, and Cybernetics, 26(4):487-493, July 1996. ga96aLarranaga.

....using probabilities. Unfortunately, finding the optimal M requires searching through all possible structures, which has been proven to be NP hard (Chickering et al. 11] Although promising results have been obtained using global search techniques (Chickering et al. 12] Larra naga et al. [38], Larra naga et al. 39] Wong et al. 64] their computation cost makes them unfeasible for our problem. We need to find M as fast as possible, so a simple algorithm which returns a good structure, even if it is not optimal, will be preferred. In our implementation Algorithm B (Buntine [8] is ....

P. Larra~naga, C.M.H. Kuijpers, R.H. Murga and Y. Yurramendi, 'Learning Bayesian network structures by searching for the best ordering with genetic algorithms', IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans, 26(4), 487-493, (1996).

.... Electronics, 51, 100] IEEE Transactions on Knowledge and Data Engineering, 303] IEEE Transactions on Magnetics, 398, 456] IEEE Transactions on Neural Networks, 365, 723, 157] IEEE Transactions on Power Systems, 203, 480, 116, 581] IEEE Transactions on Systems, Man, and Cybernetics, [631, 204, 755] IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 150] Image and Vision Computing, 764] Inf. Sci. USA) 96] Information Processing Management, 232] Information Sciences, 623, 744] Int. J. Mod. Phys. C, Phys. Comput. Singapore) 356, 425] ....

....Vladik, 330] Krejsa, Ji r , 60] Kreutz, Martin, 643, 664] KrishnaKumar, K. 31, 413] Krishnamoorthy, C. S. 786] Kr oger, Berthold, 562, 563, 564] Krone, J org, 565] Kueblbeck, C. 453] Kuester, Rebecca L. 236] Kuh, E. S. 481] Kuijpers, C. M. H. 108] Kuijpers, Cindy M. H. [204] Kumar, Anup, 622, 47, 772] Kumar, Sanjay, 417] Kumbla, Kishan K. 395] Kundu, Malay K. 231] Kunt, M. 28] Kusuda, Kazuyuki, 709] Kvasni cka, Vladim r, 486, 90] Kwok, D. P. 566, 567] Kwong, Sam, 100] Lai, L. L. 203] Laine, Tei, 297] Lamont, Gary B. 75] Lane, Alex, 370, 408, ....

[Article contains additional citation context not shown here]

Pedro Larra~naga, Cindy M. H. Kuijpers, Roberto H. Murga, and Yosu Yurramendi. Learning Bayesian network structures by searching for best ordering with genetic algorithm. IEEE Transactions on Systems, Man, and Cybernetics, 26(4):487-493, July 1996. ga96aLarranaga.

.... [264] Fuzzy Systems Artificial Intelligence Reports and Letters, 144] IEEE Transaction on Power Systems, 240] IEEE Transactions on Pattern Analysis and Machine Intelligence, 200] IEEE Transactions on Power Systems, 113, 184, 67] IEEE Transactions on Systems, Man, and Cybernetics, [191] Inf. Syst. Eng. Netherlands) 188] Inform. Autom. Spain) 183, 195] Inform atica y Autom atica (Spain) 173, 242, 251] Int. J. Approx. Reason. USA) 229, 234] Int. J. Electr. Power Energy Syst. UK) 64] Int. J. Power Energy Syst. USA) 169] Int. Numer. Meth. Eng. 259] ....

....Justo, George Fabris, 38] Katebi, M. R. 59] Kateman, Gerrit, 132] Kazarlis, Spyros A. 184] Khator, S. K. 58] Kirner, C. 22, 54] Kitagawa, K. 12] Kok, Joost N. 119] Korel, B. 15] Krahenbuhl, L. 26, 28] Krahenbuhl, L. 48] Krambeck, C. P. 21, 27] Kuijpers, Cindy M. H. [191, 200] Kuijpers, Cindy M. H, 226] Lanchares, J. 170, 214, 221, 225] Larra naga, Pedro, 191, 200, 226] Larranaga, P. 218] Larsen, H. L. 228] Legey, L. F. L. 43] Leiva, S. 236] Le on, H ector Hern andez, 76] Li, Y. 18] Lima, J. L. F. C. 232] Lima, J. 122] Lima, W. C. de, 62] Lobo, ....

[Article contains additional citation context not shown here]

Pedro Larra~naga, Cindy M. H. Kuijpers, Roberto H. Murga, and Yosu Yurramendi. Learning Bayesian network structures by searching for best ordering with genetic algorithm. IEEE Transactions on Systems, Man, and Cybernetics, 26(4):487--493, July 1996. ga96aLarranaga.

.... IEEE Transactions on Power Systems, 89, 116, 129, 153, 161, 206, 228, 233, 247, 283, 343, 667] IEEE Transactions on Reliability, 88] IEEE Transactions on Semiconductor Manufacturing, 397, 854] IEEE Transactions on Signal Processing, 712] IEEE Transactions on Systems, Man, and Cybernetics, [112, 252, 594, 624, 643, 649, 742, 743, 797, 867] IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 248, 391, 505] IEEE Transactions on Systems, Man, and Cybernetics A: Syst. Humans. 522] IEEE Transactions on Systems, Man, and Cybernetics B, Cybernetics, 822, 858] IEEE Transactions on Systems, Man, and ....

....[797] Kovacs, S. 420] Koziel, S. 244] K.Pal, Sankar, 476] Kramer, Stuart C. 722] Krenz, W. C. 576] Kroese, D. P. 723] Krone, A. 724] Kroo, I. M. 660] Kroo, Ilan M. 29] Kuang, Lu, 571] Kubinyi, H. 245] Kubota, Naoyuki, 725, 876] Kubota, N. 901] Kuijpers, Cindy M. H. [252, 730] Kumamaru, K. 692] Kumar, A. 23, 666] Kumar, N. S. Hemant, 316] Kun, Ma, 262, 702] Kundu, S. 421] Kundu, Sourav, 754] Kundu, Sukhamay, 423] Kuo, Cheng Chien, 66] Kuo, Ting, 505, 483] Kuosmanen, Pauli, 243] Kuroda, K. 510] Kusuma, Anthony, 289] Kuzmicz, W. 726] Kvasnicka, ....

[Article contains additional citation context not shown here]

Pedro Larra~naga, Cindy M. H. Kuijpers, Roberto H. Murga, and Yosu Yurramendi. Learning Bayesian network structures by searching for best ordering with genetic algorithm. IEEE Transactions on Systems, Man, and Cybernetics, 26(4):487--493, July 1996. ga96aLarranaga. Bibliography 57

.... Inference and Genetic Algorithms: Previous Works Genetic algorithms have been previously used to solve NP hard problems related with Bayesian belief networks, such as: triangulation of graphs [34] imprecise probabilities propagation [35] estimation of a causal ordering for the variables [36], 37] and learning [38] Given the success of these applications, the NP hardness of the abductive inference problem, and that the problem of performing abductive inference in BBNs is a combinatorial optimization problem, several authors have used genetic algorithms to solve it in an approximate ....

P. Larra~naga, C. Kuijpers, and R. Murga, "Learning-Bayesian network structures by searching for the best ordering with genetic algorithms," IEEE Transactions on System, Man and Cybernetics, vol. 26, no. 4, pp. 487--493, 1996.

....using probabilities. Unfortunately, nding the optimal M requires searching through all possible structures, which has been proven to be NP hard (Chickering et al. 11] Although promising results have been obtained using global search techniques (Chickering et al. 12] Larra naga et al. [38], Larra naga et al. 39] Wong et al. 64] their computation cost makes them unfeasible for our problem. We need to nd M as fast as possible, so a simple 4 Let Y;Z and W be three disjoint sets of variables, then Y is said to be conditionally independent of Z given W, if and only if p(y j z; ....

P. Larra~naga, C.M.H. Kuijpers, R.H. Murga and Y. Yurramendi, 'Learning Bayesian network structures by searching for the best ordering with genetic algorithms', IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans, 26(4), 487-493, (1996).

....i where N ijk and N ij and q i are defined as before. Unfortunately, finding M requires searching through all possible structures, which has been proven to be NP hard (Chickering et al. 21] Although promising results have been obtained 16 using global search techniques (Larra naga et al. [51], Larra naga et al. 52] Etxeberria et al. 28] Chickering et al. 22] Wong et al. 85] their computation cost makes them unfeasible for our problem. We need to find M as fast as possible, so a simple algorithm which returns a good structure, even if it is not optimal, will be preferred. In ....

P. Larra~naga, C.M.H. Kuijpers, R.H. Murga, Y. Yurramendi, Learning Bayesian network structures by searching for the best ordering with genetic algorithms, IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans, 26 (4) (1996) 487-493.

....medio de dichos algoritmos gen eticos, el mejor orden entre las variables, efectu andose la b usqueda en el espacio de ordenes, y utiliz andose para ello operadores gen eticos de cruce y mutaci on ligados al problema del viajante de comercio. V ease para m as detalles, Larra naga y col. 1996) [21]. Otra soluci on al problema, ha consistido en efectuar la b usqueda en el espacio de estructuras posibles de Redes Bayesianas. Para ello, si se asume un orden entre las variables, los operadores habituales de cruce y mutaci on gen eticos resultan ser operadores cerrados Larra naga y col. 1996) ....

Larra~naga, P., Kuijpers, C., Murga, R., and Yurramendi, Y. (1996). Learning Bayesian Network Structures by searching for the best ordering with genetic algorithms. IEEE Transactions on System, Man and Cybernetics, 26, 487-493.

.... [5] Motivated by some of its drawbacks, we will change the greedy search by a genetic algorithm based one [18] Taking into account that K2 needs to be given previously one total ordering between the variables, we will show in the talk how genetic algorithms can search for the best ordering [16]. For a more difficult problem such as the learning from incomplete data we will present one adaptation of the EM algorithm [6] to Bayesian networks. We will introduce the application of the EM for parameter learning done by [19] as well as the more general Bayesian structural ....

P. Larra naga, C.M.H. Kuijpers, R.H. Murga, and Y. Yurramendi, `Learning Bayesian network structures by searching for the best ordering with genetic algorithms', IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 26(4), 487--493, (1996).

....as a problem that resembles the intensively studied Traveling Salesman Problem (TSP) While the TSP problem is assumed to be symmetrical, in this approach to the structure learning of Bayesian Networks the problem is not a symmetrical one, and we search for acyclic orderings. See Larra naga et al. [17] for an empirical evaluation of this approach. 4.3 Experiments The two approaches in which the search has been done in the space of networks structures 7 have been evaluated empirically with a simulation of the ALARM network. For details see Larra naga et al. 15] 16] For these experiments ....

Larra~naga, P., Kuijpers, C., Murga, R., and Yurramendi, Y. (1996): "Learning Bayesian Network Structures by searching for the best ordering with genetic algorithms". IEEE Transactions on System, Man and Cybernetics. Vol. 26, 4, pp. 487-493.

....The mutation operator is not a closed operator. This approach has been evaluated empirically with a simulation of the ALARM network [2] For details see Larra naga et al. 10] 11] Another approach, in which the individuals of the population are orderings, has been proposed by Larra naga et al. [12]. Table 1 shows the number of individuals evaluated in each approach. Obviously, the search space is smaller in the MB and RMB approaches. Here should be table 1 Approach Individuals evaluated 1 Year 2 Years 3 Years CH GA 181051 180961 146813 MB 3343 3371 3284 RMB 3375 3279 3335 5. Predicting ....

P. Larra~naga, C. Kuijpers, R. Murga, and Y. Yurramendi, Learning Bayesian Network Structures by searching for the best ordering with genetic algorithms, in IEEE Transactions on System, Man and Cybernetics 26 (1996) 487-493

No context found.

Larra~naga, P., Kuijpers, C.M.H., Murga, R.H. and Yurramendi, Y. (1996a) Learning Bayesian network structures by searching for the best ordering with genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics (to appear).

No context found.

P. Larra~naga, C. M. H. Kuijpers, R. H. Murga and Y. Yurramendi, Learning Bayesian Networks Structures by Searching for the Best Ordering with Genetic Algorithms, IEEE Transactions on Systems Man and Cybernetics, 26, 7 , 487-493(1996).

No context found.

P. Larra~naga, C. M. H. Kuijpers, R. H. Murga and Y. Yurramendi, Learning Bayesian Networks Structures by Searching for the Best Ordering with Genetic Algorithms, IEEE Transactions on Systems Man and Cybernetics 26, 7, 487-493(1996).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC