高阶图模型:从理论基础到机器学习(Dagstuhl Seminar 21352)

Tina Eliassi-Rad, V. Latora, M. Rosvall, Ingo Scholtes
{"title":"高阶图模型:从理论基础到机器学习(Dagstuhl Seminar 21352)","authors":"Tina Eliassi-Rad, V. Latora, M. Rosvall, Ingo Scholtes","doi":"10.4230/DagRep.11.7.139","DOIUrl":null,"url":null,"abstract":"Graph and network models are essential for data science applications in computer science, social sciences, and life sciences. They help to detect patterns in data on dyadic relations between pairs of genes, humans, or documents, and have improved our understanding of complex networks across disciplines. While the advantages of graph models of relational data are undisputed, we often have access to data with multiple types of higher-order relations not captured by simple graphs. Such data arise in social systems with non-dyadic or group-based interactions, multimodal transportation networks with multiple connection types, or time series containing specific sequences of nodes traversed on paths. The complex relational structure of such data questions the validity of graph-based data mining and modelling, and jeopardises interdisciplinary applications of network analysis and machine learning. To address this challenge, researchers in topological data analysis, network science, machine learning, and physics recently started to generalise network analysis to higher-order graph models that capture more than dyadic relations. These higher-order models differ from standard network analysis in assumptions, applications, and mathematical formalisms. As a result, the emerging field lacks a shared terminology, common challenges, benchmark data and metrics to facilitate fair comparisons. By bringing together researchers from different disciplines, Dagstuhl Seminar 21352 “Higher-Order Graph Models: From Theoretical Foundations to Machine Learning” aimed at the development of a common language and a shared understanding of key challenges in the field that foster progress in data analytics and machine learning for data with complex relational structure. This report documents the program and the outcomes of this seminar. Seminar August 29–1, 2021 – http://www.dagstuhl.de/21352 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis; Theory of computation → Machine learning theory; Mathematics of computing → Graph theory; Human-centered computing → Graph drawings; Human-centered computing → Social network analysis","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"139-178"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352)\",\"authors\":\"Tina Eliassi-Rad, V. Latora, M. Rosvall, Ingo Scholtes\",\"doi\":\"10.4230/DagRep.11.7.139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph and network models are essential for data science applications in computer science, social sciences, and life sciences. They help to detect patterns in data on dyadic relations between pairs of genes, humans, or documents, and have improved our understanding of complex networks across disciplines. While the advantages of graph models of relational data are undisputed, we often have access to data with multiple types of higher-order relations not captured by simple graphs. Such data arise in social systems with non-dyadic or group-based interactions, multimodal transportation networks with multiple connection types, or time series containing specific sequences of nodes traversed on paths. The complex relational structure of such data questions the validity of graph-based data mining and modelling, and jeopardises interdisciplinary applications of network analysis and machine learning. To address this challenge, researchers in topological data analysis, network science, machine learning, and physics recently started to generalise network analysis to higher-order graph models that capture more than dyadic relations. These higher-order models differ from standard network analysis in assumptions, applications, and mathematical formalisms. As a result, the emerging field lacks a shared terminology, common challenges, benchmark data and metrics to facilitate fair comparisons. By bringing together researchers from different disciplines, Dagstuhl Seminar 21352 “Higher-Order Graph Models: From Theoretical Foundations to Machine Learning” aimed at the development of a common language and a shared understanding of key challenges in the field that foster progress in data analytics and machine learning for data with complex relational structure. This report documents the program and the outcomes of this seminar. Seminar August 29–1, 2021 – http://www.dagstuhl.de/21352 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis; Theory of computation → Machine learning theory; Mathematics of computing → Graph theory; Human-centered computing → Graph drawings; Human-centered computing → Social network analysis\",\"PeriodicalId\":91064,\"journal\":{\"name\":\"Dagstuhl reports\",\"volume\":\"11 1\",\"pages\":\"139-178\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dagstuhl reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/DagRep.11.7.139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dagstuhl reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/DagRep.11.7.139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

图和网络模型对于计算机科学、社会科学和生命科学中的数据科学应用是必不可少的。它们有助于检测基因对、人类或文件之间二元关系的数据模式,并提高了我们对跨学科复杂网络的理解。虽然关系数据的图模型的优点是无可争议的,但我们经常需要访问具有多种类型的高阶关系的数据,这些关系不是由简单图捕获的。这些数据产生于具有非二元或群体交互的社会系统,具有多种连接类型的多式联运网络,或包含路径上经过的特定节点序列的时间序列。这些数据的复杂关系结构对基于图的数据挖掘和建模的有效性提出了质疑,并危及网络分析和机器学习的跨学科应用。为了应对这一挑战,拓扑数据分析、网络科学、机器学习和物理学领域的研究人员最近开始将网络分析推广到捕获更多二元关系的高阶图模型。这些高阶模型在假设、应用和数学形式上与标准网络分析不同。因此,新兴领域缺乏共同的术语、共同的挑战、基准数据和指标来促进公平比较。通过将来自不同学科的研究人员聚集在一起,Dagstuhl研讨会21352“高阶图模型:从理论基础到机器学习”旨在开发一种通用语言,并对该领域的关键挑战达成共识,从而促进数据分析和机器学习在复杂关系结构数据方面的进展。本报告记录了本次研讨会的计划和成果。研讨会2021年8月29日- 1日- http://www.dagstuhl.de/21352 2012 ACM学科分类计算理论→图算法分析;计算理论→机器学习理论;计算数学→图论;以人为本→图形绘图;以人为本的计算→社会网络分析
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352)
Graph and network models are essential for data science applications in computer science, social sciences, and life sciences. They help to detect patterns in data on dyadic relations between pairs of genes, humans, or documents, and have improved our understanding of complex networks across disciplines. While the advantages of graph models of relational data are undisputed, we often have access to data with multiple types of higher-order relations not captured by simple graphs. Such data arise in social systems with non-dyadic or group-based interactions, multimodal transportation networks with multiple connection types, or time series containing specific sequences of nodes traversed on paths. The complex relational structure of such data questions the validity of graph-based data mining and modelling, and jeopardises interdisciplinary applications of network analysis and machine learning. To address this challenge, researchers in topological data analysis, network science, machine learning, and physics recently started to generalise network analysis to higher-order graph models that capture more than dyadic relations. These higher-order models differ from standard network analysis in assumptions, applications, and mathematical formalisms. As a result, the emerging field lacks a shared terminology, common challenges, benchmark data and metrics to facilitate fair comparisons. By bringing together researchers from different disciplines, Dagstuhl Seminar 21352 “Higher-Order Graph Models: From Theoretical Foundations to Machine Learning” aimed at the development of a common language and a shared understanding of key challenges in the field that foster progress in data analytics and machine learning for data with complex relational structure. This report documents the program and the outcomes of this seminar. Seminar August 29–1, 2021 – http://www.dagstuhl.de/21352 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis; Theory of computation → Machine learning theory; Mathematics of computing → Graph theory; Human-centered computing → Graph drawings; Human-centered computing → Social network analysis
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信