EN
The problem of a linguistic description of dependencies in data by a set of rules R_k: “If X is T_k then Y is S_k” is considered, where T_k’s are linguistic terms like SMALL, BETWEEN 5 AND 7 describing some fuzzy intervals A_k. S_k’s are linguistic terms like DECREASING and QUICKLY INCREASING describing the slopes p_k of linear functions y_k = p_{k}x + q_k approximating data on A_k. The decision of this problem is obtained as a result of a fuzzy partition of the domain X on fuzzy intervals A_k, approximation of given data {x_i, y_i}, i = 1, . . . , n by linear functions y_k = p_{k}x + q_k 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.