A Temporal Knowledge Graph for Music Festival Lineup Forecasting
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2607. 23556v1 Announce Type: cross Abstract: Temporal graphs are increasingly used to model dynamic systems in diverse domains such as social networks, financial networks, and traffic networks.
arXiv:2509. 09474v2 Announce Type: replace Abstract: We address the task of temporal knowledge graph forecasting with an inherently interpretable method based on symbolic rules.
Chordonomicon is a new dataset of over 666,000 song-level symbolic chord progressions, each annotated with structural parts such as verse, chorus, and bridge, as well as genre and release date. The dataset was compiled by scraping user-generated progressions from multiple sources and shows strong similarity to established prior datasets. The authors also provide a reproducible benchmark suite for next chord prediction, evaluating RNN, GRU, and LSTM models across various context windows and data scales, and find that structural part annotations consistently improve prediction performance.
The paper evaluates Graph Neural Networks (GNNs) for predicting artist success within collaboration networks, extending prior work on Italian and Danish music scenes by adding a Polish dataset and merging the three into a tri‑national network. Statistical analysis shows the Polish and combined networks share similar clustering properties, while predictive experiments reveal that GNNs match or slightly outperform a Multilayer Perceptron (MLP) in some cases but the MLP generally yields higher success metrics. The findings suggest that internal node attributes such as genre and label affiliation may be more predictive than network topology, and that GNNs may better capture cross‑border relational structures in the merged network.
arXiv:2607. 23146v1 Announce Type: new Abstract: Inspired by recent breakthroughs in large language models for natural language processing, foundation models have emerged as a promising paradigm for zero-shot time series forecasting, enabling accurate predictions on datasets never seen during pre-training.
SAG (SQL‑Retrieval Augmented Generation) is a structured retrieval framework that indexes documents as event‑entity pairs, forming latent hyperedges that preserve n‑ary relations without building a global knowledge graph. At query time, shared entities act as join keys, dynamically creating a query‑scoped neighborhood of related events while keeping each evidence chunk intact. Experiments on HotpotQA, 2WikiMultiHopQA, and MuSiQue demonstrate that SAG outperforms existing dense‑retrieval baselines, achieving the highest recall and end‑to‑end QA performance, especially as reasoning‑chain complexity grows.