Correlation measures of dual hesitant fuzzy sets (Q1790020): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59003199, #quickstatements; #temporary_batch_1704809102140 |
Created claim: DBLP publication ID (P1635): journals/jam/WangNZ13, #quickstatements; #temporary_batch_1731475607626 |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Ming-Fang Ni / rank | |||
Property / author | |||
Property / author: Ming-Fang Ni / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/593739 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2049798354 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/jam/WangNZ13 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:47, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Correlation measures of dual hesitant fuzzy sets |
scientific article |
Statements
Correlation measures of dual hesitant fuzzy sets (English)
0 references
10 October 2018
0 references
Summary: The dual hesitant fuzzy sets (DHFSs) were proposed by \textit{B. Zhu} et al. [ibid. 2012, Article ID 879629, 13 p. (2012; Zbl 1244.03152)], which encompass fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and fuzzy multisets as special cases. Correlation measures analysis is an important research topic. In this paper, we define the correlation measures for dual hesitant fuzzy information and then discuss their properties in detail. One numerical example is provided to illustrate these correlation measures. Then we present a direct transfer algorithm with respect to the problem of complex operation of matrix synthesis when reconstructing an equivalent correlation matrix for clustering DHFSs. Furthermore, we prove that the direct transfer algorithm is equivalent to transfer closure algorithm, but its asymptotic time complexity and space complexity are superior to the latter. Another real world example, that is, diamond evaluation and classification, is employed to show the effectiveness of the association coefficient and the algorithm for clustering DHFSs.
0 references