Papers › Representation Learning for Attributed Multiplex Heterogeneous Network

Representation Learning for Attributed Multiplex Heterogeneous Network

5 May 2019arXiv:1905.01669archive 2025-07-28

Yukuo Cen, Xu Zou, Jianwei Zhang, Hongxia Yang, Jingren Zhou, Jie Tang

Network embedding (or graph embedding) has been widely used in many real-world applications. However, existing methods mainly focus on networks with single-typed nodes/edges and cannot scale well to handle large networks. Many real-world networks consist of billions of nodes and edges of multiple types, and each node is associated with different attributes. In this paper, we formalize the problem of embedding learning for the Attributed Multiplex Heterogeneous Network and propose a unified framework to address this problem. The framework supports both transductive and inductive learning. We also give the theoretical analysis of the proposed framework, showing its connection with previous works and proving its better expressiveness. We conduct systematical evaluations for the proposed framework on four different genres of challenging datasets: Amazon, YouTube, Twitter, and Alibaba. Experimental results demonstrate that with the learned embeddings from the proposed framework, we can achieve statistically significant improvements (e.g., 5.99-28.23% lift by F1 scores; p<<0.01, t-test) over previous state-of-the-art methods for link prediction. The framework has also been successfully deployed on the recommendation system of a worldwide leading e-commerce company, Alibaba Group. Results of the offline A/B tests on product recommendation further confirm the effectiveness and efficiency of the framework in practice.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1905.01669")

Code

Syntology Ran 0 of 6 code samples harvested from 3 repositories linked to this paper; 6 have no recorded run.

By repository: official repository: 4 samples from 1 repository, 0 ran; community (archive-listed): 2 samples from 2 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

cenyk1230/GATNE officialmentioned in papermentioned on GitHubtfMIT report
SY1706203/GATNE mentioned on GitHubpytorch report
THUDM/GATNE mentioned on GitHubtf report
dmlc/dgl pytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 0 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

6unverified

Licence: 1 of the 6 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_G_from_edges cenyk1230/GATNE/src/utils.py official repository unverified MIT (permissive) · cf9c3805b1542774 · report
load_testing_data cenyk1230/GATNE/src/utils.py official repository unverified MIT (permissive) · 8132342be6565a76 · report
load_training_data cenyk1230/GATNE/src/utils.py official repository unverified MIT (permissive) · 243e02e3fb987dee · report
walk cenyk1230/GATNE/src/walk.py official repository unverified MIT (permissive) · 6bdf32ab6470c66f · report
train_model THUDM/GATNE/src/main_pytorch.py community (archive-listed) unverified MIT (permissive) · fcee37b72ee37cc6 · report
train_model SY1706203/GATNE/src/main_pytorch.py community (archive-listed) unverified no licence file found · pointer only · 58325f9b34cc76b9 · report

Tasks

Graph EmbeddingInductive LearningLink PredictionNetwork EmbeddingProduct RecommendationRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction Alibaba GATNE-I F1-Score 89.94 #1 of 1 Archive leaderboard report
Link Prediction Alibaba GATNE-I PR AUC 95.04 #1 of 1 Archive leaderboard report
Link Prediction Alibaba GATNE-I ROC AUC 84.2 #1 of 1 Archive leaderboard report
Link Prediction Alibaba-S GATNE-T F1-Score 62.48 #1 of 1 Archive leaderboard report
Link Prediction Alibaba-S GATNE-T PR AUC 67.55 #1 of 1 Archive leaderboard report
Link Prediction Alibaba-S GATNE-T ROC AUC 66.71 #1 of 1 Archive leaderboard report
Link Prediction Amazon GATNE-T F1-Score 92.87 #1 of 1 Archive leaderboard report
Link Prediction Amazon GATNE-T PR AUC 97.05 #1 of 1 Archive leaderboard report
Link Prediction Amazon GATNE-T ROC AUC 97.44 #1 of 1 Archive leaderboard report
Link Prediction Twitter GATNE-T F1-Score 84.96 #1 of 1 Archive leaderboard report
Link Prediction Twitter GATNE-T PR AUC 91.77 #1 of 1 Archive leaderboard report
Link Prediction Twitter GATNE-T ROC AUC 92.3 #1 of 1 Archive leaderboard report
Link Prediction YouTube GATNE-T F1-Score 76.83 #1 of 2 Archive leaderboard report
Link Prediction YouTube GATNE-T PR AUC 81.93 #1 of 2 Archive leaderboard report
Link Prediction YouTube GATNE-T ROC AUC 84.61 #1 of 2 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections