求提供IT2FLS toolbox

as123866

我网路上找不到 有人可以提供IT2FLS toolbox吗? 我做研究会要使用到IT2FLS GUI界面更好 拜托谢谢~

happy

是这个吗？

1. function [y,yl,yr]=IT2FLS(x,X,Y)
   
2. 
   
3. % y=IT2FLS(x,X,Y)
   
4. % Compute the output of an IT2 FLS. Dongrui Wu (drwu09@gmail.com), 3/11/2011
   
5. %
   
6. % x: Input to the IT2 FLS. Assume the FLS has N consequents and 1 consequent. Then, x can be a 1*N vector
   
7. %    or M*N matrix, each row corresponding to an input vector.
   
8. %
   
9. % X: Matrix describing the consequents part of the rulebase. Assume the rulebase has K rules:
   
10. %    IF x1 is X11 and x2 is X21, THEN y is y1
    
11. %    ...
    
12. %    IF x1 is X1K and x2 is X2K, THEN y is yK
    
13. % where X11-X2K are IT2 FSs and y1-yK are crisp intervals. Then,
    
14. %      X=[MF of X11, MF of X21;
    
15. %         ...
    
16. %         MF of X1K, MF of X2K]
    
17. % Note that each MF is represented by 9 points.
    
18. %
    
19. % Y: Matrix describing the consequent part of the rulebase. For the above rulebase,
    
20. %    Y=[y1;
    
21. %       ...
    
22. %       yK];
    
23. %
    
24. % y: Output of the IT2 FLS. It has as many rows as x, each row is the output for the corresponding row of x.
    
25. %    y=(yl+yr)/2
    
26. %
    
27. % yl: Lower bounds of the intervals output by the type-reducer.
    
28. %
    
29. % yr: Upper bounds of the intervals output by the type-reducer.
    
30. %
    
31. % Dongrui Wu, GE Research (drwu09@gmail.com)
    
32. %
    
33. 
    
34. if nargin<3
    
35.     display('Function IT2FLS: Must have three arguments. Abort.'); return;
    
36. end
    
37. 
    
38. if size(X,1)~=size(Y,1)
    
39.     display('Function IT2FLS: X must have the same number of rows as Y. Abort.'); return;
    
40. end
    
41. 
    
42. if size(x,2)~=size(X,2)/9
    
43.     display('Function IT2FLS: The number of columns in x must be equal to the number of IT2 FSs in each row of X. Abort'); return;
    
44. end
    
45. 
    
46. y=zeros(size(x,1),1);
    
47. yr=y; yl=y;
    
48. for i=1:size(x,1)
    
49.     fl=ones(1,size(X,1)); fu=fl;
    
50.     for j=1:size(X,1)
    
51.         for k=1:size(X,2)/9
    
52.             fu(j)=fu(j)*mg(x(i,k),X(j,9*(k-1)+(1:4)));
    
53.             fl(j)=fl(j)*X(j,9*k)*mg(x(i,k),X(j,9*(k-1)+(5:8)));
    
54.         end
    
55.     end
    
56.     [y(i),yl(i),yr(i)]=EIASC(Y(:,1)',Y(:,2)',fl,fu);
    
57. end
    
58. 
    
59. 
    
60. function [y,yl,yr,l,r]=EIASC(Xl,Xr,Wl,Wr,needSort)
    
61. 
    
62. %
    
63. % function [y,yl,yr,l,r]=EIASC(Xl,Xr,Wl,Wr,needSort)
    
64. %
    
65. % function to implement the EIASC algorithm in:
    
66. %
    
67. % D. Wu and M. Nie, "Comparison and Practical Implementation of Type-Reduction Algorithms for Type-2
    
68. % Fuzzy Sets and Systems," IEEE International Conference on Fuzzy Systems, Taipei, Taiwan, June 2011.
    
69. %
    
70. % Dongrui WU, GE Research (drwu09@gmail.com), 7/18/2010
    
71. %
    
72. % Xl: A row vector containing the lower bounds of x
    
73. % Xr: A row vector containing the upper bounds of x
    
74. % Wl: A row vector containing the lower bounds of w
    
75. % Wr: A row vector containing the upper bounds of w
    
76. % needSort: ??if at least one of Xl and Xr is not in ascending order.
    
77. %           ??if both Xl and Xr are in ascending order. Default ?.?
    
78. %y: (yl+yr)/2
    
79. %yl: lower bound of the type-reduced output
    
80. %yr: upper bound of the type-reduced output
    
81. %l: switch point for yl
    
82. %r: switch point for yr
    
83. 
    
84. ly=length(Xl); XrEmpty=isempty(Xr);
    
85. if XrEmpty;  Xr=Xl; end
    
86. if max(Wl)==0
    
87.     yl=min(Xl); yr=max(Xr);
    
88.     y=(yl+yr)/2;  l=1; r=ly-1; return;
    
89. end
    
90. index=find(Wr<10^(-10));
    
91. if length(index)==ly
    
92.     yl=min(Xl); yr=max(Xr);
    
93.     y=(yl+yr)/2; l=1; r=ly-1; return;
    
94. end
    
95. Xl(index)=[]; Xr(index)=[];
    
96. Wl(index)=[]; Wr(index)=[];
    
97. if nargin==4;  needSort=1; end
    
98. 
    
99. % Compute yl
    
100. if  needSort
     
101.     [Xl,index]=sort(Xl); Xr=Xr(index);
     
102.     Wl=Wl(index); Wr=Wr(index);
     
103. end
     
104. Wl2=Wl; Wr2=Wr;
     
105. for i=length(Xl):-1:2 % Make Xl unique
     
106.     if Xl(i)==Xl(i-1)
     
107.         Wl(i)=Wl(i)+Wl(i-1);
     
108.         Wr(i)=Wr(i)+Wr(i-1); Xl(i)=[];
     
109.         Wl(i-1)=[]; Wr(i-1)=[];
     
110.     end
     
111. end
     
112. ly=length(Xl);
     
113. if ly==1
     
114.     yl=Xl;  l=1;
     
115. else
     
116.     yl=Xl(end); l=1;
     
117.     a=Xl*Wl'; b=sum(Wl);
     
118.     while l < ly && yl > Xl(l)
     
119.         a=a+Xl(l)*(Wr(l)-Wl(l));
     
120.         b=b+Wr(l)-Wl(l);
     
121.         yl=a/b;   l=l+1;
     
122.     end
     
123. end
     
124. 
     
125. % Compute yr
     
126. if ~XrEmpty && needSort==1
     
127.     [Xr,index]=sort(Xr);
     
128.     Wl=Wl2(index); Wr=Wr2(index);
     
129. end
     
130. if ~XrEmpty
     
131.     for i=length(Xr):-1:2 % Make Xr unique
     
132.         if Xr(i)==Xr(i-1)
     
133.             Wl(i)=Wl(i)+Wl(i-1);
     
134.             Wr(i)=Wr(i)+Wr(i-1); Xr(i)=[];
     
135.             Wl(i-1)=[]; Wr(i-1)=[];
     
136.         end
     
137.     end
     
138. end
     
139. ly=length(Xr);
     
140. if ly==1
     
141.     yr=Xr; r=1;
     
142. else
     
143.     r=ly; yr=Xr(1);
     
144.     a=Xr*Wl'; b=sum(Wl);
     
145.     while r>0 && yr < Xr(r)
     
146.         a=a+Xr(r)*(Wr(r)-Wl(r));
     
147.         b=b+Wr(r)-Wl(r);
     
148.         yr=a/b;  r=r-1;
     
149.     end
     
150. end
     
151. y=(yl+yr)/2;
     
152. 
     
153. 
     
154. function u=mg(x,xMF,uMF)
     
155. 
     
156. % u=mg(x,xMF,uMF)
     
157. % function to compute the membership grades of x on a T1 FS
     
158. % Dongrui WU, GE Research (drwu09@gmail.com), 7/18/2010
     
159. %
     
160. % xMF: x-coordinates of the T1 FS
     
161. % uMF: u-coordinates of the T1 FS; default to be [0 1 1 0]
     
162. % u: membership of x on the T1 FS
     
163. 
     
164. if nargin==2
     
165.     uMF=[0 1 1 0];
     
166. elseif length(xMF)~=length(uMF)
     
167.     display('Function mg: xMF and uMF must have the same length. Abort.'); return;
     
168. end
     
169. 
     
170. [xMF,index]=sort(xMF); uMF=uMF(index);
     
171. 
     
172. u=zeros(size(x));
     
173. for i=1:length(x)
     
174.     if x(i)<=xMF(1)
     
175.         if xMF(1)==xMF(2)
     
176.             u(i)=1;
     
177.         end
     
178.     elseif x(i)>=xMF(end)
     
179.         if xMF(end-1)==xMF(end)
     
180.             u(i)=1;
     
181.         end
     
182.     else
     
183.         left=find(xMF<x(i),1,'last');     right=left+1;
     
184.         u(i)=uMF(left)+(uMF(right)-uMF(left))*(x(i)-xMF(left))/(xMF(right)-xMF(left));
     
185.     end
     
186. end

复制代码

调用实例

1. %% Illustrate the example in the tutorial.
   
2. %% Dongrui Wu, GE Research (drwu09@gmail.com), 7/18/2010
   
3. 
   
4. clc; clear all; close all;
   
5. 
   
6. X=[-1.5 -1.5 -.5 1.5 -1.5 -1.5 -1.5 .5 1  -1.5 -1.5 -.5 1.5 -1.5 -1.5 -1.5 .5  1
   
7.    -1.5 -1.5 -.5 1.5 -1.5 -1.5 -1.5 .5 1  -1.5   .5 1.5 1.5  -.5  1.5  1.5 1.5 1
   
8.    -1.5   .5 1.5 1.5  -.5  1.5  1.5 1.5 1  -1.5 -1.5 -.5 1.5 -1.5 -1.5 -1.5 .5  1
   
9.    -1.5   .5 1.5 1.5  -.5  1.5  1.5 1.5 1  -1.5   .5 1.5 1.5  -.5  1.5  1.5 1.5 1];
   
10. 
    
11. Y=[-1 -.9; -.6 -.4; .4 .6; .9 1];
    
12. 
    
13. x=[-.3 .6];
    
14. 
    
15. [y, yl, yr]=IT2FLS(x,X,Y)

复制代码

happy

下面是两份参考资料

as123866

谢谢～我看看

参考资料Very Good

ChaChing

google下可以找到!
Ref: Functions for interval type-2 fuzzy logic systems
http://www.mathworks.com/matlabc ... fuzzy-logic-systems