Fuzzy Rankings: Properties and Applications
In practice, a ranking of objects with respect to given set of criteria is of considerable importance. However, due to lack of knowledge, information of time pressure, decision makers might not be able to provide a (crisp) ranking of objects from the top to the bottom. Instead, some objects might be ranked equally, or better than other objects only to some degree. In such cases, a generalization of crisp rankings to fuzzy rankings can be more useful. The aim of the article is to introduce the notion of a fuzzy ranking and to discuss its several properties, namely orderings, similarity and indecisiveness. The proposed approach can be used both for group decision making or multiple criteria decision making when uncertainty is involved.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Comparision of Traditional and Fuzzy Failure Mode and Effects Analysis for Smart Grid Electrical Distribution Systems
Reliability Assessment is an indispensable technology for identifying, interpreting, and lessening the potential failures in safety-critical systems like smart grids. Failure modes and effects analysis (FMEA) is one of t…
Bipolar Fuzzy Soft sets and its applications in decision making problem
In this article, we combine the concept of a bipolar fuzzy set and a soft set. We introduce the notion of bipolar fuzzy soft set and study fundamental properties. We study basic operations on bipolar fuzzy soft set. We d…
Decision MakingA Comprehensive Survey of Fuzzy Implication Functions
Fuzzy implication functions are a key area of study in fuzzy logic, extending the classical logical conditional to handle truth degrees in the interval $[0,1]$. While existing literature often focuses on a limited number…
SurveyFuzzy Rough Sets Based on Fuzzy Quantification
One of the weaknesses of classical (fuzzy) rough sets is their sensitivity to noise, which is particularly undesirable for machine learning applications. One approach to solve this issue is by making use of fuzzy quantif…
Binary QuantificationThe Graph Cut Kernel for Ranked Data
Many algorithms for ranked data become computationally intractable as the number of objects grows due to the complex geometric structure induced by rankings. An additional challenge is posed by partial rankings, i.e. ran…
Recommendation Systems