• Title/Summary/Keyword: Fuzzy Relation

Search Result 373, Processing Time 0.021 seconds

INTUITIONISTIC FUZZY PMS-SUBALGEBRA OF A PMS-ALGEBRA

  • Derseh, Beza Lamesgin;Alaba, Berhanu Assaye;Wondifraw, Yohannes Gedamu
    • Korean Journal of Mathematics
    • /
    • v.29 no.3
    • /
    • pp.563-576
    • /
    • 2021
  • In this paper, we introduce the notion of intuitionistic fuzzy PMS-subalgebra of a PMS-algebra. The idea of level subsets of an intuitionistic fuzzy PMS-subalgebra of a PMS-algebra is introduced. The relation between intuitionistic fuzzy sets and their level sets in a PMS-algebra is examined, and some interesting results are obtained.

An Experimental Study on Fuzzy Document Retrieval System (퍼지개념을 적용한 질의식의 분석과 문헌정보 검색에 관한 연구)

  • Lee Seung Chai
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.21
    • /
    • pp.249-290
    • /
    • 1991
  • Theoretical developments in the information retrieval have offered a number of alternatives to traditional Boolean retrieval. Probability theory and fuzzy set theory have played prominent roles here. Fuzzy set theory is an attempt to generalize traditional set theory by permitting partial membership in a set and this means recognizing different degrees to which a document can match a request. In this study, an experimentation of a document retrieval system using the fuzzy relation matrix of the keywords is described and the results are offered. The queries composed of keywords and Boolean operaters AND, OR, NOT were processed in the retrieval method, and the method was implemented on the PC of 32bit level (30 MHz) in an experimental system. The measurement of the recall ratio and precision ratio verified the effectiveness of the proposed fuzzy relation matrix of keywords and retrieval method. Compared to traditional crisp method in the same document database, the recall ratio increased $10\%$ high although the precision ratio decreased slightly. The problems, in this experiment, to be resolved are first, the design of the automatic data input and fuzzy indexing modules, through which the system . can have the ability of competition and usefulness. Second, devising a systematic procedure for assigning fuzzy weights to keywords in documents and in queries.

  • PDF

INTERPOLATIVE REASONING FOE COMPUTATIONALLY EFFICIENT OPTIMAL FUZZY CONTROL

  • Kacprzyk, Janusz
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1270-1273
    • /
    • 1993
  • Fuzzy optimal control is considered. An optimal sequence of controls is sought best satisfying fuzzy constraints on the controls and fuzzy goals on the states (outputs), with a fuzzy system under control Control over a fixed and specified, implicitly specified, fuzzy, and infinite termination time is discussed. For computational efficiency a small number of reference fuzzy staters and controls is to be assumed by which fuzzy controls and stated are approximated. Optimal control policies reference fuzzy states are determined as a fuzzy relation used, via the compositional rule of inference, to derive an optimal control. Since this requires a large number of overlapping reference fuzzy controls and states implying a low computational efficiency, a small number of nonoverlapping reference fuzzy states and controls is assumed, and then interpolative reasoning is used to infer an optimal fuzzy control for a current fuzzy state.

  • PDF

A study in fault detection and diagnosis of induction motor by clustering and fuzzy fault tree (클러스터링과 fuzzy fault tree를 이용한 유도전동기 고장 검출과 진단에 관한 연구)

  • Lee, Seong-Hwan;Shin, Hyeon-Ik;Kang, Sin-Jun;Woo, Cheon-Hui;Woo, Gwang-Bang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.1
    • /
    • pp.123-133
    • /
    • 1998
  • In this paper, an algorithm of fault detection and diagnosis during operation of induction motors under the condition of various loads and rates is investigated. For this purpose, the spectrum pattern of input currents is used in monitoring the state of induction motors, and by clustering the spectrum pattern of input currents, the newly occurrence of spectrum patterns caused by faults are detected. For the diagnosis of the fault detected, a fuzzy fault tree is designed, and the fuzzy relation equation representing the relation between an induction motor fault and each fault type, is solved. The solution of the fuzzy relation equation shows the possibility of occurence of each fault. The results obtained are summarized as follows : (1) Using clustering algorithm by unsupervised learning, an on-line fault detection method unaffected by the characteristics of loads and rates is implemented, and the degree of dependency for experts during fault detection is reduced. (2) With the fuzzy fault tree, the fault diagnosis process become systematic and expandable to the whole system, and the diagnosis for sub-systems can be made as an object-oriented module.

  • PDF

Design of Target Tracking System Using a New Intelligent Algorithm

  • Noh, Sun-Young;Joo, Young-Hoon;Park, Jin-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.748-753
    • /
    • 2005
  • When the maneuver occurs, the performance of the standard Kalman filter has been degraded because mismatches between the modeled target dynamics and the actual target dynamics. To solve this problem, the unknown acceleration is determined by using the fuzzy logic based on genetic algorithm(GA) method. This algorithm is the method to estimate the increment of acceleration by a fuzzy system using th relation between maneuver filler residual and non-maneuvering one. To optimize this system, a GA is utilized. And then, the modified filter is corrected by the new update equation method which is a fuzzy system using the relation between the filter residual and its variation. To shows the feasibility of the suggested method with only one filter, the computer simulations system are provided, this method is compared with multiple model method.

SEVERAL KINDS OF INTUITIONISTIC FUZZY OPEN SETS AND INTUITIONISTIC FUZZY INTERIORS

  • Kim, Chang-Su;Kang, Jeong-Gi;Kim, Myoung-Jo;Ko, Mi-Young;Park, Mi-Ran
    • Honam Mathematical Journal
    • /
    • v.32 no.2
    • /
    • pp.307-331
    • /
    • 2010
  • The notion of intuitionistic fuzzy semi-pre interior (semi-pre closure) is introduced, and several related properties are investigated. Characterizations of an intuitionistic fuzzy regular open set, an intuitionistic fuzzy semi-open set and an intuitionistic fuzzy ${\gamma}$-open set are provided. A method to make an intuitionistic fuzzy regular open set (resp. intuitionistic fuzzy regular closed set) is established. A relation between an intuitionistic fuzzy ${\gamma}$-open set and an intuitionistic fuzzy semi-preopen set is considered. A condition for an intuitionistic fuzzy set to be an intuitionistic fuzzy ${\gamma}$-open set is discussed.

ROUGH SET THEORY APPLIED TO INTUITIONISTIC FUZZY IDEALS IN RINGS

  • Jun, Young-Bae;Park, Chul-Hwan;Song, Seok-Zun
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.551-562
    • /
    • 2007
  • This paper concerns a relationship between rough sets, intuitionistic fuzzy sets and ring theory. We consider a ring as a universal set and we assume that the knowledge about objects is restricted by an intuitionistic fuzzy ideal. We apply the notion of intutionistic fuzzy ideal of a ring for definitions of the lower and upper approximations in a ring. Some properties of the lower and upper approximations are investigated.

INTUITIONISTIC FUZZY FINITE SWITCHBOARD STATE MACHINES

  • Jun, Young-Bae
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.315-325
    • /
    • 2006
  • The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite state machines are introduced, and related properties are investigated. After we give a congruence relation on the set of all words of elements of X of finite length, the quotient structure is discussed. We show that the family of equivalence classes is a finite semigroup with identity.