基于邻层传播的相对重要节点挖掘方法

Relatively Important Nodes Mining Method Based on Neighbor Layer Diffuse

  • 摘要: 目前针对复杂网络中相对重要节点的挖掘方法已有一些成果,但方法的效率和准确性仍有待提高。该文基于如下假设—如果一个节点具有某种特征的邻居节点越多,则该节点具有此特征的可能性越大—提出了一种基于邻层传播(NLD)的相对重要节点挖掘算法,并通过实验比较与分析,验证了该方法的准确性与适用性。

     

    Abstract: At present, there have been some achievements in mining methods for relatively important nodes in complex networks, but the efficiency and accuracy of the methods still need to be improved. Based on the assumption that if a node has more neighbor nodes with certain characteristics, the more likely this node has such characteristics. This paper proposes a relatively important node mining algorithm based on neighbor layer diffuse (NLD), and verifies the accuracy and applicability of the method through experimental comparison and analysis.

     

/

返回文章
返回