Journal Home > Volume 28 , Issue 4

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.


menu
Abstract
Full text
Outline
About this article

Node Search Contributions Based Long-Term Follow-Up Specific Individual Searching Model

Show Author's information Yayong Shi1,Fei Chang1,Yetao Sun1Guangcheng Yang1Rui Wang1( )Yuan Yao2( )
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100183, China
Institute for Hospital Management Research, Chinese PLA General Hospital, Beijing 100853, China

Yayong Shi and Fei Chang contributed equally to this work.

Abstract

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.

Keywords: complex networks, specific individual search, propagation dynamics, long-term follow-up

References(37)

[1]
P. Yang, G. Yang, J. Liu, J. Qi, Y. Yang, X. Wang, and T. Wang, DUAPM: An effective dynamic micro-blogging user activity prediction model towards cyber-physical-social systems, IEEE Trans. Ind. Inf., vol. 16, no. 8, pp. 5317–5326, 2020.
[2]
M. Al-Qurishi, M. S. Hossain, M. Alrubaian, S. M. M. Rahman, and A. Alamri, Leveraging analysis of user behavior to identify malicious activities in large-scale social networks, IEEE Trans. Ind. Inf., vol. 14, no. 2, pp. 799–813, 2018.
[3]
B. Wang, D. Shan, A. Fan, L. Liu, and J. Gao, A sentiment classification method of web social media based on multidimensional and multilevel modeling, IEEE Trans. Ind. Inf., vol. 18, no. 2, pp. 1240–1249, 2022.
[4]
Z. Guo and H. Wang, A deep graph neural network-based mechanism for social recommendations, IEEE Trans. Ind. Inf., vol. 17, no. 4, pp. 2776–2783, 2021.
[5]
F. Nian and H. Diao, A human flesh search model based on multiple effects, IEEE Trans. Netw. Sci. Eng., vol. 7, no. 3, pp. 1394–1405, 2020.
[6]
P. H. Cheong and J. Gong, Cyber vigilantism, transmedia collective intelligence, and civic participation, Chin. J. Commun., vol. 3, no. 4, pp. 471–487, 2010.
[7]
K. Zaamout and K. Barker, Structure of crowdsourcing community networks, IEEE Trans. Computat. Soc. Syst., vol. 5, no. 1, pp. 144–155, 2018.
[8]
H. Zhu and B. Hu, Agent based simulation on the process of human flesh search—from perspective of knowledge and emotion, Phys. A Stat. Mech. Appl., vol. 469, pp. 71–80, 2017.
[9]
G. Li, Y. Liu, B. Ribeiro, and H. Ding, On new group popularity prediction in event-based social networks, IEEE Trans. Netw. Sci. Eng., vol. 7, no. 3, pp. 1239–1250, 2020.
[10]
Y. Zhang and H. Gao, Human flesh search engine and online privacy, Sci. Eng. Ethics, vol. 22, no. 2, pp. 601–604, 2016.
[11]
M. Al-Qurishi, M. S. Hossain, M. Alrubaian, S. M. M. Rahman, and A. Alamri, Leveraging analysis of user behavior to identify malicious activities in large-scale social networks, IEEE Trans. Ind. Inf., vol. 14, no. 2, pp. 799–813, 2018.
[12]
W. Craig, M. Boniel-Nissim, N. King, S. D. Walsh, M. Boer, P. D. Donnelly, Y. Harel-Fisch, M. Malinowska-Cieslik, M. G. de Matos, A. Cosma, et al., Social media use and cyber-bullying: A cross-national analysis of young people in 42 countries, J. Adolesc. Health, vol. 66, no. 6S, pp. S100–S108, 2020.
[13]
K. S. Choi and J. R. Lee, Theoretical analysis of cyber-interpersonal violence victimization and offending using cyber-routine activities theory, Comput. Human Behav., vol. 73, pp. 394–402, 2017.
[14]
J. Peterson and J. Densley, Cyber violence: What do we know and where do we go from here? Aggress. Violent Behav., vol. 34, pp. 193–200, 2017.
[15]
S. Gao, H. Pang, P. Gallinari, J. Guo, and N. Kato, A novel embedding method for information diffusion prediction in social network big data, IEEE Trans. Ind. Inf., vol. 13, no. 4, pp. 2097–2105, 2017.
[16]
L. Gao, The emergence of the human flesh search engine and political protest in china: Exploring the internet and online collective action, Media Cult. Soc., vol. 38, no. 3, pp. 349–364, 2016.
[17]
L. Y. C. Chang and J. Zhu, Taking justice into their own hands: Predictors of netilantism among cyber citizens in Hong Kong, Front. Psychol., vol. 11, p. 556903, 2020.
[18]
N. Kolli and B. Narayanaswamy, Influence maximization from cascade information traces in complex networks in the absence of network structure, IEEE Trans. Comput. Soc. Syst., vol. 6, no. 6, pp. 1147–1155, 2019.
[19]
A. Castiglione, G. Cozzolino, F. Moscato, and V. Moscato, Cognitive analysis in social networks for viral marketing, IEEE Trans. Ind. Inf., vol. 17, no. 9, pp. 6162–6169, 2021.
[20]
J. Gamble, H. Chintakunta, A. Wilkerson, and H. Krim, Node dominance: Revealing community and core-periphery structure in social networks, IEEE Trans. Signal Inf. Process. Netw., vol. 2, no. 2, pp. 186–199, 2016.
[21]
N. Foroutan and A. Hamzeh, Discovering the hidden structure of a social network: A semi supervised approach, IEEE Trans. Comput. Soc. Syst., vol. 4, no. 1, pp. 14–25, 2017.
[22]
S. S. Zhang, X. Liang, Y. D. Wei, and X. Zhang, On structural features, user social behavior, and kinship discrimination in communication social networks, IEEE Trans. Comput. Soc. Syst., vol. 7, no. 2, pp. 425–436, 2020.
[23]
G. Ghoshal and A. L. Barabási, Ranking stability and super-stable nodes in complex networks, Nat. Commun., vol. 2, no. 1, p. 394, 2011.
[24]
D. Guilbeault and D. Centola, Topological measures for identifying and predicting the spread of complex contagions, Nat. Commun., vol. 12, no. 1, p. 4430, 2021.
[25]
P. Basaras, G. Iosifidis, D. Katsaros, and L. Tassiulas, Identifying influential spreaders in complex multilayer networks: A centrality perspective, IEEE Trans. Netw. Sci. Eng., vol. 6, no. 1, pp. 31–45, 2019.
[26]
A. Godoy-Lorite and N. S. Jones, Inference and influence of network structure using snapshot social behavior without network data, Sci. Adv., vol. 7, no. 23, p. eabb8762, 2021.
[27]
F. Nian, Y. Shi, and J. Cao, Modeling information propagation in high-order networks based on explicit–implicit relationship, J. Comput. Sci., vol. 55, p. 101438, 2021.
[28]
C. S. Heng, Z. Lin, X. Xu, Y. Zhang, and Y. Zhao, Human flesh search: What did we find? Inf. Manag., vol. 56, no. 4, pp. 476–492, 2019.
[29]
L. Hu and K. C. C. Chan, Fuzzy clustering in a complex network based on content relevance and link structures, IEEE Trans. Fuzzy Syst., vol. 24, no. 2, pp. 456–470, 2016.
[30]
Q. Wen, C. Zhan, Y. Gao, X. Hu, E. Ngai, and B. Hu, Modeling human activity with seasonality bursty dynamics, IEEE Trans. Ind. Inf., vol. 16, no. 2, pp. 1130–1139, 2020.
[31]
L. Zhu, D. Guo, J. Yin, G. V. Steeg, and A. Galstyan, Scalable temporal latent space inference for link prediction in dynamic social networks, IEEE Trans. Knowl. Data Eng., vol. 28, no. 10, pp. 2765–2777, 2016.
[32]
V. Raghavan, G. Ver Steeg, A. Galstyan, and A. G. Tartakovsky, Modeling temporal activity patterns in dynamic social networks, IEEE Trans. Comput. Soc. Syst., vol. 1, no. 1, pp. 89–107, 2014.
[33]
A. Shrestha and F. Spezzano, Online misinformation: From the deceiver to the victim, in Proc. 2019 IEEE/ACM Int. Conf. on Advances in Social Networks Analysis and Mining (ASONAM), Vancouver, Canada, 2019, pp. 847–850.
[34]
F. Tudisco and D. J. Higham, Node and edge nonlinear eigenvector centrality for hypergraphs, Commun. Phys., vol. 4, p. 201, 2021.
[35]
A. Kumar, D. Chhabra, B. Mendiratta, and A. Sinha, Analyzing information diffusion in ego-centric twitter social network, in Proc. 2020 6th Int. Conf. on Signal Processing and Communication (ICSC), Noida, India, 2020, pp. 363–368.
[36]
H. Zhang, B. Liu, H. Susanto, G. Xue, and T. Sun, Incentive mechanism for proximity-based mobile crowd service systems, in Proc. 35th Annu. IEEE Int. Conf. on Computer Communications, San Francisco, CA, USA, 2016, pp. 1–9.
[37]
A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol. 286, no. 5439, pp. 509–512, 1999.
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 22 January 2022
Accepted: 16 June 2022
Published: 06 January 2023
Issue date: August 2023

Copyright

© The author(s) 2023.

Acknowledgements

This work was supported by the National Key Research and Development Program of China (No. 2016YFC0901303), and the National Natural Science Foundation of China (Nos. 72004147 and 62173158).

Rights and permissions

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return