{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:24:01Z","timestamp":1760243041586,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2015,6,16]],"date-time":"2015-06-16T00:00:00Z","timestamp":1434412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61272209","61300145"],"award-info":[{"award-number":["61272209","61300145"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Science Foundation of China","award":["20100481053","2013M530980"],"award-info":[{"award-number":["20100481053","2013M530980"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The inference of a general Bayesian network has been shown to be an NP-hard problem, even for approximate solutions. Although k-dependence Bayesian (KDB) classifier can construct at arbitrary points (values of k) along the attribute dependence spectrum, it cannot identify the changes of interdependencies when attributes take different values. Local KDB, which learns in the framework of KDB, is proposed in this study to describe the local dependencies implicated in each test instance. Based on the analysis of functional dependencies, substitution-elimination resolution, a new type of semi-naive Bayesian operation, is proposed to substitute or eliminate generalization to achieve accurate estimation of conditional probability distribution while reducing computational complexity. The final classifier, averaged k-dependence Bayesian (AKDB) classifiers, will average the output of KDB and local KDB. Experimental results on the repository of machine learning databases from the University of California Irvine (UCI) showed that AKDB has significant advantages in zero-one loss and bias relative to naive Bayes (NB), tree augmented naive Bayes (TAN), Averaged one-dependence estimators (AODE), and KDB. Moreover, KDB and local KDB show mutually complementary characteristics with respect to variance.<\/jats:p>","DOI":"10.3390\/e17064134","type":"journal-article","created":{"date-parts":[[2015,6,16]],"date-time":"2015-06-16T10:28:09Z","timestamp":1434450489000},"page":"4134-4154","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["General and Local: Averaged k-Dependence Bayesian Classifiers"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2459-3907","authenticated-orcid":false,"given":"Limin","family":"Wang","sequence":"first","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, ChangChun 130012, China"}]},{"given":"Haoyu","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Software, Jilin University, ChangChun 130012, China"}]},{"given":"Minghui","family":"Sun","sequence":"additional","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, ChangChun 130012, China"}]},{"given":"Yue","family":"Ning","sequence":"additional","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, ChangChun 130012, China"}]}],"member":"1968","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference., Morgan Kaufmann.","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(02)00191-1","article-title":"Learning Bayesian Networks from Data: An Information-Theory Based Approach","volume":"137","author":"Cheng","year":"2002","journal-title":"Artif. Intell."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.knosys.2011.08.010","article-title":"Improving Tree Augmented Naive Bayes for Class Probability Estimation","volume":"26","author":"Jiang","year":"2012","journal-title":"Knowl. Base. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Francisco, L., and Anderson, A. (2012). Bagging k-Dependence Probabilistic Networks: An Alternative Powerful Fraud Detection Tool. Expert. Syst. Appl., 11583\u201311592.","DOI":"10.1016\/j.eswa.2012.04.024"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2576868","article-title":"Discrete Bayesian Network Classifiers: A Survey","volume":"47","author":"Bielza","year":"2014","journal-title":"ACM Comput. Surv."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","article-title":"The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks","volume":"42","author":"Cooper","year":"1990","journal-title":"Artif. Intell."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","article-title":"Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard","volume":"60","author":"Dagum","year":"1993","journal-title":"Artif. Intell."},{"key":"ref_8","unstructured":"Langley, P., Iba, W., and Thompson, K. (1992, January 12\u201316). An Analysis of Bayesian Classifiers. San Jose, CA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1007465528199","article-title":"Bayesian Network Classifiers","volume":"29","author":"Friedman","year":"1997","journal-title":"Mach. Learn."},{"key":"ref_10","unstructured":"Sahami, M. (1996). Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, AAAI Press."},{"key":"ref_11","first-page":"867","article-title":"A Widely Applicable Bayesian Information Criterion","volume":"14","author":"Watanabe","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1186\/1752-0509-4-S1-S7","article-title":"A Novel Gene Network Inference Algorithm Using Predictive Minimum Description Length Approach","volume":"4","author":"Chaitankar","year":"2010","journal-title":"BMC. Syst. Biol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1080\/10635150490522304","article-title":"Model Selection and Model Averaging in Phylogenetics: Advantages of Akaike Information Criterion and Bayesian Approaches over Likelihood Ratio Tests","volume":"53","author":"Posada","year":"2004","journal-title":"Syst. Biol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1020249912095","article-title":"Being Bayesian about Bayesian Network Structure: A Bayesian Approach to Structure Discovery in Bayesian Networks","volume":"50","author":"Friedman","year":"2013","journal-title":"Mach. Learn."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10994-005-4258-6","article-title":"Not So Naive Bayes: Aggregating One-Dependence Estimators","volume":"58","author":"Webb","year":"2005","journal-title":"Mach. Learn."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1007\/s10994-011-5275-2","article-title":"Subsumption Resolution: An Efficient and Effective Technique for Semi-Naive Bayesian Learning","volume":"87","author":"Zheng","year":"2012","journal-title":"Mach. Learn."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wang, L.M. (2013). Extraction of Belief Knowledge from a Relational Database for Quantitative Bayesian Network Inference. Math. Probl. Eng.","DOI":"10.1155\/2013\/297121"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Wang, L.M., Wang, S.C., Li, X.F., and Chi, B.R. (2014). Extracting Credible Dependencies for Averaged One-Dependence Estimator Analysis. Math. Probl. Eng.","DOI":"10.1155\/2014\/470821"},{"key":"ref_19","unstructured":"Shannon, C.E., and Weaver, W. (1949). The Mathematical Theory of Communication, University of Illinois Press."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Sammut, C., and Webb, G.I. (2010). Encyclopedia of Machine Learning, Springer.","DOI":"10.1007\/978-0-387-30164-8"},{"key":"ref_21","unstructured":"Kohavi, R., and Wolpert, D. (1996, January 3\u20136). Bias Plus Variance Decomposition for Zero-One Loss Functions. Bari, Italy."},{"key":"ref_22","unstructured":"Fayyad, U.M., and Irani, K.B. (September,, January 28). Multi-interval Discretization of Continuous-Valued Attributes for Classification Learning. Chambery, France."},{"key":"ref_23","first-page":"2677","article-title":"An Extension on \u201cStatistical Comparisons of Classifiers over Multiple Data Sets\u201d for all Pairwise Comparisons","volume":"9","author":"Garcia","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","article-title":"The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance","volume":"32","author":"Friedman","year":"1937","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/6\/4134\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:47:57Z","timestamp":1760215677000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/6\/4134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,16]]},"references-count":24,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2015,6]]}},"alternative-id":["e17064134"],"URL":"https:\/\/doi.org\/10.3390\/e17064134","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2015,6,16]]}}}