Shahab Wahhab KareemMehmet Cudi OkurKareem, Shahab WahhabOkur, Mehmet Cudi2025-10-062019227830912278-309110.30534/ijatcse/2019/2281.220192-s2.0-85066304597https://www.scopus.com/inward/record.uri?eid=2-s2.0-85066304597&doi=10.30534%2Fijatcse%2F2019%2F2281.22019&partnerID=40&md5=aab0b56473f1b516c0d1df898438d945https://gcris.yasar.edu.tr/handle/123456789/9482https://doi.org/10.30534/ijatcse/2019/2281.22019Bayesian networks are useful analytical models for designing the structure of knowledge in machine learning. Probabilistic dependency relationships among the variables can be represented by Bayesian networks. One strategy of a structure learning Bayesian Networks is the score and search technique. In this paper present the proposed method for Bayesian network structure learning which is depended on Pigeon Inspired Optimization (PIO). The proposed method is a simple one among a firm concentration rate. In nature a navigational ability concerning pigeons is unbelievable and impressive. Under the PIO search algorithm we define a set of directed acyclic graphs. Every graph owns a score which shows its fitness. It iterates the algorithm until it gets the best solution or a satisfactory network structure using a landmark compass and map operator. During this work the proposed method compared with Simulated Annealing and Greedy Search using BDe score function. We also investigated the confusion matrix performances of the methods using various benchmark data sets. Specific effects show that a presented algorithm produces excellent performance than Simulated Annealing and Greedy algorithms and produces higher scores and accuracy values. © 2019 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessBayesian Network, Global Search, Local Search, Pigeon Inspired Optimization, Search And Score, Structure LearningBayesian NetworkSearch and ScoreGlobal SearchLocal SearchPigeon Inspired OptimizationStructure LearningArticle