- 1、本文档共45页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
模糊数学pptCh3_Sec1-2-3
CH3 Fuzzy Relations, Fuzzy Matrices and Fuzzy Graphs Certainty relations: “mother-child relationship ” “linear function relation” y=a+bx ≤ ∈、=,etc. Uncertainty relations: “likeness relation” “friend relation” “trust relation” “almost equality” etc. 1. Binary relations Definition If R ? X×Y={(x, y)|x∈X and y∈Y} , then R is called a two-ary relation from X to Y. If (x, y)∈R,then it is written as xRy, or R(x, y)=1; 2.Representation Set, matrix and graph E.g. X={1,2,3,4},R={(1,1),(1,2),(2,3),(2,4),(4,2)}, Relation matrix of R is Relation graph of R is 3. Operations on relations inverse relation R-1={(x, y)|(y, x)∈R} composition R?S={(x, y)| ?t((x, t)∈R and (t, y)∈S)} Example Let X={a, b, c, d},R={(a, b), (b, a), (b, c), (c, d)}. 4. Properties Five basic properties:reflexivity,irreflexivity,symmetry, anti-symmetry and transition. (1) reflexive relation : ?x (x∈X→(x, x)∈R). e.g. R=the same family name (3) symmetric relation: ?x, ?y (x, y∈X and (x, y)∈R→(y, x)∈R). e.g. the same family name classmate (4) anti-symmetric relation:?x ?y (x, y∈X and (x, y)∈R∧(y, x)∈R→x=y). e.g. (5) transitive relation ?x?y?z(x,y,z∈X and (x,y)∈R and (y, z)∈R→(x, z)∈R), e.g. the same family name classmate (?) friendship (?) 5. Closure of relation Definition R′is called transitive closure of R , written as t(R), if it satisfies the following conditions: (1)R′is transitive (2)R?R′ (3)R ? R″and R″transitive imply R′? R″. 6. Equivalent relation Equivalent relation=reflexive + symmetric + transitive e.g. =, is called an equivalent class. Equivalent relation on a set is respond to a partition (划分) on it. e.g. R= The same family name of a student class X If Zhang San belongs to X, then [Zhang San]R=?, [Zhang San]R denotes all students whose family names are Zhang on X. Equivalent relation=reflexive + symmetric + transitive e.g. R=congruen
文档评论(0)