摘要
A visibility graph fusion method with weighted average is proposed to solve the problem that the classical weighted averaging fusion methods cannot effectively reduce the information loss and make reasonable judgments quickly. First, argument values are ordered in a descending order to form a time series. After that, a network is constructed based on the visibility graph, and the time series is converted into a graph. The data and network nodes correspond one to one. Then a support function is proposed to measure the relationship between the nodes, and the weights of original data are obtained. Finally, the original data are weighted and fused to get final results. Compared with the classical methods, the new method deals with the weights from a more objective perspective, and it is more accurate and effective when dealing with decision making problems. An example of produced water management is presented to show that the proposed method is reasonable and practical. Moreover, this method reduces the information loss in the fusion process, and hardly produces a counter-intuitive result. It greatly improves the effectiveness of decision analysis.
投稿的翻译标题 | A Visibility Graph Information Fusion Method with Weighted Average |
---|---|
源语言 | 繁体中文 |
页(从-至) | 145-149 and 157 |
期刊 | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University |
卷 | 52 |
期 | 4 |
DOI | |
出版状态 | 已出版 - 10 4月 2018 |
关键词
- Aggregation operator
- Complex networks
- Decision analysis
- Information fusion
- Visibility graph