• Title/Summary/Keyword: 평가규칙

Search Result 1,025, Processing Time 0.024 seconds

An Ontology-Based Hazard Analysis and Risk Assessment for automotive functional safety (자동차 기능안전성을 위한 온톨로지 기반의 위험원 분석 및 위험 평가)

  • Roh, Kyung-Hyun;Lee, Keum-Suk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.3
    • /
    • pp.9-17
    • /
    • 2015
  • The ISO 26262 standard requires a preliminary hazard analysis and risk assesment early in the development for automotive system. This is a first step for the development of an automotive system to determine the necessary safety measures to be implemented for a certain function. In this paper, we propose an ontology-based hazard analysis and risk assessment method for automotive functional safety. We use ontology to model the hazard and SWRL(Semantic Web Language) to describe risk analysis. The applicability of the proposed method is evaluated by the case study of an ESCL(electronic steering column lock) system. The result show that ontology deduction is useful for improving consistency and accuracy of hazard analysis and risk assessment.

Utilization of similarity measures by PIM with AMP as association rule thresholds (모든 주변 비율을 고려한 확률적 흥미도 측도 기반 유사성 측도의 연관성 평가 기준 활용 방안)

  • Park, Hee Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.1
    • /
    • pp.117-124
    • /
    • 2013
  • Association rule of data mining techniques is the method to quantify the relationship between a set of items in a huge database, andhas been applied in various fields like internet shopping mall, healthcare, insurance, and education. There are three primary interestingness measures for association rule, support and confidence and lift. Confidence is the most important measure of these measures, and we generate some association rules using confidence. But it is an asymmetric measure and has only positive value. So we can face with difficult problems in generation of association rules. In this paper we apply the similarity measures by probabilistic interestingness measure (PIM) with all marginal proportions (AMP) to solve this problem. The comparative studies with support, confidences, lift, chi-square statistics, and some similarity measures by PIM with AMPare shown by numerical example. As the result, we knew that the similarity measures by PIM with AMP could be seen the degree of association same as confidence. And we could confirm the direction of association because they had the sign of their values, and select the best similarity measure by PIM with AMP.

The grade evaluation system applying the Fuzzy reasoning on Web (웹상에서의 퍼지추론을 이용한 서술식 평가 시스템)

  • 사공걸;김두완;정환묵
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.12a
    • /
    • pp.455-458
    • /
    • 2002
  • 기존의 점수와 석차로서 학생을 평가하여 발생하는 문제점을 해결하기 위하여 서술식의 성적평가가 도입되고 있다. 그러나, 이 서술식으로 이루어지는 성적 평가는 업무를 증가시키고 또 교사의 주관적인 성적평가로 인해 성적처리의 일관성이 유지되기 어려운 문제점이 있다. 본 논문에서는 교사가 학생의 성적을 효과적으로 평가하기 위하여 퍼지 추론을 이용한 서술식 성적평가 시스템을 제안한다. 사용자(교사)로부터 수행평가요소의 결과와 과목의 최종적인 평가를 퍼지 추론에 적용하여 객관적인 성적평가를 한 후, 추론규칙의 적합도를 이용하여 성적평가 문장을 추출하여 서술식 평가 문장을 생성하도록 한다

Competitor Extraction based on Machine Learning Methods (기계학습 기반 경쟁자 자동추출 방법)

  • Lee, Chung-Hee;Kim, Hyun-Jin;Ryu, Pum-Mo;Kim, Hyun-Ki;Seo, Young-Hoon
    • Annual Conference on Human and Language Technology
    • /
    • 2012.10a
    • /
    • pp.107-112
    • /
    • 2012
  • 본 논문은 일반 텍스트에 나타나는 경쟁 관계에 있는 고유명사들을 경쟁자로 자동 추출하는 방법에 대한 것으로, 규칙 기반 방법과 기계 학습 기반 방법을 모두 제안하고 비교하였다. 제안한 시스템은 뉴스 기사를 대상으로 하였고, 문장에 경쟁관계를 나타내는 명확한 정보가 있는 경우에만 추출하는 것을 목표로 하였다. 규칙기반 경쟁어 추출 시스템은 2개의 고유명사가 경쟁관계임을 나타내는 단서단어에 기반해서 경쟁어를 추출하는 시스템이며, 경쟁표현 단서단어는 620개가 수집되어 사용됐다. 기계학습 기반 경쟁어 추출시스템은 경쟁어 추출을 경쟁어 후보에 대한 경쟁여부의 바이너리 분류 문제로 접근하였다. 분류 알고리즘은 Support Vector Machines을 사용하였고, 경쟁어 주변 문맥 정보를 대표할 수 있는 언어 독립적 5개 자질에 기반해서 모델을 학습하였다. 성능평가를 위해서 이슈화되고 있는 핫키워드 54개에 대해서 623개의 경쟁어를 뉴스 기사로부터 수집해서 평가셋을 구축하였다. 비교 평가를 위해서 기준시스템으로 연관어에 기반해서 경쟁어를 추출하는 시스템을 구현하였고, Recall/Precision/F1 성능으로 0.119/0.214/0.153을 얻었다. 제안 시스템의 실험 결과로 규칙기반 시스템은 0.793/0.207/0.328 성능을 보였고, 기계 학습기반 시스템은 0.578/0.730/0.645 성능을 보였다. Recall 성능은 규칙기반 시스템이 0.793으로 가장 좋았고, 기준시스템에 비해서 67.4%의 성능 향상이 있었다. Precision과 F1 성능은 기계학습기반 시스템이 0.730과 0.645로 가장 좋았고, 기준시스템에 비해서 각각 61.6%, 49.2%의 성능향상이 있었다. 기준시스템에 비해서 제안한 시스템이 Recall, Precision, F1 성능이 모두 대폭적으로 향상되었으므로 제안한 방법이 효과적임을 알 수 있다.

  • PDF

Intelligent Ship s Steering Gear Control System Using Linguistic Instruction (언어지시에 의한 지능형 조타기 제어 시스템)

  • Park, Gyei-Kark;Seo, Ki-Yeol
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.5
    • /
    • pp.417-423
    • /
    • 2002
  • In this paper, we propose intelligent steering control system that apply LIBL(Linguistic Instruction Based Learning) method to steering system of ship and take the place of process that linguistic instruction such as officer s steering instruction is achieved via ableman. We embody ableman s suitable steering manufacturing model using fuzzy inference rule by specific method of study, and apply LIBL method to present suitable meaning element and evaluation rule to steering system of ship, embody intelligent steering gear control system that respond more efficiently on officer s linguistic instruction. We presented evaluation rule to constructed steering manufacturing model based on ableman s experience, and propose rudder angle for steering system, compass bearing arrival time, meaning element of stationary state, and correct ableman manufacturing model rule using fuzzy inference. Also, we apply LIBL method to ship control simulator and confirmed the effectiveness.

A Study on the Semantic Search using Inference Rules of the Structured Terminology Glossary "STNet" (구조적 학술용어사전 "STNet"의 추론규칙 생성에 의한 의미 검색에 관한 연구)

  • Ko, Young Man;Song, Min-Sun;Lee, Seung-Jun;Kim, Bee-Yeon;Min, Hye-Ryoung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.49 no.3
    • /
    • pp.81-107
    • /
    • 2015
  • This study describes the Bottom-up method for implementation of an ontology system from the RDB. The STNet, a structured terminology glossary based on RDB, was served as a test bed for converting to RDF ontology, for generating the inference rules, and for evaluating the results of the semantic search. We have used protege editor of the ontology developing tool to design ontologies with test data. We also tested the designed ontology with the Inference Engine (Pellet) of protege editor. The generated reference rules were tested by TBox and SPARQL queries through STNet ontology. The results of test show that the generated reference rules were verified as true and STNet ontology were also evaluated to be useful for searching the complex combination of semantic relation.

Searching association rules based on purchase history and usage-time of an item (콘텐츠 구매이력과 사용시간을 고려한 연관규칙탐색)

  • Lee, Bong-Kyu
    • Journal of Software Assessment and Valuation
    • /
    • v.16 no.1
    • /
    • pp.81-88
    • /
    • 2020
  • Various methods of differentiating and servicing digital content for individual users have been studied. Searching for association rules is a very useful way to discover individual preferences in digital content services. The Apriori algorithm is useful as an association rule extractor using frequent itemsets. However, the Apriori algorithm is not suitable for application to an actual content service because it considers only the reference count of each content. In this paper, we propose a new algorithm based on the Apriori that searches association rules by using purchase history and usage-time for each item. The proposed algorithm utilizes the usage time with the weight value according to purchase items. Thus, it is possible to extract the exact preference of the actual user. We implement the proposed algorithm and verify the performance through the actual data presented in the actual content service system.

A Study on the Cartographic Generalization of Stream Networks by Rule-based Modelling (규칙기반 모델링에 의한 하계망 일반화에 관한 연구)

  • Kim Nam-Shin
    • Journal of the Korean Geographical Society
    • /
    • v.39 no.4
    • /
    • pp.633-642
    • /
    • 2004
  • This study tries to generalize the stream network by constructing rule-based modelling. A study on the map generalization tends to be concentrated on development of algorithms for modification of linear features and evaluations to the limited cartographic elements. Rule-based modelling can help to improve previous algorithms by application of generalization process with the results that analyzing mapping principles and spatial distribution patterns of geographical phenomena. Rule-based modelling can be applied to generalize various cartographic elements, and make an effective on multi-scaling mapping in the digital environments. In this research, nile-based modelling for stream network is composed of generalization rule, algorithm for centerline extraction and linear features. Before generalization, drainage pattern was analyzed by the connectivity with lake to minimize logical errors. As a result, 17 streams with centerline are extracted from 108 double-lined streams. Total length of stream networks is reduced as 17% in 1:25,000 scale, and as 29% in 1:50,000. Simoo algorithm, which is developed to generalize linear features, is compared to Douglas-Peucker(D-P) algorithm. D-P made linear features rough due to the increase of data point distance and widening of external angle. But in Simoo, linear features are smoothed with the decrease of scale.

Suboptimal Decision Fusion in Wireless Sensor Networks under Non-Gaussian Noise Channels (비가우시안 잡음 채널을 갖는 무선 센서 네트워크의 준 최적화 결정 융합에 관한 연구)

  • Park, Jin-Tae;Koo, In-Soo;Kim, Ki-Seon
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.1-9
    • /
    • 2007
  • Decision fusion in wireless sensor networks under non-Gaussian noise channels is studied. To consider the tail behavior noise distributions, we use a exponentially-tailed distribution as a wide class of noise distributions. Based on a canonical parallel fusion model with fading and noise channels, the likelihood ratio(LR) based fusion rule is considered as an optimal fusion rule under Neyman-Pearson criterion. With both high and low signal-to-noise ratio (SNR) approximation to the optimal rule, we obtain several suboptimal fusion rules. and we propose a simple fusion rule that provides robust detection performance with a minimum prior information, Performance evaluation for several fusion rules is peformed through simulation. Simulation results show the robustness of the Proposed simple fusion rule.

  • PDF

Granule-based Association Rule Mining for Big Data Recommendation System (빅데이터 추천시스템을 위한 과립기반 연관규칙 마이닝)

  • Park, In-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.3
    • /
    • pp.67-72
    • /
    • 2021
  • Association rule mining is a method of showing the relationship between patterns hidden in several tables. These days, granulation logic is used to add more detailed meaning to association rule mining. In addition, unlike the existing system that recommends using existing data, the granulation related rules can also recommend new subscribers or new products. Therefore, determining the qualitative size of the granulation of the association rule determines the performance of the recommendation system. In this paper, we propose a granulation method for subscribers and movie data using fuzzy logic and Shannon entropy concepts in order to understand the relationship to the movie evaluated by the viewers. The research is composed of two stages: 1) Identifying the size of granulation of data, which plays a decisive role in the implications of the association rules between viewers and movies; 2) Mining the association rules between viewers and movies using these granulations. We preprocessed Netflix's MovieLens data. The results of meanings of association rules and accuracy of recommendation are suggested with managerial implications in conclusion section.