• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.819-829
• /
• 2024

This paper delves into an examination of both non-Bayesian and Bayesian estimation techniques for determining the Topp-leone inverse Weibull distribution parameters based on progressive Type-II censoring. The first approach employs expectation maximization (EM) algorithms to derive maximum likelihood estimates for these variables. Subsequently, Bayesian estimators are obtained by utilizing symmetric and asymmetric loss functions such as Squared error and Linex loss functions. The Markov chain Monte Carlo method is invoked to obtain these Bayesian estimates, solidifying their reliability in this framework.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3095-3111
• /
• 2018

Spectrum sensing (SS) is one of the fundamental tasks for cognitive radio. In SS, decisions can be made via comparing the test statistics with a threshold. Conventional adaptive algorithms for SS usually adjust their thresholds according to the radio environment. This paper concentrates on the issue of adaptive SS whose threshold is adjusted based on the Markovian behavior of primary user (PU). Moreover, Bayesian cost is adopted as the performance metric to achieve a trade-off between false alarm and missed detection probabilities. Two novel adaptive algorithms, including Markov Bayesian energy detection (MBED) algorithm and IMBED (improved MBED) algorithm, are proposed. Both algorithms model the behavior of PU as a two-state Markov process, with which their thresholds are adaptively adjusted according to the detection results at previous slots. Compared with the existing Bayesian energy detection (BED) algorithm, MBED algorithm can achieve lower Bayesian cost, especially in high signal-to-noise ratio (SNR) regime. Furthermore, it has the advantage of low computational complexity. IMBED algorithm is proposed to alleviate the side effects of detection errors at previous slots. It can reduce Bayesian cost more significantly and in a wider SNR region. Simulation results are provided to illustrate the effectiveness and efficiencies of both algorithms.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.208-216
• /
• 2009

A number of estimation of distribution algorithms have been proposed that do not use explicitly crossover and mutation of traditional genetic algorithms, but estimate the distribution of population for more efficient search. But because it is not easy to discover higher-order correlations of variables, lower-order correlations are estimated most cases under various constraints. In this paper, we propose a new estimation of distribution algorithm that represents higher-order correlations of the data and finds global optimum more efficiently. The proposed algorithm represents the higher-order correlations among variables by building random hypergraph model composed of hyperedges consisting of variables which are expected to be correlated, and generates the next population by Bayesian sampling algorithm Experimental results show that the proposed algorithm can find global optimum and outperforms the simple genetic algorithm and BOA(Bayesian Optimization Algorithm) on decomposable functions with deceptive building blocks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.105-108
• /
• 2007

Bayesian learning network is employed for diverse applications. This paper discusses the Bayesian learning network algorithm structure which can be applied in the wireless sensor network environment for various online applications. First, this paper discusses Bayesian parameter learning, Bayesian DAG structure learning, characteristics of wireless sensor network, and data gathering in the wireless sensor network. Second, this paper discusses the important considerations about the online Bayesian learning network and the conceptual structure of the learning network algorithm.

• Journal of the Korean Society of Radiology
• /
• v.15 no.5
• /
• pp.591-602
• /
• 2021

Acute ischemic stroke(AIS) should be diagnosed within a few hours of onset of cerebral infarction symptoms using diagnostic radiology. In this study, we evaluated the clinical usefulness of SVD and the Bayesian algorithm to measure the volume of cerebral infarction using computed tomography perfusion(CTP) imaging and magnetic resonance diffusion-weighted imaging(MR DWI). We retrospectively included 50 patients (male : female = 33 : 17) who visited the emergency department with symptoms of AIS from September 2017 to September 2020. The cerebral infarct volume measured by SVD and the Bayesian algorithm was analyzed using the Wilcoxon signed rank test and expressed as a median value and an interquartile range of 25 - 75 %. The core volume measured by SVD and the Bayesian algorithm using was CTP imaging was 18.07 (7.76 - 33.98) cc and 47.3 (23.76 - 79.11) cc, respectively, while the penumbra volume was 140.24 (117.8 - 176.89) cc and 105.05 (72.52 - 141.98) cc, respectively. The mismatch ratio was 7.56 % (4.36 - 15.26 %) and 2.08 % (1.68 - 2.77 %) for SVD and the Bayesian algorithm, respectively, and all the measured values had statistically significant differences (p < 0.05). Spearman's correlation analysis showed that the correlation coefficient of the cerebral infarct volume measured by the Bayesian algorithm using CTP imaging and MR DWI was higher than that of the cerebral infarct volume measured by SVD using CTP imaging and MR DWI (r = 0.915 vs. r = 0.763 ; p < 0.01). Furthermore, the results of the Bland Altman plot analysis demonstrated that the slope of the scatter plot of the cerebral infarct volume measured by the Bayesian algorithm using CTP imaging and MR DWI was more steady than that of the cerebral infarct volume measured by SVD using CTP imaging and MR DWI (y = -0.065 vs. y = -0.749), indicating that the Bayesian algorithm was more reliable than SVD. In conclusion, the Bayesian algorithm is more accurate than SVD in measuring cerebral infarct volume. Therefore, it can be useful in clinical utility.

• The Journal of Engineering Research
• /
• v.2 no.1
• /
• pp.49-56
• /
• 1997

In emission computed tomography, statistical reconstruction methods in the context of a Bayesian framework have been a topic of interest over the last decade. This was mainly due to the fact that Bayesian approaches can incorporate a priori information into the reconstruction algorithm. Although these approaches can exhibit good performance, their applications to the clinic is hindered mainly by their high computational cost. On the other hand, the speed and simplicity of the filtered backprojection (FBP) algorithm have led to its widespread use in most clinical applications. In this work, we use spline models, which have been quite useful in Bayesian reconstruction, as regularizers for high-frequency apodization in FBP algorithm and show that the effects of using spline models as priors in Bayesian reconstruction can also be achieved in FBP reconstruction.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.2
• /
• pp.21-26
• /
• 2001

An expectation-maximization (EM) based Bayesian adaptation method for the mean of noise is proposed for noise-robust speech recognition. In the algorithm, the on-line testing utterances are used for the unsupervised Bayesian adaptation and the prior distribution of the noise mean is estimated using the off-line training data. For the noisy speech modeling, the parallel model combination (PMC) method is employed. The proposed method has shown to be effective compared with the conventional PMC method for the speech recognition experiments in a car-noise condition.

• International Journal of Highway Engineering
• /
• v.18 no.1
• /
• pp.91-97
• /
• 2016

PURPOSES : The objective of this paper is to develop a pavement performance model based on the Bayesian algorithm, and compare the measured and predicted performance data. METHODS : In this paper, several pavement types such as SMA (stone mastic asphalt), PSMA (polymer-modified stone mastic asphalt), PMA (polymer-modified asphalt), SBS (styrene-butadiene-styrene) modified asphalt, and DGA (dense-graded asphalt) are modeled in terms of the performance evaluation of pavement structures, using the Bayesian algorithm. RESULTS : From case studies related to the performance model development, the statistical parameters of the mean value and standard deviation can be obtained through the Bayesian algorithm, using the initial performance data of two different pavement cases. Furthermore, an accurate performance model can be developed, based on the comparison between the measured and predicted performance data. CONCLUSIONS : Based on the results of the case studies, it is concluded that the determined coefficients of the nonlinear performance models can be used to accurately predict the long-term performance behaviors of DGA and modified asphalt concrete pavements. In addition, the developed models were evaluated through comparison studies between the initial measurement and prediction data, as well as between the final measurement and prediction data. In the model development, the initial measured data were used.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1565-1571
• /
• 2005

Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).