11.02.2014 Views

Chapter X: Introduction to Fuzzy Set Theory Uncertainty is universal ...

Chapter X: Introduction to Fuzzy Set Theory Uncertainty is universal ...

Chapter X: Introduction to Fuzzy Set Theory Uncertainty is universal ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

A ⊗<br />

−γ γ<br />

γ B = (A ∩ B)<br />

1<br />

⋅(A<br />

∪ B)<br />

(X.4)<br />

where γ <strong>is</strong> between 0 and 1 and controls the amount of “mixing” of the union and intersection<br />

components, i.e., if γ <strong>is</strong> close <strong>to</strong> 0, the hybrids acts like an intersection, near 1 produces a union-like<br />

response, and for γ around 0.5, the hybrid takes on the character<strong>is</strong>tics of a generalized mean.<br />

Zimmermann and Zysno [1980] proposed a hybrid opera<strong>to</strong>r for multicriteria aggregation that was<br />

modeled after the compensa<strong>to</strong>ry nature of human aggregation. Th<strong>is</strong> hybrid opera<strong>to</strong>r (γ model) <strong>is</strong> an<br />

example of Equation (X.4) and <strong>is</strong> given by:<br />

where,<br />

n<br />

and∑ δ i = n<br />

i=<br />

1<br />

aggregated.<br />

n<br />

n<br />

δ −γ<br />

δ<br />

Y = (<br />

γ<br />

∏(a<br />

) i )<br />

1<br />

(1 −∏(1<br />

− a ) i<br />

i<br />

i ) (X.5)<br />

i=<br />

1<br />

i=<br />

1<br />

a i ∈[0,1] are the criteria sat<strong>is</strong>factions <strong>to</strong> be aggregated, 0 ≤ γ ≤ 1 <strong>is</strong> the mixing coefficient,<br />

. Here, δ i are weights associated with each criterion a i and n <strong>is</strong> the number of criteria being<br />

Y<br />

δ 1<br />

γ<br />

………<br />

Final Node<br />

δ n<br />

Node 1<br />

γ<br />

…….…..……<br />

γ<br />

Node n<br />

δ 1<br />

….<br />

δ n<br />

δ 1<br />

…..<br />

δ n<br />

….<br />

……<br />

a 1 a n a 1 a n<br />

Figure X.4 A fuzzy aggregation network of multiplicative hybrids used in [Parekh and Keller, 2007].<br />

Kr<strong>is</strong>hnapuram and Lee [1992a,b] also developed a back-propagation algorithm <strong>to</strong> learn the parameters of<br />

opera<strong>to</strong>rs of th<strong>is</strong> type in a network-based dec<strong>is</strong>ion application. While the algorithm converged, the

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!