Dual-preference graph learning for next point-of-interest recommendation
The Journal of Supercomputing · 02.04.2026 · 82 (5)
DOI: 10.1007/s11227-026-08462-0 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Supercomputing, online erschienen am 02.04.2026. Verfasst von Sai Zhao und 3 weiteren Autor:innen. Die Arbeit nennt 45 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Postdoctoral Fellowship Program of China Postdoctoral Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Postdoctoral Fellowship Program of China Postdoctoral Science Foundation
Zitieren
APA
Zhao, S., Jia, J., Chen, C., & He, S. (2026). Dual-preference graph learning for next point-of-interest recommendation. The Journal of Supercomputing, 82(5). https://doi.org/10.1007/s11227-026-08462-0
Vancouver
Zhao S, Jia J, Chen C, He S. Dual-preference graph learning for next point-of-interest recommendation. The Journal of Supercomputing. 2026;82(5). doi:10.1007/s11227-026-08462-0
BibTeX
@article{Zhao2026,
author = {Zhao, Sai and Jia, Jia and Chen, Caisen and He, Shuai},
title = {Dual-preference graph learning for next point-of-interest recommendation},
journal = {The Journal of Supercomputing},
year = {2026},
volume = {82},
number = {5},
doi = {10.1007/s11227-026-08462-0}
}
EUVIMED