摘要
针对现有意见领袖识别算法难以捕获网络的动态特性这一现状,提出了一个基于时间变化图的网络论坛意见领袖识别算法。该算法将网络论坛的演变描述为一连串静态图,每一幅图代表一个给定时间窗口内用户间的所有交互。依据构造的量化指标识别不同时间窗口内的潜在意见领袖,这些意见领袖然后和其他时间窗口上的意见领袖相匹配以便识别随时间推移的真正意见领袖。实验结果证实了该算法的可行性和有效性。
Because the existing methods for identifying opinion leaders of the forums are diffcult to capture the dynamic characteristic of network,a algorithm for identifying opinion leaders based on time-varying graphs was proposed.The algorithm represents the evolution of the network as a sequence of static graphs,each of which represents the aggregated interactions over a given time-window.Each potential opinion leader is identified by aquantitative indicator,and these results are then matched each other so that reliable opinion leaders can be identified.Results prove that the proposed algorithm has good validity and feasibility.
出处
《计算机科学》
CSCD
北大核心
2012年第9期51-54,共4页
Computer Science
基金
西北工业大学基础研究基金(JC201149)资助
