Skip to main content

06.04.2024 | Regular Paper

Dynamic bipartite network model based on structure and preference features

verfasst von: Hehe Lv, Guobing Zou, Bofeng Zhang, Shengxiang Hu, Chenyang Zhou, Liangrui Wu

Erschienen in: Knowledge and Information Systems

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Based on the complex network, the relationship in the real complex system can be modeled, and the bipartite network is a special complex network, which can describe the complex system containing two kinds of objects. Although existing bipartite networks can model complex systems, conventional methods are restricted to a couple of limitations. (1) The dynamic interaction between nodes cannot be described over time. (2) The implicit features of nodes in the network cannot be effectively mined. Based on these, this paper proposes a dynamic bipartite network model (DBN) to model the dynamic interaction between two types of objects in real complex systems, and mine the structure features and preference features of nodes in the network. First, the dynamic interaction between two types of objects in a complex system is modeled as a dynamic bipartite network, which can reflect the interaction between objects in each time slice. Then, the structure features and preference features of each time slice are mined based on the dynamic bipartite network, where the structure features reflect the dynamic structural changes of the nodes, and the preference features reflect the potential preferences of the nodes. Finally, the features of each time slice are fused and input into the gate recurrent unit model to predict the interaction between nodes. Extensive experiments are performed on a large-scale real complex system. The results show that DBN significantly outperforms state-of-the-art prediction methods in terms of multiple evaluation metrics.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Klishin AA, Bassett DS (2022) Exposure theory for learning complex networks with random walks. J Complex Netw 486:75–174MathSciNet Klishin AA, Bassett DS (2022) Exposure theory for learning complex networks with random walks. J Complex Netw 486:75–174MathSciNet
2.
Zurück zum Zitat Ghosh S, Miyoshi N, Shirai T (2022) Disordered complex networks: energy optimal lattices and persistent homology. IEEE Trans Inf Theory 68:5513–5534MathSciNetCrossRef Ghosh S, Miyoshi N, Shirai T (2022) Disordered complex networks: energy optimal lattices and persistent homology. IEEE Trans Inf Theory 68:5513–5534MathSciNetCrossRef
3.
Zurück zum Zitat Zhao J, Deng Y (2021) Complex network modeling of evidence theory. IEEE Trans Fuzzy Syst 29:3470–3480CrossRef Zhao J, Deng Y (2021) Complex network modeling of evidence theory. IEEE Trans Fuzzy Syst 29:3470–3480CrossRef
4.
Zurück zum Zitat Arthur R (2020) Modularity and projection of bipartite networks. Phys A Stat Mech Appl 549:124341CrossRef Arthur R (2020) Modularity and projection of bipartite networks. Phys A Stat Mech Appl 549:124341CrossRef
5.
Zurück zum Zitat Guillaume J, Latapy M (2006) Bipartite graphs as models of complex networks. Phys A Stat Mech Appl 371(2):795–813CrossRef Guillaume J, Latapy M (2006) Bipartite graphs as models of complex networks. Phys A Stat Mech Appl 371(2):795–813CrossRef
6.
Zurück zum Zitat Li X, Zhang M, Wu S, Liu Z, Wang L, Philip SY (2020) Dynamic graph collaborative filtering. In: 2020 IEEE international conference on data mining (ICDM). IEEE, pp 322–331 Li X, Zhang M, Wu S, Liu Z, Wang L, Philip SY (2020) Dynamic graph collaborative filtering. In: 2020 IEEE international conference on data mining (ICDM). IEEE, pp 322–331
7.
Zurück zum Zitat Jiang S, Koch B, Sun Y (2021) Hints: citation time series prediction for new publications via dynamic heterogeneous information network embedding. In: Proceedings of the web conference 2021, pp 3158–3167 Jiang S, Koch B, Sun Y (2021) Hints: citation time series prediction for new publications via dynamic heterogeneous information network embedding. In: Proceedings of the web conference 2021, pp 3158–3167
8.
Zurück zum Zitat Fu H, Huang F, Liu X, Qiu Y, Zhang W (2022) MVGCN: data integration through multi-view graph convolutional network for predicting links in biomedical bipartite networks. Bioinformatics 38(2):426–434CrossRef Fu H, Huang F, Liu X, Qiu Y, Zhang W (2022) MVGCN: data integration through multi-view graph convolutional network for predicting links in biomedical bipartite networks. Bioinformatics 38(2):426–434CrossRef
9.
Zurück zum Zitat Zhou C, Zhang J, Gao K, Li Q, Hu D, Sheng VS (2022) Bipartite network embedding with symmetric neighborhood convolution. Expert Syst Appl 198:116757CrossRef Zhou C, Zhang J, Gao K, Li Q, Hu D, Sheng VS (2022) Bipartite network embedding with symmetric neighborhood convolution. Expert Syst Appl 198:116757CrossRef
10.
Zurück zum Zitat Gao M, He X, Chen L, Liu T, Zhang J, Zhou A (2020) Learning vertex representations for bipartite networks. IEEE Trans Knowl Data Eng 34:379–393CrossRef Gao M, He X, Chen L, Liu T, Zhang J, Zhou A (2020) Learning vertex representations for bipartite networks. IEEE Trans Knowl Data Eng 34:379–393CrossRef
11.
Zurück zum Zitat Ramalingeswara Rao T, Ghosh SK, Goswami A (2021) Mining user–user communities for a weighted bipartite network using spark GraphFrames and Flink Gelly. J Supercomput 77(6):5984–6035CrossRef Ramalingeswara Rao T, Ghosh SK, Goswami A (2021) Mining user–user communities for a weighted bipartite network using spark GraphFrames and Flink Gelly. J Supercomput 77(6):5984–6035CrossRef
12.
Zurück zum Zitat Xia J, Wu F, Xiong Z, Qiu M, Xie C (2017) Modeling recommender systems via weighted bipartite network. Concurr. Comput. Pract. Exp. 29(14):3895CrossRef Xia J, Wu F, Xiong Z, Qiu M, Xie C (2017) Modeling recommender systems via weighted bipartite network. Concurr. Comput. Pract. Exp. 29(14):3895CrossRef
13.
Zurück zum Zitat Pan L, Shao H, Mesbahi M, Xi Y, Li D (2018) Bipartite consensus on matrix-valued weighted networks. IEEE Trans. Circuits Syst. II Express Briefs 66(8):1441–1445 Pan L, Shao H, Mesbahi M, Xi Y, Li D (2018) Bipartite consensus on matrix-valued weighted networks. IEEE Trans. Circuits Syst. II Express Briefs 66(8):1441–1445
14.
Zurück zum Zitat Noulapeu Ngaffo A, El Ayeb W, Choukair Z (2021) A time-aware service recommendation based on implicit trust relationships and enhanced user similarities. J Ambient Intell Humaniz Comput 12(2):3017–3035CrossRef Noulapeu Ngaffo A, El Ayeb W, Choukair Z (2021) A time-aware service recommendation based on implicit trust relationships and enhanced user similarities. J Ambient Intell Humaniz Comput 12(2):3017–3035CrossRef
15.
Zurück zum Zitat Tong E, Niu W, Liu J (2021) A missing QoS prediction approach via time-aware collaborative filtering. IEEE Trans Serv Comput 15:3115–3128CrossRef Tong E, Niu W, Liu J (2021) A missing QoS prediction approach via time-aware collaborative filtering. IEEE Trans Serv Comput 15:3115–3128CrossRef
16.
Zurück zum Zitat Wu X, Fan Y, Zhang J, Lin H, Zhang J (2019) QF-RNN: QI-matrix factorization based RNN for time-aware service recommendation. In: 2019 IEEE international conference on services computing (SCC). IEEE, pp 202–209 Wu X, Fan Y, Zhang J, Lin H, Zhang J (2019) QF-RNN: QI-matrix factorization based RNN for time-aware service recommendation. In: 2019 IEEE international conference on services computing (SCC). IEEE, pp 202–209
17.
Zurück zum Zitat Zhu J, He P, Xie Q, Zheng Z, Lyu MR (2017) Carp: context-aware reliability prediction of black-box web services. In: 2017 IEEE international conference on web services (ICWS). IEEE, pp 17–24 Zhu J, He P, Xie Q, Zheng Z, Lyu MR (2017) Carp: context-aware reliability prediction of black-box web services. In: 2017 IEEE international conference on web services (ICWS). IEEE, pp 17–24
18.
Zurück zum Zitat Meng S, Zhou Z, Huang T, Li D, Wang S, Fei F, Wang W, Dou W (2016) A temporal-aware hybrid collaborative recommendation method for cloud service. In: 2016 IEEE international conference on web services (ICWS). IEEE, pp 252–259 Meng S, Zhou Z, Huang T, Li D, Wang S, Fei F, Wang W, Dou W (2016) A temporal-aware hybrid collaborative recommendation method for cloud service. In: 2016 IEEE international conference on web services (ICWS). IEEE, pp 252–259
19.
Zurück zum Zitat Luo X, Wu H, Yuan H, Zhou M (2019) Temporal pattern-aware QoS prediction via biased non-negative latent factorization of tensors. IEEE Trans Cybern 50(5):1798–1809CrossRef Luo X, Wu H, Yuan H, Zhou M (2019) Temporal pattern-aware QoS prediction via biased non-negative latent factorization of tensors. IEEE Trans Cybern 50(5):1798–1809CrossRef
20.
Zurück zum Zitat Berahmand K, Li Y, Xu Y (2023) DAC-HPP: deep attributed clustering with high-order proximity preserve. Neural Comput Appl 35(34):24493–24511CrossRef Berahmand K, Li Y, Xu Y (2023) DAC-HPP: deep attributed clustering with high-order proximity preserve. Neural Comput Appl 35(34):24493–24511CrossRef
21.
Zurück zum Zitat Berahmand K, Mohammadi M, Sheikhpour R, Li Y, Xu Y (2024) WSNMF: weighted symmetric nonnegative matrix factorization for attributed graph clustering. Neurocomputing 566:127041CrossRef Berahmand K, Mohammadi M, Sheikhpour R, Li Y, Xu Y (2024) WSNMF: weighted symmetric nonnegative matrix factorization for attributed graph clustering. Neurocomputing 566:127041CrossRef
22.
Zurück zum Zitat Zhang J, Gao M, Yu J, Yang L, Wang Z, Xiong Q (2021) Path-based reasoning over heterogeneous networks for recommendation via bidirectional modeling. Neurocomputing 461:438–449CrossRef Zhang J, Gao M, Yu J, Yang L, Wang Z, Xiong Q (2021) Path-based reasoning over heterogeneous networks for recommendation via bidirectional modeling. Neurocomputing 461:438–449CrossRef
23.
Zurück zum Zitat Yu Z, Huang F, Zhao X, Xiao W, Zhang W (2021) Predicting drug-disease associations through layer attention graph convolutional network. Brief Bioinform 22(4):243CrossRef Yu Z, Huang F, Zhao X, Xiao W, Zhang W (2021) Predicting drug-disease associations through layer attention graph convolutional network. Brief Bioinform 22(4):243CrossRef
24.
Zurück zum Zitat Bai X, Zhang F, Li J, Xu Z, Patoli Z, Lee I (2021) Quantifying scientific collaboration impact by exploiting collaboration-citation network. Scientometrics 126(9):7993–8008CrossRef Bai X, Zhang F, Li J, Xu Z, Patoli Z, Lee I (2021) Quantifying scientific collaboration impact by exploiting collaboration-citation network. Scientometrics 126(9):7993–8008CrossRef
25.
Zurück zum Zitat Wang W, Lv H, Zhao Y (2020) Predicting DNA binding protein-drug interactions based on network similarity. BMC Bioinform 21(1):1–13CrossRef Wang W, Lv H, Zhao Y (2020) Predicting DNA binding protein-drug interactions based on network similarity. BMC Bioinform 21(1):1–13CrossRef
26.
Zurück zum Zitat Wang W, Lv H, Zhao Y, Liu D, Wang Y, Zhang Y (2020) DLS: a link prediction method based on network local structure for predicting drug–protein interactions. Front Bioeng Biotechnol 8:330CrossRef Wang W, Lv H, Zhao Y, Liu D, Wang Y, Zhang Y (2020) DLS: a link prediction method based on network local structure for predicting drug–protein interactions. Front Bioeng Biotechnol 8:330CrossRef
27.
Zurück zum Zitat Lv H, Zhang B, Hu S, Xu Z (2022) Deep link-prediction based on the local structure of bipartite networks. Entropy 24(5):610MathSciNetCrossRef Lv H, Zhang B, Hu S, Xu Z (2022) Deep link-prediction based on the local structure of bipartite networks. Entropy 24(5):610MathSciNetCrossRef
28.
Zurück zum Zitat Xu S, Yang C, Shi C, Fang Y, Guo Y, Yang T, Zhang L, Hu M (2021) Topic-aware heterogeneous graph neural network for link prediction. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 2261–2270 Xu S, Yang C, Shi C, Fang Y, Guo Y, Yang T, Zhang L, Hu M (2021) Topic-aware heterogeneous graph neural network for link prediction. In: Proceedings of the 30th ACM international conference on information and knowledge management, pp 2261–2270
29.
Zurück zum Zitat Zou G, Chen J, He Q, Li K, Zhang B, Gan Y (2020) NDMF: neighborhood-integrated deep matrix factorization for service QoS prediction. IEEE Trans Network Serv Manag 17(4):2717–2730CrossRef Zou G, Chen J, He Q, Li K, Zhang B, Gan Y (2020) NDMF: neighborhood-integrated deep matrix factorization for service QoS prediction. IEEE Trans Network Serv Manag 17(4):2717–2730CrossRef
30.
Zurück zum Zitat Liang T, Chen M, Yin Y, Zhou L, Ying H (2021) Recurrent neural network based collaborative filtering for QoS prediction in IoV. IEEE Trans Intell Transp Syst 23(3):2400–2410CrossRef Liang T, Chen M, Yin Y, Zhou L, Ying H (2021) Recurrent neural network based collaborative filtering for QoS prediction in IoV. IEEE Trans Intell Transp Syst 23(3):2400–2410CrossRef
31.
Zurück zum Zitat Yao K, Liang J, Liang J, Li M, Cao F (2022) Multi-view graph convolutional networks with attention mechanism. Artif Intell 307:103708MathSciNetCrossRef Yao K, Liang J, Liang J, Li M, Cao F (2022) Multi-view graph convolutional networks with attention mechanism. Artif Intell 307:103708MathSciNetCrossRef
32.
Zurück zum Zitat Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: The world wide web conference, pp 2022–2032 Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: The world wide web conference, pp 2022–2032
33.
Zurück zum Zitat Du Y, Wang L, Peng Z, Guo W (2021) Review-based hierarchical attention cooperative neural networks for recommendation. Neurocomputing 447:38–47CrossRef Du Y, Wang L, Peng Z, Guo W (2021) Review-based hierarchical attention cooperative neural networks for recommendation. Neurocomputing 447:38–47CrossRef
34.
Zurück zum Zitat Zheng Z, Zhang Y, Lyu MR (2010) Distributed QoS evaluation for real-world web services. In: 2010 IEEE international conference on web services. IEEE, pp 83–90 Zheng Z, Zhang Y, Lyu MR (2010) Distributed QoS evaluation for real-world web services. In: 2010 IEEE international conference on web services. IEEE, pp 83–90
35.
Zurück zum Zitat Silic M, Delac G, Srbljic S (2014) Prediction of atomic web services reliability for QoS-aware recommendation. IEEE Trans Serv Comput 8(3):425–438CrossRef Silic M, Delac G, Srbljic S (2014) Prediction of atomic web services reliability for QoS-aware recommendation. IEEE Trans Serv Comput 8(3):425–438CrossRef
36.
Zurück zum Zitat Li S, Wen J, Luo F, Ranzi G (2018) Time-aware QoS prediction for cloud service recommendation based on matrix factorization. IEEE Access 6:77716–77724CrossRef Li S, Wen J, Luo F, Ranzi G (2018) Time-aware QoS prediction for cloud service recommendation based on matrix factorization. IEEE Access 6:77716–77724CrossRef
37.
Zurück zum Zitat Xiong R, Wang J, Li Z, Li B, Hung PC (2018) Personalized LSTM based matrix factorization for online QoS prediction. In: 2018 IEEE international conference on web services (ICWS). IEEE, pp 34–41 Xiong R, Wang J, Li Z, Li B, Hung PC (2018) Personalized LSTM based matrix factorization for online QoS prediction. In: 2018 IEEE international conference on web services (ICWS). IEEE, pp 34–41
38.
Zurück zum Zitat Zhang Y, Yin C, Lu Z, Yan D, Qiu M, Tang Q (2019) Recurrent tensor factorization for time-aware service recommendation. Appl Soft Comput 85:105762CrossRef Zhang Y, Yin C, Lu Z, Yan D, Qiu M, Tang Q (2019) Recurrent tensor factorization for time-aware service recommendation. Appl Soft Comput 85:105762CrossRef
39.
Zurück zum Zitat Fayala M, Mezni H (2020) Web service recommendation based on time-aware users clustering and multi-valued QoS prediction. Concurr Comput Pract Exp 32(9):5603CrossRef Fayala M, Mezni H (2020) Web service recommendation based on time-aware users clustering and multi-valued QoS prediction. Concurr Comput Pract Exp 32(9):5603CrossRef
40.
Zurück zum Zitat Zou G, Li T, Jiang M, Hu S, Cao C, Zhang B, Gan Y, Chen Y (2022) Deeptsqp: temporal-aware service QoS prediction via deep neural network and feature integration. Knowl-Based Syst 241:108062CrossRef Zou G, Li T, Jiang M, Hu S, Cao C, Zhang B, Gan Y, Chen Y (2022) Deeptsqp: temporal-aware service QoS prediction via deep neural network and feature integration. Knowl-Based Syst 241:108062CrossRef
Metadaten
Titel
Dynamic bipartite network model based on structure and preference features
verfasst von
Hehe Lv
Guobing Zou
Bofeng Zhang
Shengxiang Hu
Chenyang Zhou
Liangrui Wu
Publikationsdatum
06.04.2024
Verlag
Springer London
Erschienen in
Knowledge and Information Systems
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-024-02093-8

Premium Partner