• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.966-978
• /
• 2002

There are two important problems in improving text classification systems based on machine learning approach. The first one, called "selection problem", is how to select a minimum number of informative documents from a given document collection. The second one, called "composition problem", is how to reorganize selected training documents so that they can fit an adopted learning method. The former problem is addressed in "active learning" algorithms, and the latter is discussed in "boosting" algorithms. This paper proposes a new learning method, called AdaBUS, which proactively solves the above problems in the context of Naive Bayes classification systems. The proposed method constructs more accurate classification hypothesis by increasing the valiance in "weak" hypotheses that determine the final classification hypothesis. Consequently, the proposed algorithm yields perturbation effect makes the boosting algorithm work properly. Through the empirical experiment using the Routers-21578 document collection, we show that the AdaBUS algorithm more significantly improves the Naive Bayes-based classification system than other conventional learning methodson system than other conventional learning methods

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.287-296
• /
• 2003

There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.3
• /
• pp.309-319
• /
• 2023

Recently, the frequency and intensity of meteorological disasters have increased due to climate change. In South Korea, there are regional differences in vulnerability and response capability to cope with climate change because of regional climate characteristics. In particular, drought results from various factors and is linked to extensive meteorological, hydrological, and agricultural impacts. Therefore, in order to effectively cope with drought, it is necessary to use a composite drought index that can take into account various factors, and to evaluate future droughts comprehensively considering climate change. This study evaluated hydrologic risk(${\bar{R}}$) of future drought in the Nakdong River basin based on the Dynamic Naive Bayesian Classification (DNBC)-based composite drought index, which was calculated by applying Standardized Precipitation Index (SPI), Streamflow Drought Index (SDI), Evaporate Stress Index (ESI) and Water Supply Capacity Index (WSCI) to the DNBC. The indices used in the DNBC were calculated using observation data and climate scenario data. A bivariate frequency analysis was performed for the severity and duration of the composite drought. Then using the estimated bivariate return periods, hydrologic risks of drought were calculated for observation and future periods. The overall results indicated that there were the highest risks during the future period (2021-2040) (${\bar{R}}$=0.572), and Miryang River (#2021) had the highest risk (${\bar{R}}$=0.940) on average. The hydrologic risk of the Nakdong River basin will increase highly in the near future (2021-2040). During the far future (2041-2099), the hydrologic risk decreased in the northern basins, and increased in the southern basins.

• The Korean Journal of Applied Statistics
• /
• v.33 no.5
• /
• pp.555-567
• /
• 2020

Hypertension has a steadily increasing incidence rate as well as represents a risk factors for secondary diseases such as cardiovascular disease. Therefore, it is important to predict the incidence rate of the disease. In this study, we constructed nomograms that can predict the incidence rate of hypertension. We use data from the Korean National Health and Nutrition Examination Survey (KNHANES) for 2013-2016. The complex sampling data required the use of a Rao-Scott chi-squared test to identify 10 risk factors for hypertension. Smoking and exercise variables were not statistically significant in the Logistic regression; therefore, eight effects were selected as risk factors for hypertension. Logistic and Bayesian nomograms constructed from the selected risk factors were proposed and compared. The constructed nomograms were then verified using a receiver operating characteristics curve and calibration plot.

• Journal of Digital Convergence
• /
• v.17 no.2
• /
• pp.163-170
• /
• 2019

Over the past decade, the development of the Web explosively increased the data. Feature selection step is an important step in extracting valuable data from a large amount of data. This study proposes a novel opinion mining model based on combining feature selection (FS) methods with Word embedding to vector (Word2vec) and BOW (Bag-of-words). FS methods adopted for this study are CFS (Correlation based FS) and IG (Information Gain). To select an optimal FS method, a number of classifiers ranging from LR (logistic regression), NN (neural network), NBN (naive Bayesian network) to RF (random forest), RS (random subspace), ST (stacking). Empirical results with electronics and kitchen datasets showed that LR and ST classifiers combined with IG applied to BOW features yield best performance in opinion mining. Results with laptop and restaurant datasets revealed that the RF classifier using IG applied to Word2vec features represents best performance in opinion mining.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.9
• /
• pp.445-456
• /
• 2017

In this paper, we propose a method to detect spam tweets containing unhealthy information by using an n-gram dictionary under limited labeling. Spam tweets that contain unhealthy information have a tendency to use similar words and sentences. Based on this characteristic, we show that spam tweets can be effectively detected by applying a Naive Bayesian classifier using n-gram dictionaries which are constructed from spam tweets and normal tweets. On the other hand, constructing an initial training set requires very high cost because a large amount of data flows in real time in a twitter. Therefore, there is a need for a spam detection method that can be applied in an environment where the initial training set is very small or non exist. To solve the problem, we propose a method to generate pseudo-labels by utilizing twitter's retweet function and use them for the configuration of the initial training set and the n-gram dictionary update. The results from various experiments using 1.3 million korean tweets collected from December 1, 2016 to December 7, 2016 prove that the proposed method has superior performance than the compared spam detection methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.479-490
• /
• 2014

A lower extremity exoskeleton is a robot device that attaches to the lower limbs of the human body to augment or assist with the walking ability of the wearer. In order to improve the wearer's walking ability, the robot senses the wearer's walking locomotion and classifies it into a gait-phase state, after which it drives the appropriate robot motions for each state using its actuators. This paper presents a method by which the robot senses the wearer's locomotion along with a novel classification algorithm which classifies the sensed data as a gait-phase state. The robot determines its control mode using this gait-phase information. If erroneous information is delivered, the robot will fail to improve the walking ability or will bring some discomfort to the wearer. Therefore, it is necessary for the algorithm constantly to classify the correct gait-phase information. However, our device for sensing a human's locomotion has very sensitive characteristics sufficient for it to detect small movements. With only simple logic like a threshold-based classification, it is difficult to deliver the correct information continually. In order to overcome this and provide correct information in a timely manner, a probabilistic gait-phase classification algorithm is proposed. Experimental results demonstrate that the proposed algorithm offers excellent accuracy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.422-427
• /
• 2010

Korean Game industry, especially MMORPG(Massively Multiplayer Online Game) has been rapidly expanding in these days. But As game industry is growing, lots of online game security incidents have also been increasing and getting prevailing. One of the most critical security incidents is 'Game Bots', which are programs to play MMORPG instead of human players. If player let the game bots play for them, they can get a lot of benefic game elements (experience points, items, etc.) without any effort, and it is considered unfair to other players. Plenty of game companies try to prevent bots, but it does not work well. In this paper, we propose a behavior pattern model for detecting bots. We analyzed behaviors of human players as well as bots and identified six game features to build the model to differentiate game bots from human players. Based on these features, we made a Naive Bayesian classifier to reasoning the game bot or not. To evaluated our method, we used 10 game bot data and 6 human Player data. As a result, we classify Game bot and human player with 88% accuracy.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.4
• /
• pp.29-39
• /
• 2017

Various electronic warfare situations drive the need to develop an integrated electronic warfare simulator that can perform electronic warfare modeling and simulation on radar threats. In this paper, we analyze the components of a simulation system to reversely model the radar threats that emit electromagnetic signals based on the parameters of the electronic information, and propose a method to gradually maintain the reverse extrapolation model of RF threats. In the experiment, we will evaluate the effectiveness of the incremental model update and also assess the integration method of reverse extrapolation models. The individual model of RF threats are constructed by using decision tree, naive Bayesian classifier, artificial neural network, and clustering algorithms through Euclidean distance and cosine similarity measurement, respectively. Experimental results show that the accuracy of reverse extrapolation models improves, while the size of the threat sample increases. In addition, we use voting, weighted voting, and the Dempster-Shafer algorithm to integrate the results of the five different models of RF threats. As a result, the final decision of reverse extrapolation through the Dempster-Shafer algorithm shows the best performance in its accuracy.