Towards a linguistic description of dependencies in data

• Autorzy: Batyrshin I. , Wagenknecht M.
• Języki publikacji: EN

Abstrakty

EN

The problem of a linguistic description of dependencies in data by a set of rules Rk: "If X is Tk then Y is Sk" is considered, where Tk's are linguistic terms like SMALL, BETWEEN 5 AND 7 describing some fuzzy intervals Ak. Sk's are linguistic terms like DECREASING and QUICKLY INCREASING describing the slopes pk of linear functions yk=pkx +qk approximating data on Ak. The decision of this problem is obtained as a result of a fuzzy partition of the domain X on fuzzy intervals Ak, approximation of given data {xi,yi}, i=1,...,n by linear functions yk=pkx+qk on these intervals and by re-translation of the obtained results into linguistic form. The properties of the genetic algorithm used for construction of the optimal partition and several methods of data re-translation are described. The methods are illustrated by examples, and potential applications of the proposed methods are discussed.

Słowa kluczowe

EN

fuzzy approximation; linguistic term; fuzzy rule; genetic algorithm

PL

informatyka

• Wydawca: Oficyna Wydawnicza Uniwersytetu Zielonogórskiego
• Czasopismo: International Journal of Applied Mathematics and Computer Science
• Rocznik: 2002
• Tom: Vol. 12, no 3
• Strony: 391--401
• Opis fizyczny: Bibliogr., rys., tab.

Twórcy

autor

Batyrshin I.

autor

Wagenknecht M.

• Institute of Problems of Informatics Academy of Sciences of Tatarstan and Kazan State Technological University K. Marx Str. 68, Kazan, 420015, Russia,