Optimal Piecewise-Linear Approximation Algorithms for Complex Dependencies

2004 ◽  
Vol 65 (10) ◽  
pp. 1667-1674 ◽  
Author(s):  
E. V. Bauman ◽  
A. A. Dorofeyuk ◽  
G. V. Kornilov
2020 ◽  
Vol 39 (3) ◽  
pp. 3597-3615
Author(s):  
Guixiang Wang ◽  
Chenjie Shen ◽  
Yanyan Wang

In this paper, the problem of approximating general fuzzy number by using multi-knots piecewise linear fuzzy number is studied. First, r - s-knots piecewise linear fuzzy numbers are defined, and the conceptions of the I-nearest r - s-knots piecewise linear approximation and the II-nearest r - s-knots piecewise linear approximation are introduced for a general fuzzy number. Then, most importantly, we set up the methods to get the I-nearest r - s-knots piecewise linear approximation and the II-nearest r - s-knots piecewise linear approximation for a general fuzzy number. And then, we investigate some properties of the new approximation operators. Finally, we also present specific examples to show the effectiveness, usability and advantages of the methods proposed in this paper, and compare the methods with some other approximation algorithms.


Sign in / Sign up

Export Citation Format

Share Document