Subgraph extraction algorithm for large scale heterogeneous graph
Large-scale heterogeneous graphs, containing different types of nodes and edges, bring new challenges to the efficiency and scalability of graph representation learning and Graph Neural Network-based algorithms. For some graph learning tasks, such as inductive graph reasoning, pre-training on who...
Main Author: | Wu, Eric JiaQing |
---|---|
Other Authors: | Luo Siqiang |
Format: | Final Year Project (FYP) |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/175480 |
Similar Items
-
Cohesive subgraph mining in large graphs
by: Yu, Kaiqiang
Published: (2023) -
Blending visual subgraph similarity query formulation and query processing on large graphs
by: Ho, Hoang Hung.
Published: (2011) -
Cohesive subgraphs discovery in networks
by: Kim, Junghoon
Published: (2022) -
On the First-Order Complexity of Induced Subgraph Isomorphism
by: Oleg Verbitsky, et al.
Published: (2019-03-01) -
Efficient algorithms for generalized subgraph query processing
by: Bhowmick, Sourav S., et al.
Published: (2013)