• Title/Summary/Keyword: semi-supervised

Search Result 180, Processing Time 0.03 seconds

Association-rule based ensemble clustering for adopting a prior knowledge (사전정보 활용을 위한 관련 규칙 기반의 Ensemble 클러스터링)

  • Go, Song;Kim, Dae-Won
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.11a
    • /
    • pp.67-70
    • /
    • 2007
  • 본 논문은 클러스터링 문제에서 사전 정보에 대한 활용의 효율을 개선시킬 수 있는 방법을 제안한다. 클러스터링에서 사전 정보의 존재 시 이의 활용은 성능을 개선시킬 수 있는 계기가 될 수 있으므로 그의 활용 폭을 늘리기 위한 방법으로 다양한 사용 방법의 적용인 semi-supervised 클러스터링 앙상블을 제안한다. 사전 정보의 활용 방법의 방안으로써 association-rule의 개념을 접목하였다. 클러스터 수를 다르게 적용하더라도 패턴간의 유사도가 높으면 같은 그룹에 속할 확률은 높아진다. 다양한 초기화에 따른 클러스터의 동작은 사전 정보의 활용을 다양화 시키게 되며, 사전 정보에 충족하는 각각의 클러스터 결과를 제시한다. 결과를 총 취합하여 association-matrix를 형성하면 패턴간의 유사도를 얻을 수 있으며 결국 association-matrix를 통해 클러스터링 할 수 있는 방법을 제시한다.

  • PDF

Stock Price Prediction Based on Time Series Network (시계열 네트워크에 기반한 주가예측)

  • Park, Kang-Hee;Shin, Hyun-Jung
    • Korean Management Science Review
    • /
    • v.28 no.1
    • /
    • pp.53-60
    • /
    • 2011
  • Time series analysis methods have been traditionally used in stock price prediction. However, most of the existing methods represent some methodological limitations in reflecting influence from external factors that affect the fluctuation of stock prices, such as oil prices, exchange rates, money interest rates, and the stock price indexes of other countries. To overcome the limitations, we propose a network based method incorporating the relations between the individual company stock prices and the external factors by using a graph-based semi-supervised learning algorithm. For verifying the significance of the proposed method, it was applied to the prediction problems of company stock prices listed in the KOSPI from January 2007 to August 2008.

Issues and Empirical Results for Improving Text Classification

  • Ko, Young-Joong;Seo, Jung-Yun
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.2
    • /
    • pp.150-160
    • /
    • 2011
  • Automatic text classification has a long history and many studies have been conducted in this field. In particular, many machine learning algorithms and information retrieval techniques have been applied to text classification tasks. Even though much technical progress has been made in text classification, there is still room for improvement in text classification. In this paper, we will discuss remaining issues in improving text classification. In this paper, three improvement issues are presented including automatic training data generation, noisy data treatment and term weighting and indexing, and four actual studies and their empirical results for those issues are introduced. First, the semi-supervised learning technique is applied to text classification to efficiently create training data. For effective noisy data treatment, a noisy data reduction method and a robust text classifier from noisy data are developed as a solution. Finally, the term weighting and indexing technique is revised by reflecting the importance of sentences into term weight calculation using summarization techniques.

A Branch-and-Bound Algorithm for Finding an Optimal Solution of Transductive Support Vector Machines (Transductive SVM을 위한 분지-한계 알고리즘)

  • Park Chan-Kyoo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.69-85
    • /
    • 2006
  • Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

Stock Trading Model using Portfolio Optimization and Forecasting Stock Price Movement (포트폴리오 최적화와 주가예측을 이용한 투자 모형)

  • Park, Kanghee;Shin, Hyunjung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.6
    • /
    • pp.535-545
    • /
    • 2013
  • The goal of stock investment is earning high rate or return with stability. To accomplish this goal, using a portfolio that distributes stocks with high rate of return with less variability and a stock price prediction model with high accuracy is required. In this paper, three methods are suggested to require these conditions. First of all, in portfolio re-balance part, Max-Return and Min-Risk (MRMR) model is suggested to earn the largest rate of return with stability. Secondly, Entering/Leaving Rule (E/L) is suggested to upgrade portfolio when particular stock's rate of return is low. Finally, to use outstanding stock price prediction model, a model based on Semi-Supervised Learning (SSL) which was suggested in last research was applied. The suggested methods were validated and applied on stocks which are listed in KOSPI200 from January 2007 to August 2008.

Rule based Semi-Supervised Learning Gomoku Game AI Framework for Control Game Environment (게임 환경을 통제할 수 있는 규칙 기반 Semi-Supervised Learning 오목 인공지능 프레임 워크)

  • Kim, Sun-Min;Gu, Bon-Woo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.618-620
    • /
    • 2022
  • 게임은 수많은 NPC 와 규칙에 의해 작동되는 가상 공간을 의미한다. 이런 가상 공간에서는 규칙을 엄격히 지키면서 수행되는 AI 를 필수로 요구하게 된다. 하지만 강화 학습 기반의 AI 는 복잡한 게임의 규칙을 온전히 지키지 못하고 예상 밖의 행동을 돌출하면서 이를 해결하기 위한 많은 연구도 수행되고 있다. 본 논문에서는 규칙 기반으로 획득한 오목판의 확률 맵과 학습을 통해 획득한 확률맵 데이터를 병합하여 가장 높은 Value 를 가지는 위치를 다음 수로 반환하는 방법을 사용하였다. 향후 연구에서는 ANN(Approximate Nearest Neighbor)알고리즘을 적극 활용하여, 커널의 State 와 보드의 State 비교를 확률적으로 개선할 예정이다. 본 논문에서 제안된 프레임 워크는 게임 AI 연구에 기여할 수 있길 바란다.

Object detection for Fire Disaster Situation Recognition (화재 재난 상황 인식을 위한 객체 검출)

  • Kim, Tae-Seong;Bang, Jae-Yeon;Seo, Jeong-un;Sohn, Kyung-Ah
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.426-428
    • /
    • 2022
  • 화재 상황에서의 빠른 현장 파악은 인명피해를 줄이는데 중요한 요소이다. 기존 연구의 화재와 관련된 데이터셋들은 대부분 불과 연기를 라벨링하여 화재의 예방에 초점을 두고 있다. 본 연구에서는 화재 상황에서 사람과 소방관, 연기, 불을 탐지하는 Object detection 모델을 만들어 현장 파악에 더욱 도움을 주고자 하였다. 이를 위해 화재 상황 이미지 약 3000장을 수집하고 라벨링하여 데이터셋을 구성하였으며 이를 이용해 객체 검출 모델인 RetinaNet을 학습하였다. 또한, 화재 상황에서 Object Detection 모델의 성능을 향상시키기 위해 기존 모델인 RetinaNet에 Dehazing(FFA-Net), Smoke augmentation, semi-supervised(ISD) 방법을 적용하였고, semi-supervised 조건에서 mAP 63.7로 가장 높은 성능을 도출하였다.

The Construction of a Domain-Specific Sentiment Dictionary Using Graph-based Semi-supervised Learning Method (그래프 기반 준지도 학습 방법을 이용한 특정분야 감성사전 구축)

  • Kim, Jung-Ho;Oh, Yean-Ju;Chae, Soo-Hoan
    • Science of Emotion and Sensibility
    • /
    • v.18 no.1
    • /
    • pp.103-110
    • /
    • 2015
  • Sentiment lexicon is an essential element for expressing sentiment on a text or recognizing sentiment from a text. We propose a graph-based semi-supervised learning method to construct a sentiment dictionary as sentiment lexicon set. In particular, we focus on the construction of domain-specific sentiment dictionary. The proposed method makes up a graph according to lexicons and proximity among lexicons, and sentiments of some lexicons which already know their sentiment values are propagated throughout all of the lexicons on the graph. There are two typical types of the sentiment lexicon, sentiment words and sentiment phrase, and we construct a sentiment dictionary by creating each graph of them and infer sentiment of all sentiment lexicons. In order to verify our proposed method, we constructed a sentiment dictionary specific to the movie domain, and conducted sentiment classification experiments with it. As a result, it have been shown that the classification performance using the sentiment dictionary is better than the other using typical general-purpose sentiment dictionary.

Oil Price Forecasting Based on Machine Learning Techniques (기계학습기법에 기반한 국제 유가 예측 모델)

  • Park, Kang-Hee;Hou, Tianya;Shin, Hyun-Jung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.1
    • /
    • pp.64-73
    • /
    • 2011
  • Oil price prediction is an important issue for the regulators of the government and the related industries. When employing the time series techniques for prediction, however, it becomes difficult and challenging since the behavior of the series of oil prices is dominated by quantitatively unexplained irregular external factors, e.g., supply- or demand-side shocks, political conflicts specific to events in the Middle East, and direct or indirect influences from other global economical indices, etc. Identifying and quantifying the relationship between oil price and those external factors may provide more relevant prediction than attempting to unclose the underlying structure of the series itself. Technically, this implies the prediction is to be based on the vectoral data on the degrees of the relationship rather than the series data. This paper proposes a novel method for time series prediction of using Semi-Supervised Learning that was originally designed only for the vector types of data. First, several time series of oil prices and other economical indices are transformed into the multiple dimensional vectors by the various types of technical indicators and the diverse combination of the indicator-specific hyper-parameters. Then, to avoid the curse of dimensionality and redundancy among the dimensions, the wellknown feature extraction techniques, PCA and NLPCA, are employed. With the extracted features, a timepointspecific similarity matrix of oil prices and other economical indices is built and finally, Semi-Supervised Learning generates one-timepoint-ahead prediction. The series of crude oil prices of West Texas Intermediate (WTI) was used to verify the proposed method, and the experiments showed promising results : 0.86 of the average AUC.

Word Sense Disambiguation of Predicate using Semi-supervised Learning and Sejong Electronic Dictionary (세종 전자사전과 준지도식 학습 방법을 이용한 용언의 어의 중의성 해소)

  • Kang, Sangwook;Kim, Minho;Kwon, Hyuk-chul;Oh, Jyhyun
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.2
    • /
    • pp.107-112
    • /
    • 2016
  • The Sejong Electronic(machine-readable) Dictionary, developed by the 21st century Sejong Plan, contains systematically organized information on Korean words. It helps to solve problems encountered in the electronic formatting of the still-commonly-used hard-copy dictionary. The Sejong Electronic Dictionary, however has a limitation relate to sentence structure and selection-restricted nouns. This paper discuses the limitations of word-sense disambiguation(WSD) that uses subcategorization information suggested by the Sejong Electronic Dictionary and generalized selection-restricted nouns from the Korean Lexico-semantic network. An alternative method that utilized semi-supervised learning, the chi-square test and some other means to make WSD decisions is presented herein.