How to Realize Efficient and Scalable Graph Embeddings via an Entropy-Driven Mechanism
IEEE Transactions on Big Data · 01.02.2023 · 9 (1) · 358-371
DOI: 10.1109/tbdata.2022.3164575 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Big Data, erschienen am 01.02.2023. Verfasst von Peng Fang und 6 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 74 Literaturangaben. Gefördert von: National Natural Science Foundation of China, China Scholarship Council.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- China Scholarship Council
Zitieren
APA
Fang, P., Wang, F., Shi, Z., Jiang, H., Feng, D., Xu, X., & Yin, W. (2023). How to Realize Efficient and Scalable Graph Embeddings via an Entropy-Driven Mechanism. IEEE Transactions on Big Data, 9(1), 358-371. https://doi.org/10.1109/tbdata.2022.3164575
Vancouver
Fang P, Wang F, Shi Z, Jiang H, Feng D, Xu X, et al. How to Realize Efficient and Scalable Graph Embeddings via an Entropy-Driven Mechanism. IEEE Transactions on Big Data. 2023;9(1):358-371. doi:10.1109/tbdata.2022.3164575
BibTeX
@article{Fang2023,
author = {Fang, Peng and Wang, Fang and Shi, Zhan and Jiang, Hong and Feng, Dan and Xu, Xianghao and Yin, Wei},
title = {How to Realize Efficient and Scalable Graph Embeddings via an Entropy-Driven Mechanism},
journal = {IEEE Transactions on Big Data},
year = {2023},
volume = {9},
number = {1},
pages = {358--371},
doi = {10.1109/tbdata.2022.3164575}
}
EUVIMED