arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.09564stat.MLcs.LG
收藏

a-TMFG:通过近似最近邻构建可扩展的三角形最大过滤图

a-TMFG: Scalable Triangulated Maximally Filtered Graphs via Approximate Nearest Neighbors

Lionel Yelibi

AI总结:

a-TMFG通过近似最近邻方法,解决了大规模数据下构建三角形最大过滤图的内存和计算复杂度问题,提供了一种高效构建人工图的方法。

摘要:

传统的三角形最大过滤图(TMFG)构建需要预先计算和存储一个密集的相关矩阵;这限制了其在小规模和中等规模数据集中的应用。本文识别了在大规模使用TMFG时的关键内存和运行时间复杂度挑战。然后我们提出了近似三角形最大过滤图(a-TMFG)算法。这是一种新的方法,用于从数据中构建人工图,受TMFG启发。该方法采用k最近邻图(kNNG)进行初始构建,并实现了一种内存管理策略,用于在飞行中搜索和估计缺失的相关性。这提供了控制组合爆炸的表示。该算法经过对参数和噪声的鲁棒性测试,并在拥有数百万观测值的数据集上进行了评估。这种方法提供了一种简洁的方式,用于构建图,用于那些图被用作监督和无监督学习输入但没有自然图存在的用例。

英文摘要:

The traditional Triangular Maximally Filtered Graph (TMFG) construction requires pre-computation and storage of a dense correlation matrix; this limits its applicability to small and medium-sized datasets. Here we identify key memory and runtime complexity challenges when using TMFG at scale. We then present the Approximate Triangular Maximally Filtered Graph (a-TMFG) algorithm. This is a novel approach to scaling the construction of artificial graphs from data inspired by TMFG. The method employs k-Nearest Neighbors Graphs (kNNG) for initial construction, and implements a memory management strategy to search and estimate missing correlations on-the-fly. This provides representations to control combinatorial explosion. The algorithm is tested for robustness to the parameters and noise, and is evaluated on datasets with millions of observations. This new method provides a parsimonious way to construct graphs for use-cases where graphs are used as input to supervised and unsupervised learning but where no natural graph exists.

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

↑