| Author: | Zhang, Xin |
| Title: | Collaborative graph neural networks for unsupervised representation learning |
| Advisors: | Huang, Xiao (COMP) |
| Degree: | M.Sc. |
| Year: | 2021 |
| Subject: | Neural networks (Computer science) Machine learning Hong Kong Polytechnic University -- Dissertations |
| Department: | Department of Computing |
| Pages: | vii, 42 pages : color illustrations |
| Language: | English |
| Abstract: | Graph neural networks (GNNs) have been intensively applied to analyze real-world networks, especially attributed networks. Existing studies of GNNs mainly focus on exploiting network structures, while the exploitation of node attributes is rather limited as they only serve as node representations at the initial layer. Other than that, the training objectives of most GNNs also do not include node attributes. They perform training mainly based on network structures in an unsupervised manner or the given node labels. However, node attributes are a major information source and need to be better exploited, as they are highly correlated with and complementary to the network. Thus, it is encouraging to deeply involve node attributes in the key components of GNNs, including the graph convolution operations and training objectives. However, this is a nontrivial task since an appropriate way of integrating is required to maintain the merits of GNNs. Additionally, node attributes such as user posts are distinct from topological structures and not in line with graph convolutions. To bridge the gap, in this paper, we focus on unsupervised learning and propose COllaborative graph Neural Networks (CONN). It refines GNNs from two aspects. First, a collaborative aggregation mechanism is designed. It updates the representation of each node by aggregating the representations of not only its neighbors, but also its attribute categories. Second, a collaborative training objective is developed. It assesses both node-to-node and node-to-attribute-category interactions based on cross correlations. Experiments on real-world networks show that CONN consistently outperforms state-of-the-art embedding algorithms. It even outperforms an end-to-end baseline on social networks. |
| Rights: | All rights reserved |
| Access: | restricted access |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 5868.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 1.29 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/11382