网络性能排名:一种复杂网络比较方法
Network Performance Rank: An Approach for Comparison of Complex Networks
摘要:
研究人员通常专注于分析复杂网络内部发生的事情,并利用这些来区分节点。然而,在不同网络之间进行比较的努力较少。提出了一种基于性能的复杂网络排序方法。我们认为这是一个排序问题的决策分析的基础上发生的积极/消极的频繁事件为标准,并使用TOPSIS方法来排序的方案。为了给每个标准的网络分配一个分数,提出了一种估计随机节点上正/负频繁事件的期望值的统计方法。所提出的技术是有效的算法的复杂性,并能够区分事件之间发生的重要节点之间的那些不太重要的节点。在几个合成网络上进行的实验证明了该排名方法的可行性和适用性。
英文摘要:
Researchers have typically concentrated on analyzing what happens internally in a complex network and using this to distinguish between nodes. However, there has been less effort towards comparing between different networks. In this paper, we proposed a novel approach to rank alternative complex networks based on their performances. We consider this as a ranking problem in decision analysis based on occurring positive/negative frequent events as criteria, and using the TOPSIS method to rank alternatives. In order to assign a score to the networks for each criterion, a statistical method that estimates the expected value of positive/negative frequent events on a random node is presented. The proposed technique is efficient in terms of algorithm complexity and is capable of discriminating events occurring between important nodes over those between less significant nodes. The experiments, conducted on several synthetic networks, demonstrate the feasibility and applicability of the ranking methodology.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。