IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v681y2026ics0378437125007484.html

A generalized motif-based Naïve Bayes model for sign prediction in complex networks

Author

Listed:
  • Ran, Yijun
  • Liu, Si-Yuan
  • Huang, Junjie
  • Jia, Tao
  • Xu, Xiao-Ke

Abstract

Signed networks, encoding both positive and negative interactions, are essential for modeling complex systems in social and financial domains. Sign prediction, which infers the sign of a target link, has wide-ranging practical applications. Traditional motif-based Naïve Bayes models assume that all neighboring nodes contribute equally to a target link’s sign, overlooking the heterogeneous influence among neighbors and potentially limiting performance. To address this, we propose a generalizable sign prediction framework that explicitly models the heterogeneity. Specifically, we design two role functions to quantify the differentiated influence of neighboring nodes. We further extend this approach from a single motif to multiple motifs via two strategies. The generalized multiple motifs-based Naïve Bayes model linearly combines information from diverse motifs, while the Feature-driven Generalized Motif-based Naïve Bayes (FGMNB) model integrates high-dimensional motif features using machine learning. Extensive experiments on four real-world signed networks show that FGMNB consistently outperforms five state-of-the-art embedding-based baselines on three of these networks. Moreover, we observe that the most predictive motif structures differ across datasets, highlighting the importance of local structural patterns and offering valuable insights for motif-based feature engineering. Our framework provides an effective and theoretically grounded solution to sign prediction, with practical implications for enhancing trust and security in online platforms.

Suggested Citation

  • Ran, Yijun & Liu, Si-Yuan & Huang, Junjie & Jia, Tao & Xu, Xiao-Ke, 2026. "A generalized motif-based Naïve Bayes model for sign prediction in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 681(C).
  • Handle: RePEc:eee:phsmap:v:681:y:2026:i:c:s0378437125007484
    DOI: 10.1016/j.physa.2025.131096
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437125007484
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2025.131096?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Aming Li & Lei Zhou & Qi Su & Sean P. Cornelius & Yang-Yu Liu & Long Wang & Simon A. Levin, 2020. "Evolution of cooperation on temporal networks," Nature Communications, Nature, vol. 11(1), pages 1-9, December.
    2. Qian-Ming Zhang & Linyuan Lü & Wen-Qiang Wang & Yu-Xiao & Tao Zhou, 2013. "Potential Theory for Directed Networks," PLOS ONE, Public Library of Science, vol. 8(2), pages 1-8, February.
    3. Anna Keuchenius & Petter Törnberg & Justus Uitermark, 2021. "Why it is important to consider negative ties when studying polarized debates: A signed network analysis of a Dutch cultural controversy on Twitter," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-23, August.
    4. Shang, Ke-ke & Small, Michael & Yan, Wei-sheng, 2017. "Link direction for link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 767-776.
    5. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    6. Liang, Jinbi & Pu, Cunlai & Shu, Xiangbo & Xia, Yongxiang & Xia, Chengyi, 2025. "Line graph neural networks for link weight prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 661(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Guangfu & Xie, Bin & Fang, Yili, 2025. "Link prediction in directed networks using Hits centrality and biased random walks," Chaos, Solitons & Fractals, Elsevier, vol. 200(P1).
    2. Shenshen Bai & Longjie Li & Jianjun Cheng & Shijin Xu & Xiaoyun Chen, 2018. "Predicting Missing Links Based on a New Triangle Structure," Complexity, Hindawi, vol. 2018, pages 1-11, December.
    3. Wang, Zuxi & Wu, Yao & Li, Qingguang & Jin, Fengdong & Xiong, Wei, 2016. "Link prediction based on hyperbolic mapping with community structure for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 609-623.
    4. Yin, Likang & Deng, Yong, 2018. "Measuring transferring similarity via local information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 498(C), pages 102-115.
    5. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Xie, Zheng & Zhang, Shengjun & Yi, Dongyun, 2015. "Predicting link directions using local directed path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 260-267.
    6. Ma, Lili & Su, Zhao & Lin, Peng & Wang, Kai & Pang, Xingbo & Li, Lin & Chen, Lin, 2026. "The impact of peer incentives that integrate node similarity on the evolution of cooperation in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 682(C).
    7. Guan-Nan Wang & Hui Gao & Lian Chen & Dennis N A Mensah & Yan Fu, 2015. "Predicting Positive and Negative Relationships in Large Social Networks," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-14, June.
    8. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    9. Wang, Jun & Zhang, Qian-Ming & Zhou, Tao, 2019. "Tag-aware link prediction algorithm in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 105-111.
    10. Orzechowski, Kamil P. & Mrowinski, Maciej J. & Fronczak, Agata & Fronczak, Piotr, 2023. "Asymmetry of social interactions and its role in link predictability: The case of coauthorship networks," Journal of Informetrics, Elsevier, vol. 17(2).
    11. Liu, Yangyang & Zhao, Chengli & Wang, Xiaojie & Huang, Qiangjuan & Zhang, Xue & Yi, Dongyun, 2016. "The degree-related clustering coefficient and its application to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 454(C), pages 24-33.
    12. Kumar, Ajay & Singh, Shashank Sheshar & Singh, Kuldeep & Biswas, Bhaskar, 2020. "Link prediction techniques, applications, and performance: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    13. Yin, Likang & Zheng, Haoyang & Bian, Tian & Deng, Yong, 2017. "An evidential link prediction method and link predictability based on Shannon entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 482(C), pages 699-712.
    14. Fei Tan & Yongxiang Xia & Boyao Zhu, 2014. "Link Prediction in Complex Networks: A Mutual Information Perspective," PLOS ONE, Public Library of Science, vol. 9(9), pages 1-8, September.
    15. Pei, Panpan & Liu, Bo & Jiao, Licheng, 2017. "Link prediction in complex networks based on an information allocation index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 1-11.
    16. Wang, Dan & Zhou, Xiao & Zhao, Pengwei & Pang, Juan & Ren, Qiaoyang, 2025. "Early identification of breakthrough technologies: Insights from science-driven innovations," Journal of Informetrics, Elsevier, vol. 19(1).
    17. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    18. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    19. Zhou, Meng & Yang, Yanlong & Xiang, Shuwen, 2025. "Effect of community learning mechanism on cooperation in conflict societies," Chaos, Solitons & Fractals, Elsevier, vol. 192(C).
    20. Zhang, Gui & Xiong, Xiaojin & Pi, Bin & Feng, Minyu & Perc, Matjaž, 2025. "Spatial public goods games with queueing and reputation," Applied Mathematics and Computation, Elsevier, vol. 505(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:681:y:2026:i:c:s0378437125007484. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.