• 제목/요약/키워드: set theory

검색결과 2,009건 처리시간 0.03초

Extracting Method of Kansei Design Rules Based on Rough Set Analysis

  • Nishino, Tatsuo;Nagamachi, Mitsuo
    • 한국감성과학회:학술대회논문집
    • /
    • 한국감성과학회 2002년도 춘계학술대회 논문집
    • /
    • pp.201-204
    • /
    • 2002
  • Kansei design knowledge acquisition stage is a crucial stage in kansei designing process and kansei engineering (KE) methodology. In kansei engineering methodology, it is essential to extract design knowledge or rules on relationships between customer's kansei and product design element. We attempt to construct a more powerful melted for extracting the design rules from kansei expremental data. We constucted a kansei experiment concerning color kansei evaluation, and analyzed the sane data by both conventional quantification theory type I and rough set theory. Finally, we compared the effectiveness of both methods for extracting rules and examined the extensions of rough set theory in kansei engineering.

  • PDF

REPRESENTATION OF INTUITIONISTIC FUZZY SOFT SET USING COMPLEX NUMBER

  • KHAN, MOHSIN
    • Journal of applied mathematics & informatics
    • /
    • 제35권3_4호
    • /
    • pp.331-347
    • /
    • 2017
  • Soft sets are fantastic mathematical tools to handle imprecise and uncertain information in complicated situations. In this paper, we defined the hybrid structure which is the combination of soft set and complex number representation of intuitionistic fuzzy set. We defined basic set theoretic operations such as complement, union, intersection, restricted union, restricted intersection etc. for this hybrid structure. Moreover, we developed this theory to establish some more set theoretic operations like Disjunctive sum, difference, product, conjugate etc.

CORE STABILITY OF DOMINATING SET GAMES

  • Kong, Liang;Fang, Qizhi;Kim, Hye-Kyung
    • 대한수학회지
    • /
    • 제45권3호
    • /
    • pp.871-881
    • /
    • 2008
  • In this paper, we study the core stability of the dominating set game which has arisen from the cost allocation problem related to domination problem on graphs. Let G be a graph whose neighborhood matrix is balanced. Applying duality theory of linear programming and graph theory, we prove that the dominating set game corresponding to G has the stable core if and only if every vertex belongs to a maximum 2-packing in G. We also show that for dominating set games corresponding to G, the core is stable if it is large, the game is extendable, or the game is exact. In fact, the core being large, the game being extendable and the game being exact are shown to be equivalent.

라프셋 이론이 적용에 의한 ID3의 개선 (Improvement of ID3 Using Rough Sets)

  • 정홍;김두완;정환묵
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
    • /
    • pp.170-174
    • /
    • 1997
  • This paper studies a method for making more efficient classification rules in the ID3 using the rough set theory. Decision tree technique of the ID3 always uses all the attributes in a table of examples for making a new decision tree, but rough set technique can in advance eleminate dispensable attributes. And the former generates only one type of classification rules, but the latter generates all the possibles types of them. The rules generated by the rough set technique are the simplist from as proved by the rough set theory. Therefore, ID3, applying the rough set technique, can reduct the size of the table of examples, generate the simplist form of the classification rules, and also implement an effectie classification system.

  • PDF

Rough Set-based Incremental Inductive Learning Algorithm Theory and Applications

  • Bang, Won-Chul;Z. Zenn Bien
    • 한국지능시스템학회논문지
    • /
    • 제11권7호
    • /
    • pp.666-674
    • /
    • 2001
  • Classical methods to find a minimal set of rules based on the rough set theory are known to be ineffective in dealing with new instances added to the universe. This paper introduces an inductive learning algorithm for incrementally retrieving a minimal set of rules from a given decision table. Then, the algorithm is validated via simulations with two sets of data, in comparison with a classical non-incremental algorithm. The simulation results show that the proposed algorithm is effective in dealing with new instances, especially in practical use.

  • PDF

The Improvement of Rough- set Theory Histogram in Color- image Segmentation

  • Zheng, Qi;Lee, Hyo Jong
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2011년도 추계학술발표대회
    • /
    • pp.429-430
    • /
    • 2011
  • Roughness set theory is a popular topic to use in color-image segmentation. A new popular color image segmentation algorithm is proposed by scientists with the point using traditional histogram and Histon construct roughness set histogram. But, there is still a problem about that is the correlativity of color vector in roughness set histogram, which take an inactive effect in the process of color-image segmentation. Therefore, this paper represents further research based on this and proposed an improved method proved through lot of experiments. The experimental result reduces the correlativity of color vector in roughness set histogram and calculation time remarkably.

중학교 수학교과서 7-가의 집합 단원 기술에 관한 언어학적 고찰 (A Linguistic Study on the Writing of Section 'Sets' in Middle School Mathematics Textbooks of 7-ga)

  • 정광택
    • 대한수학교육학회지:학교수학
    • /
    • 제8권2호
    • /
    • pp.177-213
    • /
    • 2006
  • 현재 우리나라에서 실시되고 있는 제7차 교육과정에 의한 중학교 수학은 제2차 교육과정 개정 시부터 도입된 집합 단원으로 시작하고 있다. 현대수학에서 집합론이 차지하는 중요성은 너무나 잘 알려져 있다. 따라서 중학교에 처음으로 진학한 학생들에게 집합에 대한 내용을 가르쳐야 한다는 당위성은 있지만 용어의 기술 방법이나 내용의 전개 등이 학생들의 이해를 돕는데 어려움을 주고 있다면 이후의 후속학습에도 많은 영향을 끼치게 될 것이다. 따라서 집합 단원의 내용을 기술하는데 있어서 보다 세심한 용어의 설명과 주의 깊은 내용의 전개 등을 통하여 중학교에 갓 진학한 학생들이 쉽게 접하도록 하여 수학이라는 과목에 흥미를 느끼게 해야 할 것이다. 본 연구에서는 집합 단원에 수록되어있는 용어와 내용의 기술에 대하여 언어학적인 측면에서 각 교과서별 내용을 분석하고, 집합단원에서 다루었던 용어와 내용 등이 7-가 교과서 전반에 걸쳐 얼마나 활용되고 있는지 등을 조사하여 효율적인 집합단원의 기술과 구성 등에 관한 방안을 고찰하였다.

  • PDF

Rough Set Theory와 Neuro-Fuzzy Network를 이용한 추론시스템 (Inference System Fusing Rough Set Theory and Neuro-Fuzzy Network)

  • 정일훈;서재용;연정흠;조현찬;전홍태
    • 전자공학회논문지S
    • /
    • 제36S권9호
    • /
    • pp.49-57
    • /
    • 1999
  • 퍼지 집합 이론과 신경망 이론의 융합은 퍼지논리 시스템의 최적 규칙 베이스를 얻기 위해 신경망을 적용하는 방향으로 주된 연구가 진행되고 있다. 그러나 이러한 접근 방법은 신경망의 제한된 학습능력으로 인해 최적성의 한계는 여전히 극복되지 못하고 있는 실정이다. 따라서 본 논문에서는 이러한 어려움을 극복하기 위해 입출력 데이터로부터 최적의 규칙을 얻을 수 있는 Rough Set 이론과 뉴로-퍼지의 새로운 융합기법을 제안한 알고리즘을 생성된 규칙 베이스가 중첩되지 않기 때문에 기존의 FNN과 비교하여 더욱더 우수함을 냉장고의 온도추론 시스템에 적요하여 검증하였다.

  • PDF

Fuzzy set 이론을 이용한 프로그레시브 가공의 공정설계에 관한 연구 (A Study for Process Planning of Progressive Working by the using of Fuzzy Set Theory)

  • 김영민;김재훈;김철;최재찬
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2001년도 춘계학술대회 논문집
    • /
    • pp.735-739
    • /
    • 2001
  • This paper describes a research work of developing computer-aided design of a product with bending and piercing for progressive working. An approach to the system for progressive working os based on the knowledge-based rules. Knowledge for the system is formulated from plasticity theorise, experimental results and the empirical knowledge of field experts. the system has been written in AutoLISP on the AutoCAD with a personal computer and is composed of three main modules, which are input and shape treatment, flat pattern layout and strip layout modules. Strip layout of the system is designed by using fuzzy set theory. Process planning is determinated by fuzzy value according to several rules. Strip layout drawing generated in strip layout module is presented in 3-D graphic forms, including bending sequences and piercing processes with punch profiles divided into for external area. Results obtained using the modules enable the manufacturer for progressive working of electric products to be more efficient in this field.

  • PDF