• Title/Summary/Keyword: 일반화된 지식

Search Result 188, Processing Time 0.025 seconds

Development Failure Diagnosis Expert System Model using the Fuzzy Inference Knowledge-based- (퍼지추론 지식베이스를 활용한 고장진단 전문가시스템 모델 연구)

  • 박주식;강경식
    • Proceedings of the Safety Management and Science Conference
    • /
    • 1999.11a
    • /
    • pp.133-146
    • /
    • 1999
  • 오늘날의 산업용 로봇, CNC 공작기계 및 여러 산업설비들은 시스템간에 관계가 복잡하게 연결되어 높은 신뢰성(reliability)을 달성하여 왔다. 그러나 가동시 발생하는 결과의 고장 가능성은 적은 반면에, 고장 발생의 파급 효과는 매우 높은 것으로 나타났다. 따라서 복잡한 구조의 산업설비들에 대한 안전진단 결과들을 적절하게 분석하고 관리할 필요성이 크게 대두되고 있다. 이러한 안전진단 작업은 여러 가지 정량적ㆍ정성적인 방법들을 포함하는 전형적인 분석방법이 필요하다. 최근에는 고장탐색, 진단처리 작업 및 신뢰성 분석 작업에 지식기반(knowledge-based)을 기초로한 퍼지 전문가 시스템을 적용하고자 하는 시도가 많이 이루어지고 있다. 안전진단 분석에 관한 일반화된 지식은 이들 후속 단계들에서 상당히 효율적일 수 있다. 그러나 이러한 연구를 수행하기에는 지금까지 상대적으로 열악한 계산 도구들을 이용하였기 때문에 안전진단 분석을 행하기에는 한계가 있었다. 그러나 오늘날 컴퓨터를 이용하여 위의 여러 단계들의 수행과정에 안전진단 분석을 행할 수 있는 적절한 방법으로써, 지식-기반(knowledge-base) 전문가 시스템들을 이용하는 방법을 연구하고 있다. 이에 본 연구는 시스템의 설계단계 뿐만 아니라, 시스템의 가동ㆍ유지ㆍ보수ㆍ수리시에도 비전문가가 고장안전진단을 수행할 수 있도록 하는데 목표를 두었다.

  • PDF

Restructuring a Feed-forward Neural Network Using Hidden Knowledge Analysis (학습된 지식의 분석을 통한 신경망 재구성 방법)

  • Kim, Hyeon-Cheol
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.5
    • /
    • pp.289-294
    • /
    • 2002
  • It is known that restructuring feed-forward neural network affects generalization capability and efficiency of the network. In this paper, we introduce a new approach to restructure a neural network using abstraction of the hidden knowledge that the network has teamed. This method involves extracting local rules from non-input nodes and aggregation of the rules into global rule base. The extracted local rules are used for pruning unnecessary connections of local nodes and the aggregation eliminates any possible redundancies arid inconsistencies among local rule-based structures. Final network is generated by the global rule-based structure. Complexity of the final network is much reduced, compared to a fully-connected neural network and generalization capability is improved. Empirical results are also shown.

An Implementation of Optimal Rules Discovery System: An Integrated Approach Based on Concept Hierarchies, Information Gain, and Rough Sets (최적 규칙 발견 시스템의 구현: 개념 계층과 정보 이득 및 라프셋에 의한 통합 접근)

  • 김진상
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.232-241
    • /
    • 2000
  • This study suggests an integrated method based on concept hierarchies, information gain, and rough set theory for efficient discovery rules from a large amount of data, and implements an optimal rules discovery system. Our approach applies attribute-oriented concept ascension technique to extract generalized knowledge from a database, knowledge reduction technique to remove superfluous attributes and attribute values, and significance of attributes to induce optimal rules. The system first reduces the size of database by removing the duplicate tuples through the condition attributes which have no influences on the decision attributes, and finally induces simplified optimal rules by removing the superfluous attribute values by analyzing the dependency relationships among the attributes. And we induce some decision rules from actual data by using the system and test rules to new data, and evaluate that the rules are well suited to them.

  • PDF

A Study on the Learning Shape Knowledge and Design with Inductive Generalization (귀납적 일반화를 이용한 형태지식의 습득과 디자인에 관한 연구)

  • Cha, Myung-Yeol
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.20-29
    • /
    • 2010
  • Art historians and critics have defined the style as common features appeared in a class of objects. Abstract common features from a set of objects have been used as a bench mark for date and location of original works. Commonalities in shapes are identified by relationships as well as physical properties from shape descriptions. This paper will focus on how the computer and human can recognize common shape properties from a class of shape objects to learn design knowledge. Shape representation using schema theory has been explored and possible inductive generalization from shape descriptions has been investigated. Also learned shape knowledge can be used. for new design process as design concept. Several design process such as parametric design, replacement design, analogy design etc. are used for these design processes. Works of Mario Botta and Louis Kahn are analyzed for explicitly clarifying the process from conceptual ideas to final designs. In this paper, theories of computer science, artificial intelligence, cognitive science and linguistics are employed as important bases.

An Implementation d Lecture authoring tool with JMF (JMF(Java Media Framework)로 구현한 강의 저작 도구)

  • Kim Il-Min
    • Journal of Digital Contents Society
    • /
    • v.6 no.1
    • /
    • pp.13-17
    • /
    • 2005
  • With the development of internet and networking technology, on-line remote educations in many area are being experimented. As on-line remote educations become more common, many people make multimedia contents for educational purpose. We designed and implemented a lecture authoring tool which provide easy way to build educational multimedia contents. We implemented the authoring tool with Java JMF, which can be executed any computer hardware. The purpose of this paper is to share the experience of implementing authoring tool and the implementation result of the authoring tool using Java JMF.

  • PDF

대화형 사례 기반 계획 시스템의 설계 및 구현

  • Kim, Man-Su;Yu, Chang-Hun;Kim, In-Cheol
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2007.11a
    • /
    • pp.533-544
    • /
    • 2007
  • 사례 기반 계획 시스템은 과거의 유사한 사례 계획들을 이용함으로써 새로운 문제를 위한 계획을 효율적으로 생성할 수 있다. 하지만 대부분의 기존 사�� 기반 계획 시스템들은 사례 검색 및 사례 일반화를 위한 제한적 기능들만을 제공할 뿐만 아니라, 계획 생성과정에 사용자 참여를 허용하지 않는다. 이러한 문제점들을 극복하기 위해, 본 논문에서는 새로운 사례 기반 계획시스템인 JCBP를 제안한다. 본 논문에서는 먼저 JCBP 시스템의 설계와 구현에 대해 설명하고, 실험을 통해 JCBP시스템의 성능을 분석한다. JCBP 시스템은 효율적인 메모리 사용과 사례 검색을 위해 각 도메인의 동일한 작업목표를 가진 사례들을 개별 사례베이스로 그룹화하고, 이들에 대한 색인들을 유지한다. 도 이 시스템은 문제모델로부터 자동으로 추출한 휴리스틱 지식을 사례 검색과 적응 단계에 이용하며, 목표 회귀를 통한 사례 일반화 기능을 제공한다. 또한 JCBP 시스템은 대화형 모드를 통해 혼합 주도 계획 생성 기능을 제공한다. 따라서 사용자의 지식과 선호도를 이용할 수 있어, 계획 생성의 복잡도를 줄이고 사용자의 만족도를 높일 수 있다.

  • PDF

Study on Algorithms of Mobile Vector Map Generalization Operators for Location Information Search (위치 정보 검색을 위한 모바일 벡터 지도 일반화 연산 알고리즘 연구)

  • Kim, Hyun-Woo;Choi, Jin-Oh
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.167-170
    • /
    • 2005
  • In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. We will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources

  • PDF

Spatiotemporal Moving Pattern Discovery using Location Generalization of Moving Objects (이동객체 위치 일반화를 이용한 시공간 이동 패턴 탐사)

  • Lee, Jun-Wook;Nam, Kwang-Woo
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1103-1114
    • /
    • 2003
  • Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.

Reliability of Delphi survey for traditional knowledge on agricultural resources (생물자원 전통지식 추출을 위한 델파이조사의 신뢰성 연구)

  • Lee, Ki Hoon;Song, Mi-Jang;Kim, Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.4
    • /
    • pp.947-956
    • /
    • 2015
  • In the knowledge and information age, to discover and protect Intellectual Properties would be very important for their economic value as a major growth engine. This study evaluated the reliability of a Delphi survey conducted by experts to assess the value of agricultural resources knowledge obtained from literature reviews and field interviews. Delphi method is collecting the opinions of experts for several rounds repeatedly, in the next round the experts have chance to modify their opinion. Scores between two rounds are highly correlated and standard deviations are declined for second round to imply that some correction of their evaluations are made. To check reliability of Delphi survey of two rounds Cronbach's reliability coefficient and Generalizability coefficient are derived. The Cronbach alpha's supported the reliability of the method, but the Generalizability analysis revealed some unexpected results while checking the variance components of sources of measurement errors. Despite the increased reliability coefficients, the deviations between the raters are increased which means that additional rounds are required to get consensus, the goal of Delphi research.