• Title/Summary/Keyword: 의사결정 알고리즘

Search Result 585, Processing Time 0.024 seconds

Optimization of Tank Model Parameters Using Multi-Objective Genetic Algorithm (I): Methodology and Model Formulation (다목적 유전자알고리즘을 이용한 Tank 모형 매개변수 최적화(I): 방법론과 모형구축)

  • Kim, Tae-Soon;Jung, Il-Won;Koo, Bo-Young;Bae, Deg-Hyo
    • Journal of Korea Water Resources Association
    • /
    • v.40 no.9
    • /
    • pp.677-685
    • /
    • 2007
  • The objective of this study is to evaluate the applicability of multi-objective genetic algorithm(MOGA) in order to calibrate the parameters of conceptual rainfall-runoff model, Tank model. NSGA-II, one of the most imitating MOGA implementations, is combined with Tank model and four multi-objective functions such as to minimize volume error, root mean square error (RMSE), high flow RMSE, and low flow RMSE are used. When NSGA-II is employed with more than three multi-objective functions, a number of Pareto-optimal solutions usually becomes too large. Therefore, selecting several preferred Pareto-optimal solutions is essential for stakeholder, and preference-ordering approach is used in this study for the sake of getting the best preferred Pareto-optimal solutions. Sensitivity analysis is performed to examine the effect of initial genetic parameters, which are generation number and Population size, to the performance of NSGA-II for searching the proper paramters for Tank model, and the result suggests that the generation number is 900 and the population size is 1000 for this study.

Traffic Sign Recognition using SVM and Decision Tree for Poor Driving Environment (SVM과 의사결정트리를 이용한 열악한 환경에서의 교통표지판 인식 알고리즘)

  • Jo, Young-Bae;Na, Won-Seob;Eom, Sung-Je;Jeong, Yong-Jin
    • Journal of IKEEE
    • /
    • v.18 no.4
    • /
    • pp.485-494
    • /
    • 2014
  • Traffic Sign Recognition(TSR) is an important element in an Advanced Driver Assistance System(ADAS). However, many studies related to TSR approaches only in normal daytime environment because a sign's unique color doesn't appear in poor environment such as night time, snow, rain or fog. In this paper, we propose a new TSR algorithm based on machine learning for daytime as well as poor environment. In poor environment, traditional methods which use RGB color region doesn't show good performance. So we extracted sign characteristics using HoG extraction, and detected signs using a Support Vector Machine(SVM). The detected sign is recognized by a decision tree based on 25 reference points in a Normalized RGB system. The detection rate of the proposed system is 96.4% and the recognition rate is 94% when applied in poor environment. The testing was performed on an Intel i5 processor at 3.4 GHz using Full HD resolution images. As a result, the proposed algorithm shows that machine learning based detection and recognition methods can efficiently be used for TSR algorithm even in poor driving environment.

Development of Chinese Cabbage Detection Algorithm Based on Drone Multi-spectral Image and Computer Vision Techniques (드론 다중분광영상과 컴퓨터 비전 기술을 이용한 배추 객체 탐지 알고리즘 개발)

  • Ryu, Jae-Hyun;Han, Jung-Gon;Ahn, Ho-yong;Na, Sang-Il;Lee, Byungmo;Lee, Kyung-do
    • Korean Journal of Remote Sensing
    • /
    • v.38 no.5_1
    • /
    • pp.535-543
    • /
    • 2022
  • A drone is used to diagnose crop growth and to provide information through images in the agriculture field. In the case of using high spatial resolution drone images, growth information for each object can be produced. However, accurate object detection is required and adjacent objects should be efficiently classified. The purpose of this study is to develop a Chinese cabbage object detection algorithm using multispectral reflectance images observed from drone and computer vision techniques. Drone images were captured between 7 and 15 days after planting a Chinese cabbage from 2018 to 2020 years. The thresholds of object detection algorithm were set based on 2019 year, and the algorithm was evaluated based on images in 2018 and 2019 years. The vegetation area was classified using the characteristics of spectral reflectance. Then, morphology techniques such as dilatation, erosion, and image segmentation by considering the size of the object were applied to improve the object detection accuracy in the vegetation area. The precision of the developed object detection algorithm was over 95.19%, and the recall and accuracy were over 95.4% and 93.68%, respectively. The F1-Score of the algorithm was over 0.967 for 2 years. The location information about the center of the Chinese cabbage object extracted using the developed algorithm will be used as data to provide decision-making information during the growing season of crops.

A study on integration of semantic topic based Knowledge model (의미적 토픽 기반 지식모델의 통합에 관한 연구)

  • Chun, Seung-Su;Lee, Sang-Jin;Bae, Sang-Tea
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.181-183
    • /
    • 2012
  • 최근 자연어 및 정형언어 처리, 인공지능 알고리즘 등을 활용한 효율적인 의미 기반 지식모델의 생성과 분석 방법이 제시되고 있다. 이러한 의미 기반 지식모델은 효율적 의사결정트리(Decision Making Tree)와 특정 상황에 대한 체계적인 문제해결(Problem Solving) 경로 분석에 활용된다. 특히 다양한 복잡계 및 사회 연계망 분석에 있어 정적 지표 생성과 회귀 분석, 행위적 모델을 통한 추이분석, 거시예측을 지원하는 모의실험(Simulation) 모형의 기반이 된다. 본 연구에서는 이러한 의미 기반 지식모델을 통합에 있어 텍스트 마이닝을 통해 도출된 토픽(Topic) 모델 간 통합 방법과 정형적 알고리즘을 제시한다. 이를 위해 먼저, 텍스트 마이닝을 통해 도출되는 키워드 맵을 동치적 지식맵으로 변환하고 이를 의미적 지식모델로 통합하는 방법을 설명한다. 또한 키워드 맵으로부터 유의미한 토픽 맵을 투영하는 방법과 의미적 동치 모델을 유도하는 알고리즘을 제안한다. 통합된 의미 기반 지식모델은 토픽 간의 구조적 규칙과 정도 중심성, 근접 중심성, 매개 중심성 등 관계적 의미분석이 가능하며 대규모 비정형 문서의 의미 분석과 활용에 실질적인 기반 연구가 될 수 있다.

Automatic Recognition Algorithm for Linearly Modulated Signals Under Non-coherent Asynchronous Condition (넌코히어런트 비동기하에서의 선형 변조신호 자동인식 알고리즘)

  • Sim, Kyuhong;Yoon, Wonsik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.10
    • /
    • pp.2409-2416
    • /
    • 2014
  • In this paper, an automatic recognition algorithm for linearly modulated signals like PSK, QAM under noncoherent asynchronous condition is proposed. Frequency, phase, and amplitude characteristics of digitally modulated signals are changed periodically. By using this characteristics, cyclic moments and higher order cumulants based features are utilized for the modulation recognition. Hierarchial decision tree method is used for high speed signal processing and totally 4 feature extraction parameters are used for modulation recognition. In the condition where the symbol number is 4,096, the recognition accuracy of the proposed algorithm is more than 95% at SNR 15dB. Also the proposed algorithm is effective to classify the signal which has carrier frequency and phase offset.

Construction of CT Image data Automatic Recognition System for Diagnosis of Urinary Stone Based on AI Plaform (인공지능 플랫폼기반 요로결석진단을 위한 CT 영상 데이터 자동판독 시스템 구축)

  • Noh, Si-Hyeong;Lee, Chungsub;Kim, Tae-Hoon;Lee, Yun Oh;Park, Sung Bin;Yoon, Kwon-Ha;Jeong, Chang-Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.11a
    • /
    • pp.928-930
    • /
    • 2020
  • 본 논문은 인공지능 플랫폼 기반의 요로결석 진단을 위한 CT 영상 데이터 자동판독 시스템에 대해 기술하고자 한다. 제안한 시스템은 웹 기반의 플랫폼을 기반으로 하며, 인공지능 기반의 진단 알고리즘을 장착하여 빠르게 요로결석 환자의 스크리닝에 목적을 두고 있다. 병원정보시스템의 PACS와 EMR과 연계와 Deep learning 진단 알고리즘을 적용한 요로결석 자동판독 시스템을 개발하였다. 특히, 기 구축된 인공지능 플랫폼을 통해 추출한 데이터셋을 기반으로 진단 알고리즘 개발 방법과 수행 결과를 보인다. 제안한 시스템은 요로결석 진단과 수술여부에 의사결정지원 시스템으로 임상에서 활용될 것으로 기대하고 있다.

An Efficient Algorithm for Incremental View Maintenance In a Data Warehouse (데이터 웨어하우스에서 점진적 뷰 유지를 위한 효율적인 알고리즘)

  • 이현창;김충석;김경창
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1265-1272
    • /
    • 2000
  • A data warehouse is able to accommodate efficient data mining query processing and subsequent response by providing information needed for decision making. In such an environment, the data warehouse stores materialized view derived from various sources to enhance query processing. The compensating algorithm to maintain materialized view is well known for a single source site environment. In the compensating algorithm, several problems arise to get results in view maintenance. The problems are due to the overhead in query management within the data warehouse, increased complexity to manage queries in the warehouse as updates occur and increased volume of message traffic between the data source and the warehouse. In this paper, we propose a new algorithm that reduces the overhead in managing queries for new maintenance and that enhances the correctness. We also measured the performance of the new algorithm by evaluating the performance of the existing recomputing view and compensating algorithm and comparing the results with the proposed algorithm.

  • PDF

Hyper-Rectangle Based Prototype Selection Algorithm Preserving Class Regions (클래스 영역을 보존하는 초월 사각형에 의한 프로토타입 선택 알고리즘)

  • Baek, Byunghyun;Euh, Seongyul;Hwang, Doosung
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.3
    • /
    • pp.83-90
    • /
    • 2020
  • Prototype selection offers the advantage of ensuring low learning time and storage space by selecting the minimum data representative of in-class partitions from the training data. This paper designs a new training data generation method using hyper-rectangles that can be applied to general classification algorithms. Hyper-rectangular regions do not contain different class data and divide the same class space. The median value of the data within a hyper-rectangle is selected as a prototype to form new training data, and the size of the hyper-rectangle is adjusted to reflect the data distribution in the class area. A set cover optimization algorithm is proposed to select the minimum prototype set that represents the whole training data. The proposed method reduces the time complexity that requires the polynomial time of the set cover optimization algorithm by using the greedy algorithm and the distance equation without multiplication. In experimented comparison with hyper-sphere prototype selections, the proposed method is superior in terms of prototype rate and generalization performance.

Rule-based System for Loading Multiple Items in Containers for Shipping (제품수송 컨터네이너의 적재를 위한 규칙기반시스템)

  • Park, Ji Hee;Lee, Gun Ho
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.6
    • /
    • pp.403-412
    • /
    • 2013
  • This study figures out the concepts of container transport, logistical cost and the distribution of a company through studying documents, and to suggest logistical cost reduction approach, focused on the efficiency of transport which occupied the considerable portion of the total logistical cost of the company. We analyze and discuss the container loading of multiple items for multiple places of departure and arrival through a case study on S company in South Korea. We suggest a direction to reduce the logistical cost of the companies, analyzing the conditions of multiple items loading, and rule-based systems including an algorithm which determines container-loading for minimum freight expenses. We use data mining and OLAP tools of MS Analysis Services to produce loading rules for multiple items loading and generate OLAP cube and decision trees to validate the rules.

Exploring the Feature Selection Method for Effective Opinion Mining: Emphasis on Particle Swarm Optimization Algorithms

  • Eo, Kyun Sun;Lee, Kun Chang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.11
    • /
    • pp.41-50
    • /
    • 2020
  • Sentimental analysis begins with the search for words that determine the sentimentality inherent in data. Managers can understand market sentimentality by analyzing a number of relevant sentiment words which consumers usually tend to use. In this study, we propose exploring performance of feature selection methods embedded with Particle Swarm Optimization Multi Objectives Evolutionary Algorithms. The performance of the feature selection methods was benchmarked with machine learning classifiers such as Decision Tree, Naive Bayesian Network, Support Vector Machine, Random Forest, Bagging, Random Subspace, and Rotation Forest. Our empirical results of opinion mining revealed that the number of features was significantly reduced and the performance was not hurt. In specific, the Support Vector Machine showed the highest accuracy. Random subspace produced the best AUC results.