2018年08月03日
Fuzzy logic 1
According to Hanamura (2005) the difference between set- and logic operation is very important. Two fuzzy sets are completely related in set operations. A set appears at the end of the operation again. For example, a set of the tolerant child is related with the set of a moderate child. A set of tolerant and moderate appears at the end of the operation again. The characters of the element being considered are related in logic operations. An element appears with definite features. The feature “moderate” of a child (e.g. Hans Castorp) is related with the feature “moderate” of the child (e.g. AND relation). The element appears with the feature “tolerant-moderate” at the end.
(19) AND relation
μA UND B (x) = min{μA(x); μB(x)} as we say, minimum operator
μA UND B (x) =μA (x)・μB(x) as we say, product operator
μA UND B (x)= max{0; [μA(x) + μB(x)-1]}
(20) OR relation
μA ODER B (x) = max{μA(x); μB(x)} as we say, maximum operator
μA ODER B (x) = μA(x)+B(x) -μA(x)・μB(x)
μA ODER B (x) = min{1;[μA(x) +μB(x)]}
When one considers the human logic and the way of thought, interestingly pure AND/ OR conjunction is rarely used. Usually a conjunction that appears somewhere in between AND/ OR conjunctions is used. In the Magic Mountain, one sees Hans Castorp as a hero and Joachim Ziemßen as a character. Hans Castorp is orphaned, tolerant and middle-size. Joachim Ziemßen is broad, big and careful.
Here a tolerant and strong man is sought, whereby both the features “tolerant” and “strong” should be equally important at the selection time simplistically. Therefore, Hans Castorp can fulfill the feature “tolerant”, but only sometimes he can be seen as “strong”. Consequently, the membership could be assumed as 0.9 “tolerant” and 0.5 “strong”.
(21) μduldsam (Hans Castorp) =0.9
μstark (HansCastorp) = 0.5
Analogously it could be adapted for Joachim Ziemßen.
(22) μduldsam (Joachim Ziehmßen) = 0.6
μstark (Joachim Ziehmßen) = 0.4
花村嘉英(2005)「計算文学入門−Thomas Mannのイロニーはファジィ推論といえるのか?」より英訳 translated by Yoshihisa Hanamura
(19) AND relation
μA UND B (x) = min{μA(x); μB(x)} as we say, minimum operator
μA UND B (x) =μA (x)・μB(x) as we say, product operator
μA UND B (x)= max{0; [μA(x) + μB(x)-1]}
(20) OR relation
μA ODER B (x) = max{μA(x); μB(x)} as we say, maximum operator
μA ODER B (x) = μA(x)+B(x) -μA(x)・μB(x)
μA ODER B (x) = min{1;[μA(x) +μB(x)]}
When one considers the human logic and the way of thought, interestingly pure AND/ OR conjunction is rarely used. Usually a conjunction that appears somewhere in between AND/ OR conjunctions is used. In the Magic Mountain, one sees Hans Castorp as a hero and Joachim Ziemßen as a character. Hans Castorp is orphaned, tolerant and middle-size. Joachim Ziemßen is broad, big and careful.
Here a tolerant and strong man is sought, whereby both the features “tolerant” and “strong” should be equally important at the selection time simplistically. Therefore, Hans Castorp can fulfill the feature “tolerant”, but only sometimes he can be seen as “strong”. Consequently, the membership could be assumed as 0.9 “tolerant” and 0.5 “strong”.
(21) μduldsam (Hans Castorp) =0.9
μstark (HansCastorp) = 0.5
Analogously it could be adapted for Joachim Ziemßen.
(22) μduldsam (Joachim Ziehmßen) = 0.6
μstark (Joachim Ziehmßen) = 0.4
花村嘉英(2005)「計算文学入門−Thomas Mannのイロニーはファジィ推論といえるのか?」より英訳 translated by Yoshihisa Hanamura
【このカテゴリーの最新記事】
-
no image
-
no image
-
no image
-
no image
-
no image
この記事へのコメント
コメントを書く
この記事へのトラックバックURL
https://fanblogs.jp/tb/7957663
※ブログオーナーが承認したトラックバックのみ表示されます。
この記事へのトラックバック