PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: bachelor of science

Inductive Representation Learning on Large Graphs - …

Inductive Representation Learning on Large GraphsWilliam L. Hamilton Ying of Computer ScienceStanford UniversityStanford, CA, 94305 AbstractLow-dimensional embeddings of nodes in Large Graphs have proved extremelyuseful in a variety of prediction tasks, from content recommendation to identifyingprotein functions. However, most existing approaches require that all nodes in thegraph are present during training of the embeddings; these previous approaches areinherentlytransductiveand do not naturally generalize to unseen nodes. Here wepresent GraphSAGE, a generalinductiveframework that leverages node featureinformation ( , text attributes) to efficiently generate node embeddings forpreviously unseen data.

to orthogonal transformations of the embeddings, which means that the embedding space does not naturally generalize between graphs and can drift during re-training. One notable exception to this trend is the Planetoid-I algorithm introduced by Yang et al. [40], which is an inductive, embedding-based approach to semi-supervised learning.

Loading..

Tags:

  Large, Transformation, Learning, Representation, Inductive, Graph, Inductive representation learning on large graphs

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of Inductive Representation Learning on Large Graphs - …

Related search queries