Measuring Node Similarity for the Collective Attention Flow Network

Quantifying the similarity of nodes in collective attention flow network has an important theoretical and practical value. In this paper, we defined the generation time Rt, the influence radius Sr and the representation Vs (Rt, Sr) of the nodes in the collective attention flow network based on the optimization of Spatial Preferred Attachment (SPA) model. NID algorithm, based on the influence distance Sd that was calculated by the spatial norm, to measure the similarity of the nodes in the collective attention flow network was proposed. Experiments show that our algorithm not only accurately quantify the similarity of nodes in the collective attention flow network, but has a higher universality.

[1]  Danilo Montesi,et al.  Investigating Similarity of Nodes' Attributes in Topological Based Communities. , 2018, WWW.

[2]  Fang Wu,et al.  Novelty and collective attention , 2007, Proceedings of the National Academy of Sciences.

[3]  Albert-László Barabási,et al.  Network science: Luck or reason , 2012, Nature.

[4]  Jiang Zhang,et al.  A Geometric Representation of Collective Attention Flows , 2015, PloS one.

[5]  Rory Wilson,et al.  Estimating node similarity from co-citation in a spatial graph model , 2010, SAC '10.

[6]  Roberto Grossi,et al.  Node Similarity with q -Grams for Real-World Labeled Networks , 2018, KDD.

[7]  Jiang Zhang,et al.  The decentralized flow structure of clickstreams on the web , 2013 .

[8]  Yong Li,et al.  Quantifying the Influence of Websites Based on Online Collective Attention Flow , 2015, Journal of Computer Science and Technology.

[9]  Qiang Zhang,et al.  Common patterns of online collective attention flow , 2016, Science China Information Sciences.

[10]  Qi Zhang,et al.  Measure the structure similarity of nodes in complex networks based on relative entropy , 2018 .

[11]  Jiang Zhang,et al.  The Atlas of Chinese World Wide Web Ecosystem Shaped by the Collective Attention Flows , 2016, PloS one.

[12]  Ibrahim Kamel,et al.  Social Community Detection Based on Node Distance and Interest , 2016, 2016 IEEE/ACM 3rd International Conference on Big Data Computing Applications and Technologies (BDCAT).

[13]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[14]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[15]  Hayder Radha,et al.  Network completion with node similarity: A matrix completion approach with provable guarantees , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[16]  Sune Lehmann,et al.  Measure of Node Similarity in Multilayer Networks , 2016, PloS one.

[17]  Anthony Bonato,et al.  A Spatial Web Graph Model with Local Influence Regions , 2007, Internet Math..

[18]  Hayder Radha,et al.  Network completion by leveraging similarity of nodes , 2016, Social Network Analysis and Mining.