Transcription of Representation Learning on Graphs: Methods and Applications
{{id}} {{{paragraph}}}
Representation Learning on Graphs: Methods and ApplicationsWilliam L. of Computer ScienceStanford UniversityStanford, CA, 94305 AbstractMachine Learning on graphs is an important and ubiquitous task with Applications ranging from drugdesign to friendship recommendation in social networks. The primary challenge in this domain is findinga way to represent, or encode, graph structure so that it can be easily exploited by machine learningmodels. Traditionally, machine Learning approaches relied on user-defined heuristics to extract featuresencoding structural information about a graph ( , degree statistics or kernel functions). However,recent years have seen a surge in approaches that automatically learn to encode graph structure intolow-dimensional embeddings, using techniques based on deep Learning and nonlinear dimensionalityreduction.
methods for statistical relational learning [42], manifold learning algorithms [37], and geometric deep learning [7]—all of which involve representation learning with graph-structured data. We refer the reader to [32], [42], [37], and [7] for comprehensive overviews of these areas. 1.1 Notation and essential assumptions
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}