• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.150-150
• /
• 2019

The development of prolong and severe drought can directly impact on the environment, agriculture, economics and society of country. A lot of efforts have been made across worldwide in the planning, monitoring and mitigation of drought. Currently, different drought indices such as the Palmer Drought Severity Index (PDSI), Standardized Precipitation Index (SPI), Standardized Precipitation Evapotranspiration Index (SPEI) are developed and most commonly used to monitor drought characteristics quantitatively. However, it will be very meaningful and essential to develop a more effective technique for assessment and monitoring of onset and end of drought. Therefore, in this study, the hidden Markov Bayesian classifier (MBC) was employed for the assessment of onset and end of meteorological drought classes. The results showed that the probabilities of different classes based on the MBC were quite suitable and can be employed to estimate onset and end of each class for meteorological droughts. The classification results of MBC were compared with SPI and with past studies which proved that the MBC was able to account accuracy in determining the accurate drought classes. For more performance evaluation of classification results confusion matrix was used to find accuracy and precision in predicting the classes and their results are also appropriate. The overall results indicate that the MBC was effective in predicating the onset and end of drought events and can utilized for monitoring and management of short-term drought risk.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.409-414
• /
• 2013

Naive Bayesian classifiers are a powerful and well-known type of classifiers that can be easily induced from a dataset of sample cases. However, the strong conditional independence assumptions can sometimes lead to weak classification performance. Normally, naive Bayesian classifiers use Gaussian distributions to handle continuous attributes and to represent the likelihood of the features conditioned on the classes. The probability density of attributes, however, is not always well fitted by a Gaussian distribution. Another eminent type of classifier is the neuro-fuzzy classifier, which can learn fuzzy rules and fuzzy sets using supervised learning. Since there are specific structural similarities between a neuro-fuzzy classifier and a naive Bayesian classifier, the purpose of this study is to apply learning distribution graphs constructed by a neuro-fuzzy network to naive Bayesian classifiers. We compare the Gaussian distribution graphs with the fuzzy distribution graphs for the naive Bayesian classifier. We applied these two types of distribution graphs to classify leukemia and colon DNA microarray data sets. The results demonstrate that a naive Bayesian classifier with fuzzy distribution graphs is more reliable than that with Gaussian distribution graphs.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.813-820
• /
• 1999

Supprot vector machine(SVM) is a new and very promising regression and classification technique developed by Vapnik and his group at AT&T Bell Laboratories. in this paper we provide a brief overview of SVM for regression. Furthermore we describe Bayesian model selection based on macKay's evidence framework for SVM regression.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.1
• /
• pp.119-127
• /
• 2000

In this study the classified researches the artificial and natural flaws in welding parts are performed using the pattern recognition technology. For this purpose the signal pattern recognition package including the user defined function was developed and the total procedure including the digital signal processing feature extraction feature selection and classifi-er selection is teated by bulk,. Specially it is composed with and discussed using the statistical classifier such as the linear discriminant function the empirical Bayesian classifier. Also the pattern recognition technology is applied to classifica-tion problem of natural flaw(i.e multiple classification problem-crack lack of penetration lack of fusion porosity and slag inclusion the planar and volumetric flaw classification problem), According to this result it is possible to acquire the recognition rate of 83% above even through it is different a little according to domain extracting the feature and the classifier.

• Journal of Intelligence and Information Systems
• /
• v.3 no.2
• /
• pp.83-91
• /
• 1997

DELVAUX is an inductive learning environment that learns Bayesian classification rules from a set o examples. In DELVAUX, a genetic a, pp.oach is employed to learn the best rule-set, in which a population consists of rule-sets and rule-sets generate offspring by exchanging some of their rules. We have explored a meta-learning a, pp.oach in the DELVAUX learning environment to improve the classification performance of the DELVAUX system. The meta-learning a, pp.oach learns the bias of a classifier so that it can evaluate the prediction made by the classifier for a given example and thereby improve the overall performance of a classifier system. The paper discusses the meta-learning a, pp.oach in details and presents some empirical results that show the improvement we can achieve with the meta-learning a, pp.oach.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.31-36
• /
• 2009

Bayesian networks are known as the best tools to express and predict the domain knowledge with uncertain environments. However, bayesian learning could be too difficult to do effective and reliable searching. To solve the problems of overtime demand, the nodes should be arranged orderly, so that effective structural learning can be possible. This paper suggests the classification learning model to reduce the errors in the independent condition, in which a lot of variables exist and data can increase the reliability by calculating the each entropy of probabilities depending on each circumstances. Also efficient learning models are suggested to decide the order of nodes, that has lowest entropy by calculating the numerical values of entropy of each node in K2 algorithm. Consequently the model of the most suitably settled Bayesian networks could be constructed as quickly as possible.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.403-414
• /
• 2005

Most of the currently used spam-filters are based on a Bayesian classification technique, where some serious problems occur such as a limited precision/recall rate and the false positive error. This paper addresses a solution to the problems using a modified Bayesian classifier based on chi-square statistics. The resulting spam-filter is more accurate and flexible than traditional Bayesian spam-filters and can be a personalized one providing some parameters when the filter is teamed from training data.

• Journal of Information Processing Systems
• /
• v.3 no.2
• /
• pp.73-81
• /
• 2007

In this paper, we introduce a domain-independent classification framework based on both k-nearest neighbor and Naive Bayesian classification algorithms. The architecture of our system is simple and modularized in that each sub-module of the system could be changed or improved efficiently. Moreover, it provides various feature selection mechanisms to be applied to optimize the general-purpose classifiers for a specific domain. As for the enhanced classification performance, our system provides conditional probability boosting (CPB) mechanism which could be used in various domains. In the mood classification domain, our optimized framework using the CPB algorithm showed 1% of improvement in precision and 2% in recall compared with the baseline.

• Bulletin of the Korean Chemical Society
• /
• v.31 no.8
• /
• pp.2163-2169
• /
• 2010

G-protein coupled receptors (GPCRs) are involved in a wide variety of physiological processes and are known to be targets for nearly 50% of drugs. The various functions of GPCRs are affected by their cognate ligands which are mainly classified as agonists and antagonists. The purpose of this study is to develop a Bayesian classification model, that can predict a compound as either human GPCR agonist or antagonist. Total 6627 compounds experimentally determined as either GPCR agonists or antagonists covering all the classes of GPCRs were gathered to comprise the dataset. This model distinguishes GPCR agonists from GPCR antagonists by using chemical fingerprint, FCFP_6. The model revealed distinctive structural characteristics between agonistic and antagonistic compounds: in general, 1) GPCR agonists were flexible and had aliphatic amines, and 2) GPCR antagonists had planar groups and aromatic amines. This model showed very good discriminative ability in general, with pretty good discriminant statistics for the training set (accuracy: 90.1%) and a good predictive ability for the test set (accuracy: 89.2%). Also, receiver operating characteristic (ROC) plot showed the area under the curve (AUC) to be 0.957, and Matthew's Correlation Coefficient (MCC) value was 0.803. The quality of our model suggests that it could aid to classify the compounds as either GPCR agonists or antagonists, especially in the early stages of the drug discovery process.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.457-462
• /
• 2006

In many applications, an enormous amount of unlabeled data is available with little cost. Therefore, it is natural to ask whether we can take advantage of these unlabeled data in classification learning. In this paper, we analyzed the role of unlabeled data in the context of naive Bayesian learning. Experimental results show that including unlabeled data as part of training data can significantly improve the performance of classification accuracy. The effect of using unlabeled data is especially important in case labeled data are sparse.