传递关系
群体决策
一致性(知识库)
排名(信息检索)
数学
财产(哲学)
偏好关系
计算机科学
群(周期表)
传递闭包
偏爱
模糊逻辑
人工智能
理论计算机科学
离散数学
组合数学
社会心理学
心理学
认识论
统计
哲学
有机化学
化学
作者
Barbara Pȩkala,Eulalia Szmidt,Janusz Kacprzyk
摘要
Human beings represent and process imperfect information in a natural way, whereas effective approaches are still being looked for in the area of soft computing. Atanassov's intuitionistic fuzzy sets and especially Atanassov's intuitionistic fuzzy relations are are tools that make it possible to model in an effective way imperfect information. In this paper, we discuss the transitivity problem of Atanassov's intuitionistic fuzzy relations. The transitivity property reflects the consistency of a preference relation. Therefore, transitivity is important from the point of view of real problems appearing, e.g., in group decision making, choice, and utility theories widely making use of the preference procedures. We study here in detail transitivity property of Atanassov's intuitionistic fuzzy relations and propose a new algorithm for generating weakly transitivity among the alternatives (options) considered. Next, making use of the new algorithm we propose a procedure of ranking of the alternatives in a group decision-making problem.
科研通智能强力驱动
Strongly Powered by AbleSci AI