FinGAT: Financial Graph Attention Networks for Recommending Top-K Profitable Stocks
Authors: Yi-Ling Hsu, Yu-Che Tsai, Cheng-Te Li
AI-generated Key Points
- Financial technology (FinTech) is a prominent area of interest for investors and companies
- Traditional stock analysis in FinTech focuses on predicting stock prices, but lacks emphasis on recommending profitable stocks
- Existing approaches to modeling time series of stock prices often overlook relationships between stocks and sectors or rely on predefined relationships that fail to capture underlying interactions and influences among stock prices
- The authors propose a novel deep learning-based model called Financial Graph Attention Networks (FinGAT) to address these limitations
- FinGAT aims to recommend the top-K profitable stocks based on return ratio using both time series data of stock prices and sector information
- FinGAT operates under the assumption that no pre-defined relationships between stocks are given
- The FinGAT model consists of three key components: hierarchical learning component, fully-connected graphs representing interactions among stocks and sectors, and a multi-task objective for recommending profitable stocks and predicting their movement
- Experiments using datasets from Taiwan Stock, S&P 500, and NASDAQ markets show that FinGAT outperforms state-of-the-art methods in terms of recommendation performance for profitable stocks
- FinGAT leverages deep learning techniques and graph attention networks to offer valuable insights for investors and companies in the FinTech domain.
Abstract: Financial technology (FinTech) has drawn much attention among investors and companies. While conventional stock analysis in FinTech targets at predicting stock prices, less effort is made for profitable stock recommendation. Besides, in existing approaches on modeling time series of stock prices, the relationships among stocks and sectors (i.e., categories of stocks) are either neglected or pre-defined. Ignoring stock relationships will miss the information shared between stocks while using pre-defined relationships cannot depict the latent interactions or influence of stock prices between stocks. In this work, we aim at recommending the top-K profitable stocks in terms of return ratio using time series of stock prices and sector information. We propose a novel deep learning-based model, Financial Graph Attention Networks (FinGAT), to tackle the task under the setting that no pre-defined relationships between stocks are given. The idea of FinGAT is three-fold. First, we devise a hierarchical learning component to learn short-term and long-term sequential patterns from stock time series. Second, a fully-connected graph between stocks and a fully-connected graph between sectors are constructed, along with graph attention networks, to learn the latent interactions among stocks and sectors. Third, a multi-task objective is devised to jointly recommend the profitable stocks and predict the stock movement. Experiments conducted on Taiwan Stock, S&P 500, and NASDAQ datasets exhibit remarkable recommendation performance of our FinGAT, comparing to state-of-the-art methods.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.