EUVIMEDEUVIMED entdecken
Crossref

Graph regularized autoencoding-inspired non-negative matrix factorization for link prediction in complex networks using clustering information and biased random walk

Tongfeng Li, Ruisheng zhang, Yabing Yao, Yunwu Liu, Jun Ma, Jianxin Tang

The Journal of Supercomputing · 2024-07 · 80 (10) · 14433-14469

DOI: 10.1007/s11227-024-06013-z ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Journal of Supercomputing, online erschienen am 20.03.2024. Verfasst von Tongfeng Li und 5 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 68 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Li, T., zhang, R., Yao, Y., Liu, Y., Ma, J., & Tang, J. (2024). Graph regularized autoencoding-inspired non-negative matrix factorization for link prediction in complex networks using clustering information and biased random walk. The Journal of Supercomputing, 80(10), 14433-14469. https://doi.org/10.1007/s11227-024-06013-z

Vancouver

Li T, zhang R, Yao Y, Liu Y, Ma J, Tang J. Graph regularized autoencoding-inspired non-negative matrix factorization for link prediction in complex networks using clustering information and biased random walk. The Journal of Supercomputing. 2024;80(10):14433-14469. doi:10.1007/s11227-024-06013-z

BibTeX
@article{Li2024,
  author = {Li, Tongfeng and zhang, Ruisheng and Yao, Yabing and Liu, Yunwu and Ma, Jun and Tang, Jianxin},
  title = {Graph regularized autoencoding-inspired non-negative matrix factorization for link prediction in complex networks using clustering information and biased random walk},
  journal = {The Journal of Supercomputing},
  year = {2024},
  volume = {80},
  number = {10},
  pages = {14433--14469},
  doi = {10.1007/s11227-024-06013-z}
}
Kostenlos starten →