Editing
Graph Neural Networks
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Remembering</span> == * '''Graph''' β A mathematical structure consisting of nodes (vertices) connected by edges. Edges can be directed or undirected, weighted or unweighted. * '''Node''' β An entity in a graph (a person in a social network, an atom in a molecule, a paper in a citation network). * '''Edge''' β A relationship between two nodes (friendship, chemical bond, citation, road connection). * '''Node features''' β Attribute vectors associated with each node (e.g., user profile features, atom type, paper topic). * '''Edge features''' β Attribute vectors associated with each edge (e.g., bond type, relationship strength, road distance). * '''Adjacency matrix''' β A square matrix A where A[i][j] = 1 if there is an edge from node i to node j. * '''Neighborhood''' β The set of nodes directly connected to a given node by edges. * '''Message passing''' β The core GNN operation: each node sends "messages" (feature vectors) to its neighbors, which aggregate them to update node representations. * '''Node-level task''' β Predicting a property of each node (e.g., classifying users as spammers or not). * '''Edge-level task''' β Predicting properties of or between pairs of nodes (e.g., link prediction: will user A befriend user B?). * '''Graph-level task''' β Predicting a property of the entire graph (e.g., classifying a molecule's toxicity). * '''GCN (Graph Convolutional Network)''' β A foundational GNN that aggregates node features from neighbors with normalized averaging. * '''GraphSAGE''' β A GNN that samples a fixed number of neighbors for scalable inductive learning on large graphs. * '''GAT (Graph Attention Network)''' β A GNN that learns attention weights for neighbor aggregation, giving more weight to important neighbors. * '''Readout/Pooling''' β Aggregating all node representations into a single graph-level representation for graph classification. </div> <div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information