Pattern classification using fuzzy relational calculus

نویسندگان

  • Kumar S. Ray
  • Tapan Kr. Dinda
چکیده

Our aim is to design a pattern classifier using fuzzy relational calculus (FRC) which was initially proposed by Pedrycz (1990). In the course of doing so, we first consider a particular interpretation of the multidimensional fuzzy implication (MFI) to represent our knowledge about the training data set. Subsequently, we introduce the notion of a fuzzy pattern vector to represent a population of training patterns in the pattern space and to denote the antecedent part of the said particular interpretation of the MFI. We introduce a new approach to the computation of the derivative of the fuzzy max-function and min-function using the concept of a generalized function. During the construction of the classifier based on FRC, we use fuzzy linguistic statements (or fuzzy membership function to represent the linguistic statement) to represent the values of features (e.g., feature F/sub 1/ is small and F/sub 2/ is big) for a population of patterns. Note that the construction of the classifier essentially depends on the estimate of a fuzzy relation /spl Rfr/ between the input (fuzzy set) and output (fuzzy set) of the classifier. Once the classifier is constructed, the nonfuzzy features of a pattern can be classified. At the time of classification of the nonfuzzy features of the testpatterns, we use the concept of fuzzy masking to fuzzify the nonfuzzy feature values of the testpatterns. The performance of the proposed scheme is tested on synthetic data. Finally, we use the proposed scheme for the vowel classification problem of an Indian language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern Classification Based on Conventional Interpretation of MFI

Our aim is to design a pattern classifier using fuzzy relational calculus (FRC) which was initially proposed by Pedrycz (Pattern Recognition 23 (1/2), 121–146, 1990). In the course of doing so, we first consider a particular interpretation of the multidimensional fuzzy implication (MFI) to represent our knowledge about the training data set. Subsequently, we introduce the notion of a fuzzy patt...

متن کامل

Software Development in Intuitionistic Fuzzy Relational Calculus

In this study, MATLAB program for computing power of an IF matrix, strength of connectedness and index matrix of an IFG and its line IFG have been developed. This has been formulated using the theoretical aspects which are proved in [4]. These programs have been verified with suitable illustrations. The proposed MATLAB program is simple, efficient and takes less computational time in image segm...

متن کامل

Intuitionistic Fuzzy Relational Calculus: an Overview

This paper presents an attempt to embed and unify research on intuitionistic fuzzy (IF) relations into a broad, formal yet intuitive framework inspired by fuzzy relational calculus. The need for the resulting “IF relational calculus” is motivated in semantical terms of vagueness and uncertainty; its basic definitions and results are introduced, and opportunities and challenges specific to intui...

متن کامل

Fuzzy Database Query Languages and Their Relational Completeness Theorem

Two fuzzy database query languages are proposed. They are used to query to fuzzy databases that are enhanced from relational databases in a way that fuzzy sets are allowed in both attribute values and truth values. A fuzzy calculus query language is constructed based on the relational calculus and a fuzzy algebra query language is also constructed based on the relational algebra. In addition, t...

متن کامل

A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization

This paper introduces a core calculus for pattern-matching in production rule languages: the Calculus for Aggregating Matching Patterns (CAMP). CAMP is expressive enough to capture modern rule languages such as JRules, including extensions for aggregation. We show how CAMP can be compiled into a nested-relational algebra (NRA), with only minimal extension. This paves the way for applying relati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society

دوره 33 1  شماره 

صفحات  -

تاریخ انتشار 2003