行业动态
arxiv.org ·
@Zhidong Zhao
动态异构图表示学习:综述
该综述首次系统回顾动态异构图(DHG)表示学习方法。引入统一形式化定义,涵盖离散时间和连续时间DHG,从时间粒度角度分类。提出算法中心分类法,包括早期嵌入方法、基于GNN的模型和较新的Transformer方法。
AI推荐理由 动态异构图表示学习的系统综述,提出统一定义和算法分类法,涵盖嵌入、GNN和Transformer方法。对图学习研究者有参考价值,但作为综述,新颖性有限。
70
正文
计算机科学 > 机器学习
arXiv:2609.04779v1 (cs)
[提交于2026年9月4日]
标题:动态异构图表示学习:综述
作者:Huan Liu, Pengfei Jiao, Jie Yin, Hongjiang Chen, Zhidong Zhao
查看论文PDF,标题为《动态异构图表示学习:综述》,作者:Huan Liu等3位作者
查看PDF
HTML(实验性)
摘要:图表示学习(GRL)是建模复杂网络的标准范式。然而,现实世界的人工智能系统本质上表现为具有复杂交互的演化异质实体,这对静态或同质建模提出了重大挑战。为了解决这些复杂性,动态异构图(DHG)的表示学习已成为一种重要方法,用于学习同时保留结构语义和时间动态的低维表示。本综述首次系统性地回顾了DHG表示学习方法。我们首先引入一个统一的正式定义,从时间粒度的角度涵盖离散时间和连续时间DHG。在此公式的基础上,我们提出了一种新颖的以算法为中心的分类法,对现有文献进行分类,包括早期的基于嵌入的方法、基于图神经网络(GNN)的模型,以及相对较新的基于Transformer的DHG方法,同时明确强调它们在动态粒度方面的内在建模偏差。此外,我们总结了DHG表示学习的代表性应用,以及常用的数据集和基准。最后,我们讨论了有前景的研究方向,以指导这一快速发展领域的未来进展。
评论:
主题:
机器学习(cs.LG);人工智能(cs.AI);社交与信息网络(cs.SI)
引用为:
arXiv:2609.04779 [cs.LG]
(或
arXiv:2609.04779v1 [cs.LG] 用于此版本)
https://doi.org/10.48550/arXiv.2609.04779
聚焦以了解更多
arXiv发布的DOI通过DataCite(待注册)
提交历史
来自:Huan Liu [查看电子邮件]
[v1]
2026年9月4日星期五 06:17:19 UTC(44 KB)
全文链接:
访问论文:
查看论文PDF,标题为《动态异构图表示学习:综述》,作者:Huan Liu等3位作者
查看PDF
HTML(实验性)
TeX源文件
查看许可证
当前浏览上下文:
cs.LG
新
|
最近
| 2026-09
更改为浏览:
cs
cs.AI
cs.SI
参考文献与引用
NASA ADS
Google Scholar
Semantic Scholar
导出BibTeX引用
加载中...
BibTeX格式引用
×
加载中...
数据提供:
书签
书目工具
书目与引用工具
书目浏览器切换
书目浏览器(什么是浏览器?)
关联论文切换
关联论文(什么是关联论文?)
Litmaps切换
Litmaps(什么是Litmaps?)
scite.ai切换
scite智能引用(什么是智能引用?)
代码、数据、媒体
与本文相关的代码、数据和媒体
alphaXiv切换
alphaXiv(什么是alphaXiv?)
代码链接切换
CatalyzeX论文代码查找器(什么是CatalyzeX?)
DagsHub切换
DagsHub(什么是DagsHub?)
GotitPub切换
Gotit.pub(什么是GotitPub?)
Huggingface切换
Hugging Face(什么是Huggingface?)
ScienceCast切换
ScienceCast(什么是ScienceCast?)
演示
演示
Replicate切换
Replicate(什么是Replicate?)
Spaces切换
Hugging Face Spaces(什么是Spaces?)
Spaces切换
TXYZ.AI(什么是TXYZ.AI?)
相关论文
推荐与搜索工具
Influence Flower链接
Influence Flower(什么是Influence Flowers?)
核心推荐器切换
CORE推荐器(什么是CORE?)
IArxiv推荐器切换
IArxiv推荐器
(什么是IArxiv?)
作者
会议/期刊
机构
主题
关于arXivLabs
arXivLabs:与社区合作者的实验项目
arXivLabs是一个框架,允许合作者直接在我们的网站上开发和分享新的arXiv功能。
与arXivLabs合作的个人和组织都接受并认可我们的价值观:开放、社区、卓越和用户数据隐私。arXiv致力于这些价值观,并且只与遵守这些价值观的合作伙伴合作。
有一个能为arXiv社区增加价值的项目想法吗?了解更多关于arXivLabs的信息。
这篇论文的哪些作者是背书人?|
禁用MathJax(什么是MathJax?)
查看原文(中文正文为 AI 翻译)
Computer Science > Machine Learning
arXiv:2609.04779v1 (cs)
[Submitted on 4 Sep 2026]
Title:Dynamic Heterogeneous Graph Representation Learning: A Survey
Authors:Huan Liu, Pengfei Jiao, Jie Yin, Hongjiang Chen, Zhidong Zhao
View a PDF of the paper titled Dynamic Heterogeneous Graph Representation Learning: A Survey, by Huan Liu and 3 other authors
View PDF
HTML (experimental)
Abstract:Graph representation learning (GRL) serves as a canonical paradigm for modeling complex networks. However, real-world AI systems inherently manifest as evolving heterogeneous entities with complex interactions, posing significant challenges to static or homogeneous modeling. To address these complexities, representation learning for Dynamic Heterogeneous Graphs (DHGs) has emerged as a vital approach for learning low-dimensional representations that simultaneously preserve structural semantics and temporal dynamics. This survey presents the first systematic review of DHG representation learning methods. We first introduce a unified formal definition that encompasses both discrete-time and continuous-time DHGs from the perspective of temporal granularity. Building upon this formulation, we propose a novel algorithm-centric taxonomy that categorizes existing literature, including early embedding-based approaches, graph neural network (GNN)-based models, and relatively recent Transformer-based DHG methods, while explicitly highlighting their intrinsic modeling biases with respect to dynamic granularity. Furthermore, we summarize representative applications of DHG representation learning, along with commonly used datasets and benchmarks. Finally, we discuss promising research directions that guide future advances in this rapidly evolving field.
Comments:
Subjects:
Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Social and Information Networks (cs.SI)
Cite as:
arXiv:2609.04779 [cs.LG]
(or
arXiv:2609.04779v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.04779
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Huan Liu [view email]
[v1]
Fri, 4 Sep 2026 06:17:19 UTC (44 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Dynamic Heterogeneous Graph Representation Learning: A Survey, by Huan Liu and 3 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.LG
new
|
recent
| 2026-09
Change to browse by:
cs
cs.AI
cs.SI
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
export BibTeX citation
Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender
(What is IArxiv?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? |
Disable MathJax (What is MathJax?)