BriefGPT.xyz
Jan, 2024
利用对比学习在根树中对连续时间序列进行二元事件编码
Encoding Binary Events from Continuous Time Series in Rooted Trees using Contrastive Learning
HTML
PDF
Tobias Engelhardt Rasmussen, Siv Sørensen
TL;DR
该研究旨在通过离散时间序列数据（顾客数据）推断本地网络的拓扑结构，同时提出了一种从连续时间序列数据学习二进制事件编码器的对比方法，并初步展示了该方法在学习有价值的编码器方面的潜力。
Abstract
broadband infrastructure
owners do not always know how their customers are connected in the
local networks
, which are structured as rooted trees. A recent study is able to infer the topology of a local network us
→