A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources

• URL: http://arxiv.org/abs/2011.14867v1
• Date: Mon, 30 Nov 2020 15:03:47 GMT
• Title: A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources
• Authors: Xiao Wang and Deyu Bo and Chuan Shi and Shaohua Fan and Yanfang Ye and Philip S. Yu
• Abstract summary: Heterogeneous graphs (HGs) also known as heterogeneous information networks have become ubiquitous in real-world scenarios. HG embedding aims to learn representations in a lower-dimension space while preserving the heterogeneous structures and semantics for downstream tasks.
• Score: 79.48829365560788
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Heterogeneous graphs (HGs) also known as heterogeneous information networks have become ubiquitous in real-world scenarios; therefore, HG embedding, which aims to learn representations in a lower-dimension space while preserving the heterogeneous structures and semantics for downstream tasks (e.g., node/graph classification, node clustering, link prediction), has drawn considerable attentions in recent years. In this survey, we perform a comprehensive review of the recent development on HG embedding methods and techniques. We first introduce the basic concepts of HG and discuss the unique challenges brought by the heterogeneity for HG embedding in comparison with homogeneous graph representation learning; and then we systemically survey and categorize the state-of-the-art HG embedding methods based on the information they used in the learning process to address the challenges posed by the HG heterogeneity. In particular, for each representative HG embedding method, we provide detailed introduction and further analyze its pros and cons; meanwhile, we also explore the transformativeness and applicability of different types of HG embedding methods in the real-world industrial environments for the first time. In addition, we further present several widely deployed systems that have demonstrated the success of HG embedding techniques in resolving real-world application problems with broader impacts. To facilitate future research and applications in this area, we also summarize the open-source code, existing graph learning platforms and benchmark datasets. Finally, we explore the additional issues and challenges of HG embedding and forecast the future research directions in this field.

Related papers

• Deep Graph Anomaly Detection: A Survey and New Perspectives [86.84201183954016]
  Graph anomaly detection (GAD) aims to identify unusual graph instances (nodes, edges, subgraphs, or graphs) Deep learning approaches, graph neural networks (GNNs) in particular, have been emerging as a promising paradigm for GAD.
  arXiv  Detail & Related papers  (2024-09-16T03:05:11Z)
• Few-shot Learning on Heterogeneous Graphs: Challenges, Progress, and Prospects [7.682496639660342]
  Few-shot learning on heterogeneous graphs (FLHG) is attracting more attention from both academia and industry. FLHG aims to tackle the performance degradation in the face of limited annotated data. This paper provides a comprehensive review of existing FLHG methods, covering challenges, research progress, and future prospects.
  arXiv  Detail & Related papers  (2024-03-10T00:43:36Z)
• A Survey on Graph Condensation [14.94630644865636]
  Graph condensation (GC) has emerged as a solution to address challenges arising from the escalating volume of graph data. For a better understanding of GC and to distinguish it from other related topics, we present a formal definition of GC and establish a taxonomy. We conclude by addressing challenges and limitations, outlining future directions, and offering concise guidelines to inspire future research in this field.
  arXiv  Detail & Related papers  (2024-02-03T02:50:51Z)
• Graph Condensation: A Survey [49.41718583061147]
  The rapid growth of graph data poses significant challenges in storage, transmission, and particularly the training of graph neural networks (GNNs) To address these challenges, graph condensation (GC) has emerged as an innovative solution. GC focuses on a compact yet highly representative graph, enabling GNNs trained on it to achieve performance comparable to those trained on the original large graph.
  arXiv  Detail & Related papers  (2024-01-22T06:47:00Z)
• Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs [16.130356170284127]
  Heterogeneous graph few-shot learning (HGFL) has been developed to address the label sparsity issue in heterogeneous graphs (HGs) We propose a novel Causal OOD Heterogeneous graph Few-shot learning model, namely COHF.
  arXiv  Detail & Related papers  (2024-01-07T22:47:38Z)
• Cross-heterogeneity Graph Few-shot Learning [9.80898395055038]
  We propose a novel model for Cross-heterogeneity Graph Few-shot Learning, namely CGFL. In CGFL, we first extract meta-patterns to capture heterogeneous information. Then, we propose a score module to measure the informativeness of labeled samples and determine the transferability of each source HG.
  arXiv  Detail & Related papers  (2023-08-10T01:25:28Z)
• Guided Depth Map Super-resolution: A Survey [88.54731860957804]
  Guided depth map super-resolution (GDSR) aims to reconstruct a high-resolution (HR) depth map from a low-resolution (LR) observation with the help of a paired HR color image. A myriad of novel and effective approaches have been proposed recently, especially with powerful deep learning techniques. This survey is an effort to present a comprehensive survey of recent progress in GDSR.
  arXiv  Detail & Related papers  (2023-02-19T15:43:54Z)
• Heterogeneous Graph Neural Networks using Self-supervised Reciprocally Contrastive Learning [102.9138736545956]
  Heterogeneous graph neural network (HGNN) is a very popular technique for the modeling and analysis of heterogeneous graphs. We develop for the first time a novel and robust heterogeneous graph contrastive learning approach, namely HGCL, which introduces two views on respective guidance of node attributes and graph topologies. In this new approach, we adopt distinct but most suitable attribute and topology fusion mechanisms in the two views, which are conducive to mining relevant information in attributes and topologies separately.
  arXiv  Detail & Related papers  (2022-04-30T12:57:02Z)
• Fine-Grained Image Analysis with Deep Learning: A Survey [146.22351342315233]
  Fine-grained image analysis (FGIA) is a longstanding and fundamental problem in computer vision and pattern recognition. This paper attempts to re-define and broaden the field of FGIA by consolidating two fundamental fine-grained research areas -- fine-grained image recognition and fine-grained image retrieval.
  arXiv  Detail & Related papers  (2021-11-11T09:43:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.