arrow
返回

An Iterative Algorithm to Derive Priority From Large-Scale Sparse Pairwise Comparison Matrix

delete2022-05-01
delete35
PRE
AI
H
Haomin Wang
G
Gang Kou
Y
Yi Peng *
DOI:10.1109/TSMC.2021.3049604delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Pairwise comparison matrix (PCM) is an important tool to rank items by deriving priorities and has been used in various applications. Though large-scale sparse PCMs appear frequently in today's big data environment, it is hard for existing prioritization methods to handle large-scale sparse PCMs efficiently due to the curse of dimensionality. The goal of this article is to propose a new algorithm, bipartite graph iterative method (BGIM), to derive priorities from large-scale sparse PCMs. We first extended graph representations of PCMs to bipartite graphs. A transition matrix was induced by resource allocation on the bipartite graph. Finally, an iterative algorithm was designed to calculate priorities. The theoretical properties of the BGIM were analyzed to show its ability to derive priorities from large-scale sparse PCMs. Two experiments were conducted to validate the proposed approach. The numerical examples indicated that the BGIM can deal with traditional decision problems and derive reliable priorities with minimum Euclidean distance (ED) and minimum violation (MV) among the tested methods. The simulation examples suggested that the BGIM can not only derive reliable priorities from large-scale sparse PCMs but also require the least computation time compared with eight prioritization approaches. To demonstrate its applicability to real-world large-scale problems, we applied the BGIM to rank movies using MovieLens dataset with more than 100,000 ratings for 9125 movies. The results showed that the BGIM was the fastest approach and obtained the best ranking among the average ratings and the five prioritization methods.
Keyword:
Phase change materials
Iterative methods
Sparse matrices
Optimization methods
Motion pictures
Bipartite graph
Reliability
Bipartite graph
iterative algorithm
large-scale sparse PCM
pairwise comparison matrix (PCM)
prioritization method
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

S
southwestern university of finance & economics - china
学者数:
3.0K
论文数: 3.4K
被引数: 4
引用论文

引用论文

Identification of connexin43 as a functional target for Wnt signalling
err1998-06-15
err0
PREAI
errMarcel A. G. van der Heyden; Martin B. Rook; Monique M. P. Hermans; Gert Rijksen; Johannes Boonstra; Libert H. K. Defize; Olivier H. J. Destrée
err分享
err收藏
err分享
err收藏
学者 查看更多内容