{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T06:43:52Z","timestamp":1784097832565,"version":"3.55.0"},"reference-count":23,"publisher":"World Scientific Pub Co Pte Ltd","issue":"16","funder":[{"DOI":"10.13039\/501100011710","name":"Shaanxi Provincial Science and Technology Department","doi-asserted-by":"publisher","award":["2019GY-065"],"award-info":[{"award-number":["2019GY-065"]}],"id":[{"id":"10.13039\/501100011710","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2022,11,15]]},"abstract":"<jats:p> Existing Bayesian network (BN) structure learning algorithms based on dynamic programming have high computational complexity and are difficult to apply to large-scale networks. Therefore, this paper proposes a Dynamic Programming BN structure learning algorithm based on Mutual Information, the MIDP (Dynamic Programming Based on Mutual Information) algorithm. The algorithm uses mutual information to build the maximum spanning tree and [Formula: see text]-order matrix, and introduces a penalty coefficient d based on the matrix-based node removal strategy, so as to reduce the number of scoring calculations and time consumption of the algorithm. Simulation results show that, compared with DP, SMDP and MEDP algorithms, the MIDP algorithm can reduce the calculation times and time consumption of algorithm scores while maintaining the accuracy of the algorithm when selecting the appropriate [Formula: see text] value. <\/jats:p>","DOI":"10.1142\/s0218126622501420","type":"journal-article","created":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T03:56:15Z","timestamp":1660881375000},"source":"Crossref","is-referenced-by-count":5,"title":["A Dynamic Programming Bayesian Network Structure Learning Algorithm Based on Mutual Information"],"prefix":"10.1142","volume":"31","author":[{"given":"Zhigang","family":"Lv","sequence":"first","affiliation":[{"name":"School of Mechatronic Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"},{"name":"School of Electronics and Information Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ye","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8755-0763","authenticated-orcid":false,"given":"Ruohai","family":"Di","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongxi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mechatronic Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liangliang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mechatronic Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Xi\u2019an Technological University, Xi\u2019an, Shaanxi 710021, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"S0218126622501420BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2908373"},{"key":"S0218126622501420BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2020.101912"},{"key":"S0218126622501420BIB003","doi-asserted-by":"publisher","DOI":"10.1186\/s12911-021-01514-w"},{"key":"S0218126622501420BIB004","first-page":"97","author":"Nour M.","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"S0218126622501420BIB005","first-page":"1014","volume":"15","author":"Lin C.","year":"2019","journal-title":"Int. J. Perform. Eng."},{"key":"S0218126622501420BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s12596-021-00701-2"},{"key":"S0218126622501420BIB007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10846-020-01262-5","volume":"101","author":"Gomes I. P.","year":"2021","journal-title":"J. Intell. Robot. Syst. Theory Appl."},{"key":"S0218126622501420BIB008","first-page":"1300","volume":"41","author":"Sun H.-W.","year":"2019","journal-title":"Syst. Eng. Electron."},{"key":"S0218126622501420BIB009","first-page":"1504","volume":"44","author":"Di R. H.","year":"2016","journal-title":"Chin. J. Electron."},{"key":"S0218126622501420BIB010","volume-title":"Probabilistic Graphical Models","author":"Koller D.","year":"2009"},{"key":"S0218126622501420BIB011","first-page":"358","volume":"9","author":"Jaakkola T.","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"S0218126622501420BIB012","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4039"},{"key":"S0218126622501420BIB013","first-page":"549","volume":"5","author":"Koivisto M.","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"S0218126622501420BIB014","volume-title":"Finding Optimal Bayesian Networks by Dynamic Programming","author":"Singh A. P.","year":"2005"},{"key":"S0218126622501420BIB015","first-page":"445","volume-title":"22nd Conf. Uncertainty in Artificial Intelligence","author":"Silander T.","year":"2006"},{"key":"S0218126622501420BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.10.049"},{"key":"S0218126622501420BIB017","first-page":"2186","volume-title":"Int. Joint Conf. Artificial Intelligence","author":"Yuan C.","year":"2011"},{"key":"S0218126622501420BIB018","doi-asserted-by":"publisher","DOI":"10.21629\/JSEE.2019.05.12"},{"key":"S0218126622501420BIB019","first-page":"923","volume":"46","author":"Gao X. G.","year":"2020","journal-title":"IEEE\/CAA J. Automat. Sin."},{"key":"S0218126622501420BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106515"},{"key":"S0218126622501420BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.05.014"},{"key":"S0218126622501420BIB022","first-page":"100","volume-title":"2010 Int. Symp. Information Theory and its Applications","author":"Chow C.","year":"2010"},{"key":"S0218126622501420BIB023","first-page":"95","volume":"33","author":"Murphy K. P.","year":"2001","journal-title":"Comput. Sci. Stat."}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126622501420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T11:56:00Z","timestamp":1665057360000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218126622501420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":23,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2022,11,15]]}},"alternative-id":["10.1142\/S0218126622501420"],"URL":"https:\/\/doi.org\/10.1142\/s0218126622501420","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"article-number":"2250142"}}