Explore contrastive learning on graph representation learning

Graph is a type of structured data to describe the multiple objects as well as their relationships, and is attracting increasing attention in recent years as it can represent various types of data structures in the real life, such as the social networks, etc. Hence, it is important to research graph...

Full description

Saved in:
Bibliographic Details
Main Author: Liu, Qiuyu
Other Authors: Lihui Chen
Format: Final Year Project
Language:English
Published: Nanyang Technological University 2022
Subjects:
Online Access:https://hdl.handle.net/10356/158301
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-158301
record_format dspace
spelling sg-ntu-dr.10356-1583012023-07-07T18:56:49Z Explore contrastive learning on graph representation learning Liu, Qiuyu Lihui Chen School of Electrical and Electronic Engineering ELHCHEN@ntu.edu.sg Engineering::Electrical and electronic engineering Graph is a type of structured data to describe the multiple objects as well as their relationships, and is attracting increasing attention in recent years as it can represent various types of data structures in the real life, such as the social networks, etc. Hence, it is important to research graph analysis and explore effective methods of graph processing. Graph representation learning methods has been shown to be promising on graph analysis by converting the graphs or part of the graphs into a lower-dimensional representations while preserving all critical information. However, graph representation learning still faces various challenges due to the diversity of graph types, objects, and their corresponding applications. For the node-level graph representation learning, traditional methods focus more on homogeneous graphs and have achieved impressive performance. However, for the heterogeneous information networks (HINs) which have various types of nodes and edges, the methods designed for homogeneous graphs are no longer optimal to handle the semantic incompatibility issues. A novel co-contrastive learning mechanism called HeCo [1] was proposed to address such issue by constructing a cross-view mechanism to effectively capture both local and high-level information. Though HeCo achieved remarkable performance on HIN data, inspiring by various contrastive learning studies [2-6], more contrastive learning methods can be further explored based on [1]. This thesis explores the potential of contrastive methods on HIN data and introduces two research works to improve the current graph representation learning methods of HINs. 1. Methodology 1 as a simple contrastive augmentation method. 2. Decoupled contrastive loss function with Methodology 1. The Methodology 1 reported in this thesis is under preparation for publication, this part of work will not be presented. Bachelor of Engineering (Electrical and Electronic Engineering) 2022-05-31T07:08:28Z 2022-05-31T07:08:28Z 2022 Final Year Project (FYP) Liu, Q. (2022). Explore contrastive learning on graph representation learning. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/158301 https://hdl.handle.net/10356/158301 en A3045-211 application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
spellingShingle Engineering::Electrical and electronic engineering
Liu, Qiuyu
Explore contrastive learning on graph representation learning
description Graph is a type of structured data to describe the multiple objects as well as their relationships, and is attracting increasing attention in recent years as it can represent various types of data structures in the real life, such as the social networks, etc. Hence, it is important to research graph analysis and explore effective methods of graph processing. Graph representation learning methods has been shown to be promising on graph analysis by converting the graphs or part of the graphs into a lower-dimensional representations while preserving all critical information. However, graph representation learning still faces various challenges due to the diversity of graph types, objects, and their corresponding applications. For the node-level graph representation learning, traditional methods focus more on homogeneous graphs and have achieved impressive performance. However, for the heterogeneous information networks (HINs) which have various types of nodes and edges, the methods designed for homogeneous graphs are no longer optimal to handle the semantic incompatibility issues. A novel co-contrastive learning mechanism called HeCo [1] was proposed to address such issue by constructing a cross-view mechanism to effectively capture both local and high-level information. Though HeCo achieved remarkable performance on HIN data, inspiring by various contrastive learning studies [2-6], more contrastive learning methods can be further explored based on [1]. This thesis explores the potential of contrastive methods on HIN data and introduces two research works to improve the current graph representation learning methods of HINs. 1. Methodology 1 as a simple contrastive augmentation method. 2. Decoupled contrastive loss function with Methodology 1. The Methodology 1 reported in this thesis is under preparation for publication, this part of work will not be presented.
author2 Lihui Chen
author_facet Lihui Chen
Liu, Qiuyu
format Final Year Project
author Liu, Qiuyu
author_sort Liu, Qiuyu
title Explore contrastive learning on graph representation learning
title_short Explore contrastive learning on graph representation learning
title_full Explore contrastive learning on graph representation learning
title_fullStr Explore contrastive learning on graph representation learning
title_full_unstemmed Explore contrastive learning on graph representation learning
title_sort explore contrastive learning on graph representation learning
publisher Nanyang Technological University
publishDate 2022
url https://hdl.handle.net/10356/158301
_version_ 1772826723578019840