• Title/Summary/Keyword: Fuzzy Matrix

Search Result 460, Processing Time 0.024 seconds

Extreme Preservers of Zero-term Rank Sum over Fuzzy Matrices

  • Song, Seok-Zun;Na, Yeon-Jung
    • Kyungpook Mathematical Journal
    • /
    • v.50 no.4
    • /
    • pp.465-472
    • /
    • 2010
  • In this paper, we consider two extreme sets of zero-term rank sum of fuzzy matrix pairs: $$\cal{z}_1(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=min\{z(X),z(Y)\}\};$$ $$\cal{z}_2(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=0\}$$. We characterize the linear operators that preserve these two extreme sets of zero-term rank sum of fuzzy matrix pairs.

Incremental Fuzzy Clustering Based on a Fuzzy Scatter Matrix

  • Liu, Yongli;Wang, Hengda;Duan, Tianyi;Chen, Jingli;Chao, Hao
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.359-373
    • /
    • 2019
  • For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithms are very popular. Usually, these algorithms only concern the within-cluster compactness and ignore the between-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS) clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-means algorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, so that they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweencluster matrix simultaneously to obtain the minimum within-cluster distance and maximum between-cluster distance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experiments on some artificial datasets and real datasets separately. And experimental results show that, compared with SPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

ON THE POWER SEQUENCE OF A FUZZY MATRIX CONVERGENT POWER SEQUENCE

  • Tian, Zhou;Liu, De-Fu
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.1
    • /
    • pp.147-166
    • /
    • 1997
  • The convergence of the power sequence of an $n{\times}n$ fuzzy matrix has been studied. Some theoretical necessary and sufficient con-ditions have been established for the power sequence to be convergent generally. Furthermore as one of our main concerns the convergence index was studied in detail especially for some special types of Boolean matrices. Also it has been established that the convergence index is bounded by $(n-1)^2+1$ from above for an arbitrary $n{\times}n$ fuzzy matrix if its power sequence converges. Our method is concentrated on the limit behavior of the power se-quence. It helped us to make our proofs be simpler and more direct that those in pure algebraic methods.

A study of MIMO Fuzzy system with a Learning Ability (학습기능을 갖는 MIMO 퍼지시스템에 관한 연구)

  • Park, Jin-Hyun;Bae, Kang-Yul;Choi, Young-Kiu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.3
    • /
    • pp.505-513
    • /
    • 2009
  • Z. Cao had proposed NFRM(new fuzzy reasoning method) which infers in detail using relation matrix. In spite of the small inference rules, it shows good performance than mamdani's fuzzy inference method. But the most of fuzzy systems are difficult to make fuzzy inference rules in the case of MIMO system. The past days, We had proposed the MIMO fuzzy inference which had extended a Z. Cao's fuzzy inference to handle MIMO system. But many times and effort needed to determine the relation matrix elements of MIMO fuzzy inference by heuristic and trial and error method in order to improve inference performances. In this paper, we propose a MIMO fuzzy inference method with the learning ability witch is used a gradient descent method in order to improve the performances. Through the computer simulation studies for the inverse kinematics problem of 2-axis robot, we show that proposed inference method using a gradient descent method has good performances.

Relaxed Stability Condition for Affine Fuzzy System Using Fuzzy Lyapunov Function (퍼지 리아푸노프 함수를 이용한 어파인 퍼지 시스템의 완화된 안정도 조건)

  • Kim, Dae-Young;Park, Jin-Bae;Joo, Young-Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.10
    • /
    • pp.1508-1512
    • /
    • 2012
  • This paper presents a relaxed stability condition for continuous-time affine fuzzy system using fuzzy Lyapunov function. In the previous studies, stability conditions for the affine fuzzy system based on quadratic Lyapunov function have a conservativeness. The stability condition is considered by using the fuzzy Lyapunov function, which has membership functions in the traditional Lyapunov function. Based on Lyapunov-stability theory, the stability condition for affine fuzzy system is derived and represented to linear matrix inequalities(LMIs). And slack matrix is added to stability condition for the relaxed stability condition. Finally, simulation example is given to illustrate the merits of the proposed method.

On Idempotent Intuitionistic Fuzzy Matrices of T-Type

  • Padder, Riyaz Ahmad;Murugadas, P.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.3
    • /
    • pp.181-187
    • /
    • 2016
  • In this paper, we examine idempotent intuitionistic fuzzy matrices and idempotent intuitionistic fuzzy matrices of T-type. We develop some properties on both idempotent intuitionistic fuzzy matrices and idempotent intuitionistic fuzzy matrices of T-type. Several theorems are provided and an numerical example is given to illustrate the theorems.

Fuzzy system identification and modification of fuzzy relation matrix (퍼지 제어규칙의 추정 및 퍼지 연관행렬의 수정화)

  • 이태호;박상배;이균경
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.567-572
    • /
    • 1991
  • This paper proposes an algorithm of fuzzy model modification which improves fuzzy relation matrix for multi-input/single output dynamic systems. Zadeh's possibility distribution plays an important role in the proposed algorithm and in the use of fuzzy models which are constructed by the proposed algorithm. The required computer capacity and time for implementing the proposed algorithm and resulting models are significantly reduced by introducing the concept of the referential fuzzy sets. A nonlinear system is given to show that the proposed algorithm can provide the fuzzy model with satisfactory accuracy.

  • PDF

Z. Cao's Fuzzy Reasoning Method using Learning Ability (학습기능을 사용한 Z. Cao의 퍼지추론방식)

  • Park, Jin-Hyun;Lee, Tae-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.193-196
    • /
    • 2008
  • Z. Cao had proposed NFRM(new fuzzy reasoning method) which infers in detail using relation matrix. In spite of the small inference rules, it shows good performance than mamdani's fuzzy inference method. In this paper, we propose 2. Cao's fuzzy inference method using learning ability witch is used a gradient descent method in order to improve the performances. Because it is difficult to determine the relation matrix elements by trial and error method which is needed many hours and effort. Simulation results are applied linear and nonlinear system show that the proposed inference method has good performances.

  • PDF

Document Layout Analysis Based on Fuzzy Energy Matrix

  • Oh, KangHan;Kim, SooHyung
    • International Journal of Contents
    • /
    • v.11 no.2
    • /
    • pp.1-8
    • /
    • 2015
  • In this paper, we describe a novel method for document layout analysis that is based on a Fuzzy Energy Matrix (FEM). A FEM is a two-dimensional matrix that contains the likelihood of text and non-text and is generated through the use of Fuzzy theory. The key idea is to define an Energy map for the document to categorize text and non-text. The proposed mechanism is designed for execution with a low-resolution document image, and hence our method has a fast processing speed. The proposed method has been tested on public ICDAR 2009 datasets to conduct a comparison against other state-of-the-art methods, and it was also tested with Korean documents. The results of the experiment indicate that this scheme achieves superior segmentation accuracy, in terms of both precision and recall, and also requires less time for computation than other state-of-the-art document image analysis methods.