arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.05063cs.AIcs.DMcs.DS
收藏

组合数据上的计算与学习

Computing and Learning on Combinatorial Data

Purdue University(普渡大学)

Simon Zhang

AI总结:

本论文研究组合数据中的拓扑与连接性特征,以提升学习性能与算法效率,涵盖社交网络、网格、集合系统和分子等多种组合数据形式。

摘要:

二十一世纪是一个数据驱动的时代,人类活动与行为、物理现象、科学发现、技术进步以及世界上发生的几乎所有事情,都导致了数据的大规模生成、收集与利用。数据中的连接性是一项至关重要的属性。一个直接的例子是万维网,其中每个网页都通过超链接与其他网页相连,从而提供了一种有向连接形式。组合数据是指基于特定连接规则对数据项进行组合所得到的数据。其他形式的组合数据包括社交网络、网格、社区簇、集合系统和分子。本博士论文聚焦于利用组合数据进行学习与计算。我们研究并考察了连接数据内部及跨连接数据的拓扑特征与连接性特征,以提升学习性能并实现较高的算法效率。

英文摘要:

The twenty-first century is a data-driven era where human activities and behavior, physical phenomena, scientific discoveries, technology advancements, and almost everything that happens in the world resulting in massive generation, collection, and utilization of data. Connectivity in data is a crucial property. A straightforward example is the World Wide Web, where every webpage is connected to other web pages through hyperlinks, providing a form of directed connectivity. Combinatorial data refers to combinations of data items based on certain connectivity rules. Other forms of combinatorial data include social networks, meshes, community clusters, set systems, and molecules. This Ph.D. dissertation focuses on learning and computing with combinatorial data. We study and examine topological and connectivity features within and across connected data to improve the performance of learning and achieve high algorithmic efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑