Identifying Algorithm for Opinion Leaders of Forums Based on Time-varying Graphs

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.