Pith. sign in

REVIEW 2 cited by

HATS: A Hierarchical Graph Attention Network for Stock Movement Prediction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.07999 v3 pith:G3SVQX4Z submitted 2019-08-07 q-fin.ST cs.AIcs.CE

classification q-fin.STcs.AIcs.CE
keywords stockinformationpredictionhatsmarketdatadifferentnode
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many researchers both in academia and industry have long been interested in the stock market. Numerous approaches were developed to accurately predict future trends in stock prices. Recently, there has been a growing interest in utilizing graph-structured data in computer science research communities. Methods that use relational data for stock market prediction have been recently proposed, but they are still in their infancy. First, the quality of collected information from different types of relations can vary considerably. No existing work has focused on the effect of using different types of relations on stock market prediction or finding an effective way to selectively aggregate information on different relation types. Furthermore, existing works have focused on only individual stock prediction which is similar to the node classification task. To address this, we propose a hierarchical attention network for stock prediction (HATS) which uses relational data for stock market prediction. Our HATS method selectively aggregates information on different relation types and adds the information to the representations of each company. Specifically, node representations are initialized with features extracted from a feature extraction module. HATS is used as a relational modeling module with initialized node representations. Then, node representations with the added information are fed into a task-specific layer. Our method is used for predicting not only individual stock prices but also market index movements, which is similar to the graph classification task. The experimental results show that performance can change depending on the relational data used. HATS which can automatically select information outperformed all the existing methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LLM-Enhanced Dynamic Financial Knowledge Graphs for Cross-Entity Signal Propagation and alpha discovery

    stat.AP 2026-07 conditional novelty 6.0 of 10

    In controlled simulations, community-aware propagation of LLM event signals on dynamic financial knowledge graphs recovers latent communities and prices incrementally beyond direct signals, though live alpha remains untested.

  2. Pre-training Time Series Models with Stock Data Customization

    cs.CE 2025-06 conditional novelty 6.0 of 10

    Stock Specialized Pre-trained Transformer (SSPT) uses stock code classification, sector classification, and moving average prediction as pre-training tasks, and reports improved stock selection returns and Sharpe rati...

Pith tools