• Title/Summary/Keyword: 온라인 실험

Search Result 901, Processing Time 0.03 seconds

A Study on the Direct Pole Placement PID Self-Tuning Controller Design for DC Servo Motor Control (직류 서어보 전동기 제어를 위한 직접 극배치 PID 자기동조 제어기의 설계)

  • Nam, Moon-Hyun;Rhee, Kyu-Young
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.2
    • /
    • pp.55-64
    • /
    • 1990
  • This paper concerned about a study on the direct pole placement PID self-tuning controller design for DC servo motor control system. The method of a direct pole placement self-tuning PID control for a DC servo motor of Robot manipulator tracks a reference velocity in spite of the parameters uncertainties in nonminimum phase system. In this scheme, the parameters of classical controller are estimated by the recursive least square (RLS)identification algorithm, the pole placement method and diophantine equation. A series of simulation in which minimum phase system and nonminimum phase system are subjected to a pattern of system parameter changes is presented to show some of the features of the proposed control algorithm. The proposed control algorithm which shown are effective for the practical application, and experiments of DC servo motor speed control for Robot manipulator by a microcomputer IBM-PC/AT are performed and the results are well suited.

  • PDF

Applying Rating Score's Reliability of Customers to Enhance Prediction Accuracy in Recommender System (추천 시스템의 예측 정확도 향상을 위한 고객 평가정보의 신뢰도 활용법)

  • Choeh, Joon Yeon;Lee, Seok Kee;Cho, Yeong Bin
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.7
    • /
    • pp.379-385
    • /
    • 2013
  • On the internet, the rating scores assigned by customers are considered as the preference information of themselves and thus, these can be used efficiently in the customer profile generation process of recommender system. However, since anyone is free to assign a score that has a biased rating, using this without any filtering can exhibit a reliability problem. In this study, we suggest the methodology that measures the reliability of rating scores and then applies them to the customer profile creation process. Unlikely to some related studies which measure the reliability on the user level, we measure the reliability on the individual rating score level. Experimental results show that prediction accuracy of recommender system can be enhanced when ratings with higher reliability are selectively used for the customer profile configuration.

Function Approximation for accelerating learning speed in Reinforcement Learning (강화학습의 학습 가속을 위한 함수 근사 방법)

  • Lee, Young-Ah;Chung, Tae-Choong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.635-642
    • /
    • 2003
  • Reinforcement learning got successful results in a lot of applications such as control and scheduling. Various function approximation methods have been studied in order to improve the learning speed and to solve the shortage of storage in the standard reinforcement learning algorithm of Q-Learning. Most function approximation methods remove some special quality of reinforcement learning and need prior knowledge and preprocessing. Fuzzy Q-Learning needs preprocessing to define fuzzy variables and Local Weighted Regression uses training examples. In this paper, we propose a function approximation method, Fuzzy Q-Map that is based on on-line fuzzy clustering. Fuzzy Q-Map classifies a query state and predicts a suitable action according to the membership degree. We applied the Fuzzy Q-Map, CMAC and LWR to the mountain car problem. Fuzzy Q-Map reached the optimal prediction rate faster than CMAC and the lower prediction rate was seen than LWR that uses training example.

Academic Conference Categorization According to Subjects Using Topical Information Extraction from Conference Websites (학회 웹사이트의 토픽 정보추출을 이용한 주제에 따른 학회 자동분류 기법)

  • Lee, Sue Kyoung;Kim, Kwanho
    • The Journal of Society for e-Business Studies
    • /
    • v.22 no.2
    • /
    • pp.61-77
    • /
    • 2017
  • Recently, the number of academic conference information on the Internet has rapidly increased, the automatic classification of academic conference information according to research subjects enables researchers to find the related academic conference efficiently. Information provided by most conference listing services is limited to title, date, location, and website URL. However, among these features, the only feature containing topical words is title, which causes information insufficiency problem. Therefore, we propose methods that aim to resolve information insufficiency problem by utilizing web contents. Specifically, the proposed methods the extract main contents from a HTML document collected by using a website URL. Based on the similarity between the title of a conference and its main contents, the topical keywords are selected to enforce the important keywords among the main contents. The experiment results conducted by using a real-world dataset showed that the use of additional information extracted from the conference websites is successful in improving the conference classification performances. We plan to further improve the accuracy of conference classification by considering the structure of websites.

FUZZY matching using propensity score: IBM SPSS 22 Ver. (성향 점수를 이용한 퍼지 매칭 방법: IBM SPSS 22 Ver.)

  • Kim, So Youn;Baek, Jong Il
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.1
    • /
    • pp.91-100
    • /
    • 2016
  • Fuzzy matching is proposed to make propensities of two groups similar with their propensity scores and a way to select control variable to make propensity scores with a process that shows how to acquire propensity scores using logic regression analysis, is presented. With such scores, it was a method to obtain an experiment group and a control group that had similar propensity employing the Fuzzy Matching. In the study, it was proven that the two groups were the same but with a different distribution chart and standardization which made edge tolerance different and we realized that the number of chosen cases decreased when the edge tolerance score became smaller. So with the idea, we were able to determine that it is possible to merge groups using fuzzy matching without a precontrol and use them when data (big data) are used while to check the pros and cons of Fuzzy Matching were made possible.

e-Learning Course Reviews Analysis based on Big Data Analytics (빅데이터 분석을 이용한 이러닝 수강 후기 분석)

  • Kim, Jang-Young;Park, Eun-Hye
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.423-428
    • /
    • 2017
  • These days, various and tons of education information are rapidly increasing and spreading due to Internet and smart devices usage. Recently, as e-Learning usage increasing, many instructors and students (learners) need to set a goal to maximize learners' result of education and education system efficiency based on big data analytics via online recorded education historical data. In this paper, the author applied Word2Vec algorithm (neural network algorithm) to find similarity among education words and classification by clustering algorithm in order to objectively recognize and analyze online recorded education historical data. When the author applied the Word2Vec algorithm to education words, related-meaning words can be found, classified and get a similar vector values via learning repetition. In addition, through experimental results, the author proved the part of speech (noun, verb, adjective and adverb) have same shortest distance from the centroid by using clustering algorithm.

Automated Classification Scheme Generation using Product Attribute Information (상품 속성정보를 이용한 분류체계 자동생성)

  • Jang, Du-Seok;Chun, Jong-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.14D no.5
    • /
    • pp.491-500
    • /
    • 2007
  • In order to classify and manage on-line trading goods, the product classification scheme must be maintained. In most systems for handling product information, the classification scheme is managed manually by experts, which in general incurs a lot of time and cost. Effective management of classification system becomes more important as rapid development of industry expedites diversity and convergence of goods and services. There have been many researches on developing classification scheme, and continuing in this line of research, this paper proposes a new method for automatic generation of product classification scheme. Our main idea starts from the concept that a product is a set of attributes, and we propose a novel algorithm for automatically creating hierarchical classification scheme by utilizing inclusive relationships between products. We then prove the effectiveness of proposed algorithm by conducting an experiment.

A Design on Informal Big Data Topic Extraction System Based on Spark Framework (Spark 프레임워크 기반 비정형 빅데이터 토픽 추출 시스템 설계)

  • Park, Kiejin
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.11
    • /
    • pp.521-526
    • /
    • 2016
  • As on-line informal text data have massive in its volume and have unstructured characteristics in nature, there are limitations in applying traditional relational data model technologies for data storage and data analysis jobs. Moreover, using dynamically generating massive social data, social user's real-time reaction analysis tasks is hard to accomplish. In the paper, to capture easily the semantics of massive and informal on-line documents with unsupervised learning mechanism, we design and implement automatic topic extraction systems according to the mass of the words that consists a document. The input data set to the proposed system are generated first, using N-gram algorithm to build multiple words to capture the meaning of the sentences precisely, and Hadoop and Spark (In-memory distributed computing framework) are adopted to run topic model. In the experiment phases, TB level input data are processed for data preprocessing and proposed topic extraction steps are applied. We conclude that the proposed system shows good performance in extracting meaningful topics in time as the intermediate results come from main memories directly instead of an HDD reading.

Reinforcement Learning with Clustering for Function Approximation and Rule Extraction (함수근사와 규칙추출을 위한 클러스터링을 이용한 강화학습)

  • 이영아;홍석미;정태충
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.11
    • /
    • pp.1054-1061
    • /
    • 2003
  • Q-Learning, a representative algorithm of reinforcement learning, experiences repeatedly until estimation values about all state-action pairs of state space converge and achieve optimal policies. When the state space is high dimensional or continuous, complex reinforcement learning tasks involve very large state space and suffer from storing all individual state values in a single table. We introduce Q-Map that is new function approximation method to get classified policies. As an agent learns on-line, Q-Map groups states of similar situations and adapts to new experiences repeatedly. State-action pairs necessary for fine control are treated in the form of rule. As a result of experiment in maze environment and mountain car problem, we can achieve classified knowledge and extract easily rules from Q-Map

Traffic Control using Q-Learning Algorithm (Q 학습을 이용한 교통 제어 시스템)

  • Zheng, Zhang;Seung, Ji-Hoon;Kim, Tae-Yeong;Chong, Kil-To
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.11
    • /
    • pp.5135-5142
    • /
    • 2011
  • A flexible mechanism is proposed in this paper to improve the dynamic response performance of a traffic flow control system in an urban area. The roads, vehicles, and traffic control systems are all modeled as intelligent systems, wherein a wireless communication network is used as the medium of communication between the vehicles and the roads. The necessary sensor networks are installed in the roads and on the roadside upon which reinforcement learning is adopted as the core algorithm for this mechanism. A traffic policy can be planned online according to the updated situations on the roads, based on all the information from the vehicles and the roads. This improves the flexibility of traffic flow and offers a much more efficient use of the roads over a traditional traffic control system. The optimum intersection signals can be learned automatically online. An intersection control system is studied as an example of the mechanism using Q-learning based algorithm, and simulation results showed that the proposed mechanism can improve the traffic efficiency and the waiting time at the signal light by more than 30% in various conditions compare to the traditional signaling system.