In this paper,we introduce a long-term follow-up specific individual searching(SIS)model.This model introduces the concept of node search contributions by considering the characteristics of the network structure.A nod...In this paper,we introduce a long-term follow-up specific individual searching(SIS)model.This model introduces the concept of node search contributions by considering the characteristics of the network structure.A node search contribution indicates the ability of a certain node to correctly guide the search path and successfully complete an SIS.The influencing factors of node search contributions have three components:the individual influence index,attribute similarity,and node search willingness.On the basis of node search contributions and the PeopleRank idea,this paper proposes an SIS model based on node search contribution values and conducts comparison experiments with several mainstream SIS algorithms in three aspects:the search failure rate,the minimum number of search hops,and the search size.The experimental results verify the advanced nature and operability of the model proposed in this paper,which presents theoretical and practical significance to the quantitative study of the SIS process.展开更多
基金This work was supported by the National Key Research and Development Program of China(No.2016YFC0901303)the National Natural Science Foundation of China(Nos.72004147 and 62173158).
文摘In this paper,we introduce a long-term follow-up specific individual searching(SIS)model.This model introduces the concept of node search contributions by considering the characteristics of the network structure.A node search contribution indicates the ability of a certain node to correctly guide the search path and successfully complete an SIS.The influencing factors of node search contributions have three components:the individual influence index,attribute similarity,and node search willingness.On the basis of node search contributions and the PeopleRank idea,this paper proposes an SIS model based on node search contribution values and conducts comparison experiments with several mainstream SIS algorithms in three aspects:the search failure rate,the minimum number of search hops,and the search size.The experimental results verify the advanced nature and operability of the model proposed in this paper,which presents theoretical and practical significance to the quantitative study of the SIS process.
