1 code implementation • 20 Feb 2023 • Liang Yao, Jiazhen Peng, Shenggong Ji, Qiang Liu, Hongyun Cai, Feng He, Xu Cheng
Friend recall is an important way to improve Daily Active Users (DAU) in online games.
4 code implementations • 8 Dec 2021 • Chenhui Zhang, Yufei He, Yukuo Cen, Zhenyu Hou, Wenzheng Feng, Yuxiao Dong, Xu Cheng, Hongyun Cai, Feng He, Jie Tang
However, it is unclear how to best design the generalization strategies in GNNs, as it works in a semi-supervised setting for graph data.
Ranked #3 on Node Property Prediction on ogbn-papers100M
no code implementations • 9 Oct 2019 • Wenqiang Liu, Hongyun Cai, Xu Cheng, Sifa Xie, Yipeng Yu, Hanyu Zhang
The goal of representation learning of knowledge graph is to encode both entities and relations into a low-dimensional embedding spaces.
no code implementations • 28 Aug 2019 • Wenqing Lin, Feng He, Faqiang Zhang, Xu Cheng, Hongyun Cai
Network embedding has been intensively studied in the literature and widely used in various applications, such as link prediction and node classification.
no code implementations • 22 Sep 2017 • Hongyun Cai, Vincent W. Zheng, Kevin Chen-Chuan Chang
Graph is an important data representation which appears in a wide diversity of real-world scenarios.
1 code implementation • 15 May 2017 • Hongyun Cai, Vincent W. Zheng, Kevin Chen-Chuan Chang
Graph embedding provides an efficient solution for graph analysis by converting the graph into a low-dimensional space which preserves the structure information.
no code implementations • 17 Jan 2017 • Hongyun Cai, Vincent W. Zheng, Fanwei Zhu, Kevin Chen-Chuan Chang, Zi Huang
Most existing community-related studies focus on detection, which aim to find the community membership for each user from user friendship links.
2 code implementations • 31 Oct 2016 • Vincent W. Zheng, Sandro Cavallari, Hongyun Cai, Kevin Chen-Chuan Chang, Erik Cambria
Most of the existing graph embedding methods focus on nodes, which aim to output a vector representation for each node in the graph such that two nodes being "close" on the graph are close too in the low-dimensional space.