An Improved Ordered Visibility Graph Aggregation Operator for MADM
For multi-attribute decision-making (MADM), how to aggregate data and determine attribute weight is still an open issue. Ordered visibility graph aggregation (OVGA) operator can objectively and effectively determine the weight of each attribute value in the network and solve the problem of data fusi...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9768826/ |
| _version_ | 1798033355216781312 |
|---|---|
| author | Dan Wang Feng Tian Daijun Wei |
| author_facet | Dan Wang Feng Tian Daijun Wei |
| author_sort | Dan Wang |
| collection | DOAJ |
| description | For multi-attribute decision-making (MADM), how to aggregate data and determine attribute weight is still an open issue. Ordered visibility graph aggregation (OVGA) operator can objectively and effectively determine the weight of each attribute value in the network and solve the problem of data fusion. OVGA not only considers the attribute values of nodes in the network, but also synthesizes the influence of the distance between nodes on the weight distribution. However, when there are multiple identical attribute values in the network, the weights assigned by this method are unreasonable. This paper proposes an improved OVGA operator method based on OVGA, which redefines the distance between visual nodes. When there are multiple identical attribute values in the network, the distance formula is redefined in the form of a piecewise function, so that equivalent nodes are given the same weight. The improved method proposed in this paper not only considers the correlation between the visible nodes, but also fully considers the rationality of the weight distribution of the equivalent node support after the fusion of the entire network data. Meanwhile, through several practical application examples which including an application in produced water management, Dongping reservoir tourism resources and the academic ranking of world universities to illustrate the effectiveness and practicability of this method for MADM in complex networks. |
| first_indexed | 2024-04-11T20:29:04Z |
| format | Article |
| id | doaj.art-4125ed5c52484378acd18a67830511a7 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-11T20:29:04Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-4125ed5c52484378acd18a67830511a72022-12-22T04:04:33ZengIEEEIEEE Access2169-35362022-01-0110934649347410.1109/ACCESS.2022.31726849768826An Improved Ordered Visibility Graph Aggregation Operator for MADMDan Wang0Feng Tian1Daijun Wei2School of Mathematics and Statistics, Hubei Minzu University, Enshi, ChinaSchool of Mathematics and Statistics, Hubei Minzu University, Enshi, ChinaSchool of Mathematics and Statistics, Hubei Minzu University, Enshi, ChinaFor multi-attribute decision-making (MADM), how to aggregate data and determine attribute weight is still an open issue. Ordered visibility graph aggregation (OVGA) operator can objectively and effectively determine the weight of each attribute value in the network and solve the problem of data fusion. OVGA not only considers the attribute values of nodes in the network, but also synthesizes the influence of the distance between nodes on the weight distribution. However, when there are multiple identical attribute values in the network, the weights assigned by this method are unreasonable. This paper proposes an improved OVGA operator method based on OVGA, which redefines the distance between visual nodes. When there are multiple identical attribute values in the network, the distance formula is redefined in the form of a piecewise function, so that equivalent nodes are given the same weight. The improved method proposed in this paper not only considers the correlation between the visible nodes, but also fully considers the rationality of the weight distribution of the equivalent node support after the fusion of the entire network data. Meanwhile, through several practical application examples which including an application in produced water management, Dongping reservoir tourism resources and the academic ranking of world universities to illustrate the effectiveness and practicability of this method for MADM in complex networks.https://ieeexplore.ieee.org/document/9768826/Visibility graphaggregation operatorthe ordered weighted average operatormulti-attribute decision making |
| spellingShingle | Dan Wang Feng Tian Daijun Wei An Improved Ordered Visibility Graph Aggregation Operator for MADM IEEE Access Visibility graph aggregation operator the ordered weighted average operator multi-attribute decision making |
| title | An Improved Ordered Visibility Graph Aggregation Operator for MADM |
| title_full | An Improved Ordered Visibility Graph Aggregation Operator for MADM |
| title_fullStr | An Improved Ordered Visibility Graph Aggregation Operator for MADM |
| title_full_unstemmed | An Improved Ordered Visibility Graph Aggregation Operator for MADM |
| title_short | An Improved Ordered Visibility Graph Aggregation Operator for MADM |
| title_sort | improved ordered visibility graph aggregation operator for madm |
| topic | Visibility graph aggregation operator the ordered weighted average operator multi-attribute decision making |
| url | https://ieeexplore.ieee.org/document/9768826/ |
| work_keys_str_mv | AT danwang animprovedorderedvisibilitygraphaggregationoperatorformadm AT fengtian animprovedorderedvisibilitygraphaggregationoperatorformadm AT daijunwei animprovedorderedvisibilitygraphaggregationoperatorformadm AT danwang improvedorderedvisibilitygraphaggregationoperatorformadm AT fengtian improvedorderedvisibilitygraphaggregationoperatorformadm AT daijunwei improvedorderedvisibilitygraphaggregationoperatorformadm |