{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T05:50:26Z","timestamp":1774158626064,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T00:00:00Z","timestamp":1355356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00500-012-0966-6","type":"journal-article","created":{"date-parts":[[2012,12,12]],"date-time":"2012-12-12T06:28:12Z","timestamp":1355293692000},"page":"983-994","source":"Crossref","is-referenced-by-count":40,"title":["An artificial bee colony algorithm for learning Bayesian networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Junzhong","family":"Ji","sequence":"first","affiliation":[]},{"given":"Hongkai","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Chunnian","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,13]]},"reference":[{"key":"966_CR25","unstructured":"Beinlich IA, Suermondt HJ, Chavez RM, Cooper GF (1989) The case study with two probabilistic inference techniques for Bayesian networks. In: Proceedings of the Second European Conference on Artificial Intelligence in Medicine, Springer, Berlin, pp 247\u2013256"},{"issue":"(2","key":"966_CR26","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1007421730016","volume":"29","author":"J Binder","year":"1997","unstructured":"Binder J, Koller D, Russell S, Kanazawa K (1997) Adaptive probabilistic networks with hidden variables. Mach Learn 29 (2):213\u2013244","journal-title":"Mach Learn"},{"key":"966_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(02)00191-1","volume":"137","author":"J Cheng","year":"2002","unstructured":"Cheng J, Greiner R, Kelly J, Bell D, Liu W (2002) Learning belief networks from data: an information theory based approach. Artif Intell 137:43\u201390","journal-title":"Artif Intell"},{"key":"966_CR15","doi-asserted-by":"crossref","unstructured":"Colace F, Santo MD, Vento M (2010) A multiexpert approach for Bayesian network structural learning. In: Proceedings of the 43rd Hawaii International Conference on System Sciences (HICSS \u201910). IEEE Computer Society, Washington, pp 1\u201311","DOI":"10.1109\/HICSS.2010.23"},{"key":"966_CR18","first-page":"309","volume":"9","author":"GF Cooper","year":"1992","unstructured":"Cooper GF, Herskovits E, Bayesian A (1992) Method for the induction of probabilistic networks from data. Mach Learn 9:309\u2013347","journal-title":"Mach Learn"},{"key":"966_CR16","unstructured":"Friedman N, Nachman I, Peer D (1999) Learning bayesian network structure from massive datasets: the \"sparse candidate\" algorithm. In: Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence (UAI\u201999), Morgan Kaufmann Publishers Inc., San Francisco, pp 206\u2013215"},{"key":"966_CR1","unstructured":"Heckerman D (1996) A tutorial on learning Bayesian networks. In: Jordan MI (ed) Learning in graphical models, pp 301\u2013354"},{"issue":"8","key":"966_CR14","first-page":"1274","volume":"37","author":"JZ Ji","year":"2008","unstructured":"Ji JZ, Zhang HX, Hu RB, Liu CN (2008) A Tabu-search based Bayesian network structure learning algorithm. Beijing Gongye Daxue Xuebao 37(8):1274\u20131280","journal-title":"Beijing Gongye Daxue Xuebao"},{"issue":"3","key":"966_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.3724\/SP.J.1004.2009.00281","volume":"35","author":"JZ Ji","year":"2009","unstructured":"Ji JZ, Zhang HX, Hu RB, Liu CN, Bayesian A (2009) Network learning algorithm based on independence test and ant colony optimization. Acta Autom Sinica 35(3):281\u2013288","journal-title":"Acta Autom Sinica"},{"issue":"4","key":"966_CR17","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1016\/j.asoc.2011.01.009","volume":"11","author":"JZ Ji","year":"2011","unstructured":"Ji JZ, Hu RB, Zhang HX, Liu CN (2011) A hybrid method for learning Bayesian networks based on ant colony optimization. Appl Soft Comput 11(4):3373\u20133384","journal-title":"Appl Soft Comput"},{"key":"966_CR23","doi-asserted-by":"crossref","unstructured":"Ji JZ, Wei HK, Liu CN, Yin BC (2012) A new artificial bee colony algorithm for the 0\u20131 multidimensional knapsack problem. Comput Optim Appl (reviewing)","DOI":"10.1155\/2013\/676275"},{"issue":"1\u20133","key":"966_CR10","first-page":"261","volume":"23","author":"AG Jose","year":"2002","unstructured":"Jose AG, Jose MP (2002) Searching the best elimination sequence in Bayesian networks by using ant colony optimization. Pattern Recognit Lett 23(1\u20133):261\u2013277","journal-title":"Pattern Recognit Lett"},{"key":"966_CR19","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. In: Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005"},{"issue":"2","key":"966_CR20","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(2):687\u2013697","journal-title":"Appl Soft Comput"},{"issue":"1","key":"966_CR22","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132","journal-title":"Appl Math Comput"},{"issue":"9","key":"966_CR7","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1109\/34.537345","volume":"18","author":"P Larranaga","year":"1996","unstructured":"Larranaga P, Poza M, Yurramendi Y, Murga RH, Kuijpers MH (1996) Structure learning of Bayesian networks by genetic algorithms: a performance analysis of control parameters. IEEE Transact Pattern Anal Mach Intell 18(9):912\u2013925","journal-title":"IEEE Transact Pattern Anal Mach Intell"},{"issue":"8","key":"966_CR5","first-page":"916","volume":"38","author":"DY Liu","year":"2001","unstructured":"Liu DY, Wang F, Lu YN, Xue WX, Wang SX (2001) Research on learning Bayesian network structure based on genetic algorithms. J Comput Res Dev 38(8):916\u2013922","journal-title":"J Comput Res Dev"},{"issue":"1","key":"966_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0888-613X(99)00042-0","volume":"24","author":"M Luis","year":"2000","unstructured":"Luis M, Campos D, Huete J (2000) A new approach for learning belief networks using independence criteria. Int J Approx Reason 24(1):11\u201337","journal-title":"Int J Approx Reason"},{"key":"966_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0888-613X(02)00091-9","volume":"31","author":"MC Luis","year":"2002","unstructured":"Luis MC, Juan MF, Jose AG, Jose MP (2002) Ant colony optimization for learning Bayesian networks. Int J Approx Reason 31:291\u2013311","journal-title":"Int J Approx Reason"},{"issue":"4","key":"966_CR12","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/TEVC.2009.2024142","volume":"13","author":"PC Pinto","year":"2009","unstructured":"Pinto PC, Nagele A, Dejori M, Runkler TA, Sousa JMC (2009) Using a local discovery ant algorithm for Bayesian network structure learning. IEEE Transact Evolutionary Comput 13(4):767\u2013778","journal-title":"IEEE Transact Evolutionary Comput"},{"issue":"2","key":"966_CR21","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony (ABC) algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625\u2013631","journal-title":"Appl Soft Comput"},{"issue":"10","key":"966_CR4","first-page":"2237","volume":"82","author":"J Suzuki","year":"1999","unstructured":"Suzuki J (1999) Learning Bayesian belief networks based on the minimum description length principle: basic properties. IEICE Transact Fundam E82(10):2237\u20132245","journal-title":"IEICE Transact Fundam E"},{"issue":"1","key":"966_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","volume":"65","author":"I Tsamardinos","year":"2006","unstructured":"Tsamardinos I, Brown LE, Alieris CF (2006) The max-min hill-climbing Bayesian network structure learning algorithm. Mach Learn 65(1):31\u201378","journal-title":"Mach Learn"},{"key":"966_CR24","unstructured":"VanderMeer RK, Breed MD, Espelie KE, Winston ML (1998) Pheromone communication in social insects, Westview Press, Boulder, pp 3\u201333"},{"issue":"2","key":"966_CR8","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/34.748825","volume":"21","author":"ML Wong","year":"1999","unstructured":"Wong ML, Leung KS (1999) Using evolutionary programming and minimum description length principle for data mining of Bayesian networks. IEEE Transact Pattern Anal Mach Intell 21(2):174\u2013178","journal-title":"IEEE Transact Pattern Anal Mach Intell"},{"issue":"4","key":"966_CR9","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TEVC.2004.830334","volume":"8","author":"ML Wong","year":"2004","unstructured":"Wong ML, Leung KS (2004) An efficient data mining method for learning Bayesian networks using an evolutionary algorithm-based hybrid approach. IEEE Transact Evolutionary Comput 8(4):378\u2013404","journal-title":"IEEE Transact Evolutionary Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0966-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-012-0966-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-012-0966-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T19:41:16Z","timestamp":1562442076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-012-0966-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,13]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["966"],"URL":"https:\/\/doi.org\/10.1007\/s00500-012-0966-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,13]]}}}