• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.279-300
• /
• 2001

Data mining plays an important role in knowledge discovery process and usually various existing algorithms are selected for the specific purpose of the mining. Currently, data mining techniques are actively to the statistics, business, electronic commerce, biology, and medical area and currently numerous algorithms are being researched and developed for these applications. However, in a long run, only a few algorithms, which are well-suited to specific applications with excellent performance in large database, will survive. So it is reasonable to focus our effort on those selected algorithms in the future. This paper classifies about 30 existing algorithms into 7 categories - association rule, clustering, neural network, decision tree, genetic algorithm, memory-based reasoning, and bayesian network. First of all, this work analyzes systematic hierarchy and characteristics of algorithms and we present 14 criteria for classifying the algorithms and the results based on this criteria. Finally, we propose the best algorithms among some comparable algorithms with different features and performances. The result of this paper can be used as a guideline for data mining researches as well as field applications of data mining.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.301-314
• /
• 2008

The existing event recognition is accomplished with the limited systematic foundation, and thus much longer learning time is needed for emergency scenario interpretation due to large scale of probability data. In this paper, we propose a method for nile-based event recognition of an independent object(human) which extract a feature vectors from the object and analyze the behavior pattern of each object and interpretation of emergency scenarios using a probability and object's events. The event rule of an independent object is composed of the Primary-event, Move-event, Interaction-event, and 'FALL DOWN' event and is defined through feature vectors of the object and the segmented motion orientated vector (SMOV) in which the dynamic Bayesian network is applied. The emergency scenario is analyzed using current state of an event and its post probability. In this paper, we define diversified events compared to that of pre-existing method and thus make it easy to expand by increasing independence of each events. Accordingly, semantics information, which is impossible to be gained through an.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.32-39
• /
• 1994

As a basic research to realize Korean speech recognition system, phoneme recognition was carried out to find out ; 1) the best place which represents each phoneme's characteristics, and 2) the reasonable length of duration for obtaining the best recognition rates. For the recognition experiments, multi-speaker dependent recognition with Bayesian decision rule using 21 order of cepstral coefficient as a feature parameter was adopted. It turned out that the best place of feature extraction for the highest recognition rates were 10~50ms in vowels, 40~100ms in fricatives and affricates, 10~50ms in nasals and liquids, and 10~50ms in plosives. And about 70ms of duration was good enough for the recognition of all 35 phonemes.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.43-48
• /
• 2017

Movie ratings are crucial for recommendation engines that track the behavior of all users and utilize the information to suggest items the users might like. It is intuitively appealing that information about the viewing preferences in terms of movie genres is sufficient for predicting a genre of an unlabeled movie. In order to predict movie genres, we treat ratings as a feature vector, apply a Bernoulli event model to estimate the likelihood of a movie being assigned a certain genre, and evaluate the posterior probability of the genre of a given movie by using the Bayes rule. The goal of the proposed technique is to efficiently use movie ratings for the task of predicting movie genres. In our approach, we attempted to answer the question: "Given the set of users who watched a movie, is it possible to predict the genre of a movie on the basis of its ratings?" The simulation results with MovieLens 1M data demonstrated the efficiency and accuracy of the proposed technique, achieving an 83.8% prediction rate for exact prediction and 84.8% when including correlated genres.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.250-255
• /
• 2005

For navigation of a service robot, mapping and localization are very important. To estimate the robot pose, the map of the environment is required and it can be built by exploration or SLAM. Exploration is the fundamental task of guiding a robot autonomously during mapping such that it covers the entire environment with its sensors. In this paper, an efficient exploration scheme based on the position probability of the end nodes of a topological map is proposed. In this scheme, a topological map is constructed in real time using the thinning-based approach. The robot then updates the position probability of each end node maintaining its position at the current location based on the Bayesian update rule using the range data. From this probability, the robot can determine whether or not it needs to visit the specific end node to examine the environment around this node. Various experiments show that the proposed exploration scheme can perform exploration more efficiently than other schemes in that, in most cases, exploration for the entire environment can be completed without directly visiting everywhere in the environment.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.600-602
• /
• 1997

In this study, a hybrid neural net consisting of an Adaptive LVQ(ALVQ) algorithm and MLP is proposed to perform speaker identification task. ALVQ is a new learning procedure using adaptively feature vector sequence instead of only one feature vector in training codebooks initialized by LBG algorithm and the optimization criterion of this method is consistent with the speaker classification decision rule. ALVQ aims at providing a compressed, geometrically consistent data representation. It is fit to cover irregular data distributions and computes the distance of the input vector sequence from its nodes. On the other hand, MLP aim at a data representation to fit to discriminate patterns belonging to different classes. It has been shown that MLP nets can approximate Bayesian "optimal" classifiers with high precision, and their output values can be related a-posteriori class probabilities. The different characteristics of these neural models make it possible to devise hybrid neural net systems, consisting of classification modules based on these two different philosophies. The proposed method is compared with LBG algorithm, LVQ algorithm and MLP for performance.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.7
• /
• pp.629-635
• /
• 2016

This paper presents a method for predicting and tracking the irregular motion of bio-systems, - such as petals of flowers, butterflies or seeds of dandelion - based on the particle filtering theory. In bio-inspired system design, the ability to predict the dynamic motion of particles through adequate, experimentally verified models is important. The modeling of petal particle systems falling in air was carried out using the Bayesian probability rule. The experimental results show that the suggested method has good predictive power in the case of random disturbances induced by the turbulence of air.

• Journal of Sensor Science and Technology
• /
• v.19 no.3
• /
• pp.246-257
• /
• 2010

Autonomous guided robot navigation which consists of following unknown paths and avoiding unknown obstacles has been a fundamental technique for unmanned robots in outdoor environments. The unknown path following requires techniques such as path recognition, path planning, and robot pose estimation. In this paper, we propose a novel sensor fusion system for autonomous guided robot navigation in outdoor environments. The proposed system consists of three monocular cameras and an array of nine infrared range sensors. The two cameras equipped on the robot's right and left sides are used to recognize unknown paths and estimate relative robot pose on these paths through bayesian sensor fusion method, and the other camera equipped at the front of the robot is used to recognize abrupt curves and unknown obstacles. The infrared range sensor array is used to improve the robustness of obstacle avoidance. The forward camera and the infrared range sensor array are fused through rule-based method for obstacle avoidance. Experiments in outdoor environments show the mobile robot with the proposed sensor fusion system performed successfully real-time autonomous guided navigation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.576-579
• /
• 2009

The amount of incoming e-mails is increasing rapidly due to the wide usage of Internet. Therefore, it is more required to classify incoming e-mails efficiently and accurately. Currently, the e-mail classification techniques are focused on two way classification to filter spam mails from normal ones based mainly on Bayesian and Rule. The clustering method has been used for the multi-way classification of e-mails. But it has a disadvantage of low accuracy of classification. In this paper, we propose a novel multi-way e-mail classification method that uses PCA for automatic category generation and dynamic category hierarchy for high accuracy of classification. It classifies a huge amount of incoming e-mails automatically, efficiently, and accurately.

• 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.