用拓扑图结构从序列数据中自动提取抽象概念，识别出游戏中的获胜策略。
From data to concepts via wiring diagrams
- 基于拟骨架图与偏序集的对应关系，构建数据到概念的映射算法
- 在游戏行为分析中准确识别出获胜策略，且对噪声数据鲁棒
- 融合范畴论与聚类方法，适合复杂序列模式挖掘任务
布线图是表示时间过程等抽象概念的带标签有向图。本文引入准骨架布线图的概念，并证明其与哈斯图一一对应。基于此结果，设计了从序列数据中提取布线图的算法。将该算法应用于自主代理玩电脑游戏的行为分析，成功识别出获胜策略。与基于标准聚类技术（DBSCAN 和凝聚层次聚类）的两种算法相比，本算法在部分数据被扰动的情况下仍保持良好性能。本文整合了范畴论、图论、聚类、强化学习与数据工程的方法。
原文摘要 · Abstract (English)
A wiring diagram is a labeled directed graph that represents an abstract concept such as a temporal process. In this article, we introduce the notion of a quasi-skeleton wiring diagram graph, and prove that quasi-skeleton wiring diagram graphs correspond to Hasse diagrams. Using this result, we designed algorithms that extract wiring diagrams from sequential data. We used our algorithms in analyzing the behavior of an autonomous agent playing a computer game, and the algorithms correctly identified the winning strategies. We compared the performance of our main algorithm with two other algorithms based on standard clustering techniques (DBSCAN and agglomerative hierarchical), including when some of the data was perturbed. Overall, this article brings together techniques in category theory, graph theory, clustering, reinforcement learning, and data engineering.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。