Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.01242 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911745781530624 |
|---|---|
| author | Rasmussen, Tobias Engelhardt Sørensen, Siv |
| author_facet | Rasmussen, Tobias Engelhardt Sørensen, Siv |
| contents | 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 using discrete time series data from the leaves of the tree (customers). In this study we propose a contrastive approach for learning a binary event encoder from continuous time series data. As a preliminary result, we show that our approach has some potential in learning a valuable encoder. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_01242 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Encoding Binary Events from Continuous Time Series in Rooted Trees using Contrastive Learning Rasmussen, Tobias Engelhardt Sørensen, Siv Machine Learning Artificial Intelligence Social and Information Networks 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 using discrete time series data from the leaves of the tree (customers). In this study we propose a contrastive approach for learning a binary event encoder from continuous time series data. As a preliminary result, we show that our approach has some potential in learning a valuable encoder. |
| title | Encoding Binary Events from Continuous Time Series in Rooted Trees using Contrastive Learning |
| topic | Machine Learning Artificial Intelligence Social and Information Networks |
| url | https://arxiv.org/abs/2401.01242 |