• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.161-164
• /
• 2001

본 연구에서는 할부금융시장에서의 고객신용예측을 위한 모형으로 여러 가지 인공신경망(Neural Network) 모형들을 유전자 알고리즘(Genetic Algorithm)을 이용하여 통합한 신용예측모형을 제안한다. 10개의 학습된 인공신경망 모형들을 유전자알고리즘을 이용하여 종류별로 통합하여 MLP(Multi-Layered Perceptrons), Linear, RBF(Radial Basis Function) 세 가지의 대표모델을 얻고 이를 다시 하나의 인공신경망 모델로 통합하였다. 이를 통합되기 이전의 각각의 인공신경망 모형들과 성능을 비교, 분석하여 본 연구에서 제안한 통합모형의 유효성과 통합방법의 타당성을 제시하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.121-128
• /
• 2017

In this paper, we propose a multi-label classification method in which multi-label classification estimation techniques are applied to resolving location prediction problem. Most of previous studies related to location prediction have focused on the use of single-label classification by using contextual information such as user's movement paths, demographic information, etc. However, in this paper, we focused on the case where users are free to visit multiple locations, forcing decision-makers to use multi-labeled dataset. By using 2373 contextual dataset which was compiled from college students, we have obtained the best results with classifiers such as bagging, random subspace, and decision tree with the multi-label classification estimation methods like binary relevance(BR), binary pairwise classification (PW).

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.6
• /
• pp.1-7
• /
• 2018

A multi-label classification is to find multiple labels associated with the input pattern. Multi-label classification can be achieved by extending conventional single-label classification. Common extension techniques are known as Binary relevance, Label powerset, and Classifier chains. However, most of the extended multi-label naive bayes classifier has not been able to accurately estimate posterior probabilities because it does not reflect the label dependency. And the remaining extended multi-label naive bayes classifier has a problem that it is unstable to estimate posterior probability according to the label selection order. To estimate posterior probability well, we propose a new posterior probability estimation method that reflects the probability between all labels and labels efficiently. The proposed method reflects the correlation between labels. And we have confirmed through experiments that the extended multi-label naive bayes classifier using the proposed method has higher accuracy then the existing multi-label naive bayes classifiers.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.17-24
• /
• 2018

This paper proposes data mining models relevant to the serial publication periods and mobile gamification likelihood of webtoon contents which were either serialized or completed in platform. The size of the cartoon industry including webtoon takes merely 1% of the total entertainment contents industry in Korea. However, the significance of webtoon business is rapidly growing because its intellectual property can be easily used as an effective OSMU (One Source Multi-Use) vehicle for multiple types of contents such as movie, drama, game, and character-related merchandising. We suggested a set of data mining classifiers that are deemed suitable to provide prediction models for serial publication periods and mobile gamification likelihood for the sake of webtoon contents. As a result, the balanced accuracies are respectively recorded as 85.0% and 59.0%, from the two models.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.4
• /
• pp.331-334
• /
• 2006

Original Support Vsctor Machines (SVMs) by Vapnik were used for binary classification problems. Some researchers have tried to extend original SVM to multiclass classification. However, their studies have only focused on classifying samples into nominal categories. This study proposes a novel multiclass SVM model in order to handle ordinal multiple classes. Our suggested model may use less classifiers but predict more accurately because it utilizes additional hidden information, the order of the classes. To validate our model, we apply it to the real-world bond rating case. In this study, we compare the results of the model to those of statistical and typical machine learning techniques, and another multi class SVM algorithm. The result shows that proposed model may improve classification performance in comparison to other typical multiclass classification algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.724-726
• /
• 2004

DNA 마이크로어레이 기술의 발전은 암의 조기 발견 및 예후 예측을 가능하게 해주었으며, 이와 관련된 많은 연구가 진행 중이다. 마이크로어레이 데이터의 분류에서 관련 유전자들의 선택은 필수적이며, 유전자 선택방법은 분류기와 짝을 이루어 특징-분류기를 형성한다. 이제까지 여러 가지 특징-분류기를 사용하여 마이크로어레이 데이터를 분류해 왔지만, 알고리즘의 한계와 데이터의 결함 등으로 인하여 최적의 특징-분류기를 찾기 어려웠다. 따라서 앙상블 분류기를 이용하여 높은 분류성능을 얻는 방법이 시도되어왔으며. 최적의 것을 찾기 위하여 유전자 알고리즘이 사용되기도 했다. 본 논문에서는 이를 발전시켜 다양한 최적의 앙상블을 생성하기 위해 종분화 방법을 사용한다. 림프종 암 데이터에 대하여 leave-one-out cross-validation을 적용한 결과, 제안한 방법으로 다양한 최적해를 탐색하는 것을 확인할 수 있었다.

• Journal of Platform Technology
• /
• v.6 no.4
• /
• pp.18-25
• /
• 2018

This paper describes a real-time human and robot tracking method in Intelligent Space with multi-camera networks. The proposed method detects candidates for humans and robots by using the histogram of oriented gradients (HOG) feature in an image. To classify humans and robots from the candidates in real time, we apply cascaded structure to constructing a strong classifier which consists of many weak classifiers as follows: a linear support vector machine (SVM) and a radial-basis function (RBF) SVM. By using the multiple view geometry, the method estimates the 3D position of humans and robots from their 2D coordinates on image coordinate system, and tracks their positions by using stochastic approach. To test the performance of the method, humans and robots are asked to move according to given rectangular and circular paths. Experimental results show that the proposed method is able to reduce the localization error and be good for a practical application of human-centered services in the Intelligent Space.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.244-259
• /
• 2022

Bicycle- or bike-sharing systems (BSSs) have received increasing attention as a secondary transportation mode due to their advantages, for example, accessibility, prevention of air pollution, and health promotion. However, in BSSs, due to bias in bike demands, the bike rebalancing problem should be solved. Various methods have been proposed to solve this problem; however, it is difficult to apply such methods to small cities because bike demand is sparse, and there are many practical issues to solve. Thus, we propose a demand prediction model using multiple classifiers, time grouping, categorization, weather analysis, and station correlation information. In addition, we analyze real-world relocation data by relocation managers and propose a relocation algorithm based on the analytical results to solve the bike rebalancing problem. The proposed system is compared experimentally with the results obtained by the real relocation managers.

• Smart Media Journal
• /
• v.10 no.3
• /
• pp.31-38
• /
• 2021

It is hard to predict when and where a fall accident will happen. Also, if rapid follow-up measures on it are not performed, a fall accident leads to a threat of life, so studies that can automatically detect a fall accident have become necessary. Among automatic fall-accident detection techniques, a fall detection scheme using an IMU (inertial measurement unit) sensor attached to a wrist is difficult to detect a fall accident due to its movement, but it is recognized as a technique that is easy to wear and has excellent accessibility. To overcome the difficulty in obtaining fall data, this study proposes an algorithm that efficiently learns less data through machine learning such as KNN (k-nearest neighbors) and SVM (support vector machine). In addition, to improve the performance of these mathematical classifiers, this study utilized feature data aquired in the frequency space. The proposed algorithm analyzed the effect by diversifying the parameters of the model and the parameters of the frequency feature extractor through experiments using standard datasets. The proposed algorithm could adequately cope with a realistic problem that fall data are difficult to obtain. Because it is lighter than other classifiers, this algorithm was also easy to implement in small embedded systems where SIMD (single instruction multiple data) processing devices were difficult to mount.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.681-687
• /
• 2001

In order to raise a class discrimination power by combining multiple classifiers under the Bayesian decision theory, the upper bound of a Bayes error rate bounded by the conditional entropy of a class variable and decision variables obtained from training data samples should be minimized. Wang and Wong proposed a tree dependence first-order approximation scheme of a high order probability distribution composed of the class and multiple feature pattern variables for minimizing the upper bound of the Bayes error rate. This paper presents an extended high order product approximation scheme dealing with higher order dependency more than the first-order tree dependence, based on the minimization of the upper bound of the Bayes error rate. Multiple recognizers for unconstrained handwritten numerals from CENPARMI were combined by the proposed approximation scheme using the Bayesian formalism, and the high recognition rates were obtained by them.