z-logo
Premium
Some cosine similarity measures and distance measures between q ‐rung orthopair fuzzy sets
Author(s) -
Liu Donghai,
Chen Xiaohong,
Peng Dan
Publication year - 2019
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.22108
Subject(s) - cosine similarity , mathematics , measure (data warehouse) , euclidean distance , similarity measure , similarity (geometry) , distance measures , trigonometric functions , axiom , euclidean geometry , fuzzy logic , point (geometry) , fuzzy measure theory , fuzzy set , artificial intelligence , membership function , computer science , data mining , statistics , image (mathematics) , cluster analysis , geometry
In this paper, we consider some cosine similarity measures and distance measures between q ‐rung orthopair fuzzy sets ( q ‐ROFSs). First, we define a cosine similarity measure and a Euclidean distance measure of q ‐ROFSs, their properties are also studied. Considering that the cosine measure does not satisfy the axiom of similarity measure, then we propose a method to construct other similarity measures between q ‐ROFSs based on the proposed cosine similarity and Euclidean distance measures, and it satisfies with the axiom of the similarity measure. Furthermore, we obtain a cosine distance measure between q ‐ROFSs by using the relationship between the similarity and distance measures, then we extend technique for order of preference by similarity to the ideal solution method to the proposed cosine distance measure, which can deal with the related decision‐making problems not only from the point of view of geometry but also from the point of view of algebra. Finally, we give a practical example to illustrate the reasonableness and effectiveness of the proposed method, which is also compared with other existing methods.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here