<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Machine Learning Methods for Equity Time Series Forecasting: A Compendium</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Alberto</forename><surname>Matuozzo</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Birkbeck College</orgName>
								<orgName type="institution">University of London</orgName>
								<address>
									<addrLine>Malet St</addrLine>
									<postCode>WC1E 7HX</postCode>
									<settlement>London</settlement>
									<country key="GB">United Kingdom</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Paul</forename><forename type="middle">D</forename><surname>Yoo</surname></persName>
							<email>p.yoo@bbk.ac.uk</email>
							<affiliation key="aff0">
								<orgName type="department">Birkbeck College</orgName>
								<orgName type="institution">University of London</orgName>
								<address>
									<addrLine>Malet St</addrLine>
									<postCode>WC1E 7HX</postCode>
									<settlement>London</settlement>
									<country key="GB">United Kingdom</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Alessandro</forename><surname>Provetti</surname></persName>
							<email>a.provetti@bbk.ac.uk</email>
							<affiliation key="aff0">
								<orgName type="department">Birkbeck College</orgName>
								<orgName type="institution">University of London</orgName>
								<address>
									<addrLine>Malet St</addrLine>
									<postCode>WC1E 7HX</postCode>
									<settlement>London</settlement>
									<country key="GB">United Kingdom</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Maria</forename><forename type="middle">H</forename><surname>Kim</surname></persName>
							<email>mhykim@uow.edu.au</email>
							<affiliation key="aff1">
								<orgName type="institution">University of Wollongong</orgName>
								<address>
									<postCode>2522</postCode>
									<settlement>Wollongong</settlement>
									<region>NSW</region>
									<country key="AU">Australia</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Machine Learning Methods for Equity Time Series Forecasting: A Compendium</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">F12F6093CD51F8C4692C5287A4D39EF6</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-04-29T06:29+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Machine Learning, Deep Learning, Time Series Forecasting, Equity market forecasting Kim) 0000-0002-5614-3129 (A. Matuozzo)</term>
					<term>0000-0001-7665-8616 (P. D. Yoo)</term>
					<term>0000-0001-9542-4110 (A. Provetti)</term>
					<term>0000-0002-6279-5836 (M. H. Kim)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Machine learning is a method of building predictive models using a vast amount of data from different sources, capturing non-linear relationships between different variables. As a result, financial markets in general and stock markets in particular, offer a promising ground for the application of such method. This survey examines machine learning methods for equity market forecasting, identifying gaps in current knowledge and suggesting potential avenues to pursue further research. Computer science-centred quantitative studies have focused mainly on algorithms, testing results mostly on US data on short time-frames, yet, feature engineering, and testing findings on different markets and different time horizons, appear to be under-explored. This study thus introduces the financial context for non-experts and moves to review different models and tools in the realm of statistical learning, and deep learning. We believe that this approach will prove to be effective in financial practice to an interested reader without much prior knowledge of the finance literature. We survey the end-to-end deployment of machine learning to help readers from industry and academia to understand the peculiarities of applying these methods to equity market forecasting.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Devising Equity markets forecasting is relevant not only for the parties directly involved in price formation (e.g., companies and investors), but also for policymakers and regulators. Central banks have shown a growing interest in modelling equities to decide macro prudential policy, assess investors' attitude towards risk, and in some cases deploy capital in the market directly. For example, according to the 30th of June 2022 13F SEC filings 1 , the Swiss National Bank owns about $11.11 billions of Apple and $7.49 billions of Microsoft.</p><p>This study is driven by the need to review machine learning techniques applied to equity markets time series forecasting problems, with the objective to provide an overview for practitioners, highlight areas under explored and warranting further research.</p><p>This study explores research from finance and computer science, from industry and academia. As such, the selection of papers for this literature review is not purely bibliometric. We aim to cover a selection of high impact publications and original contributions from the field for the critical steps of the machine learning deployment process, from pre-processing to algorithm selection. We cite papers that are now part of history of financial theory for the benefit of non-experts. Research from other domains is included where it is reasonable to assume that the related techniques could be ported to financial time series forecasting.</p><p>The contributions of this study are as follows:</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Framing the problem</head><p>The non-stationarity and non-linearity of financial variables are the primary attributes to estimate a forecasting model for equity markets.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">The "Efficient Markets" Hypothesis</head><p>Under the Efficient Markets Hypothesis (EMH) developed by Fama <ref type="bibr" target="#b0">[1]</ref>, the sequence of price changes must be unpredictable if they fully incorporate information and expectations of market participants. Yet, in the real world, analysing past returns and processing publicly available information are instrumental to build a forecasting model. Jagadeesh and Titman <ref type="bibr" target="#b1">[2]</ref>, showed that it is possible to generate statistically significant abnormal returns, by buying the stocks that exhibited top decile returns in the past (i.e., winners) and selling stocks in the bottom decile, losers. Malkiel <ref type="bibr" target="#b2">[3]</ref> documented several market anomalies that increase predictability; however, these inefficiencies do not persist.</p><p>If market participants firmly believed in EMH, it would be irrational to trade, hence there would not be a financial market. Grossman and Stiglitz <ref type="bibr" target="#b3">[4]</ref> offer the following solution: the information derived by skilled investors is not entirely reflected in the market. As a result, investment research is compensated. Bauer et al. <ref type="bibr" target="#b4">[5]</ref> showed skill persistence amongst retail option traders: top decile performers over one year outperform individuals in the bottom decile the following year.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">The "Adaptive Markets" Hypothesis</head><p>Traditional financial theories assume that market participants are rational and with the same utility function. When these assumptions are violated, behavioural biases such as dissimilar risk appetite and inconsistent probability beliefs play a significant role to account for abnormal profit opportunities. Grinblatt et al. <ref type="bibr" target="#b6">[6]</ref> showed that individuals' personal traits and sentiment tend to affect trading behavior. Bernstein <ref type="bibr" target="#b7">[7]</ref> points out how financial markets undergo regime shifts through an evolutionary process, which explains the market dynamics.</p><p>The Adaptive Market Hypothesis (AMH) <ref type="bibr" target="#b8">[8]</ref> offers an alternative framework: different agents interact and adapt in response to ever changing market environment, competing to capture returns opportunities.</p><p>Machine learning, being adaptive in nature, has the set of tools to conduct research in the new paradigm: models are non-parametric in nature and have the capability to approximate complex non-linear, non-continuous functions. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Machine Learning in Finance</head><p>The emergence of big data gives rise to a paradigm shift in the field of financial engineering where the state-ofthe-art techniques and data processing capacity are of utmost importance. Not only newsflow, economic and stock market data are widely available in copious size, however, unstructured data (e.g., geo-location), can be accessed at any time, processed in different ways. As a result, investors equipped with the latest technological advancement can make use of an extensive set of features. Machine learning algorithms do not require data transformations to make a time series stationary, being able to learn complex patterns in high dimensions.</p><p>Quian <ref type="bibr" target="#b9">[9]</ref> showed the outperformance of several machine learning algorithms (logistic regression, Neural Network (NN), Support Vector Machines (SVM), denoising Autoencoders) compared to ARIMA. Gu et al. <ref type="bibr" target="#b10">[10]</ref> compared ordinary least squared regression to tree-based methods and NNs on the task of predicting equity excess returns for US stocks. The authors ascribe the superior performance of machine learning techniques to the ability to accommodate a large number of predictors and learn non-linear relationships between covariates.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Main Algorithm Deployed and Features utilised</head><p>In this section, different machine learning algorithms and their applications to stock market time series are presented. Figure <ref type="figure" target="#fig_0">1</ref> depicts the ML algorithms and their related references. Here the literature is reviewed focusing on the main steps required for an end-to-end machine learning application, rather than looking, almost exclusively, at the different algorithms deployed.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Peculiarities in Financial Timeseries</head><p>Framing time series forecasting problems as regression might present an issue in the financial domain: the prediction might be very close to the actual value and yet induce the wrong action. For example, given a value of the S&amp;P 500 of 4200, assume the 1-day forward forecast generated by two different models to be 4210 and 4150 respectively, with the actual future level being 4190: while the first model is more accurate, it will suggest entering a long position causing a loss. The second model, despite being further away from the observed value, would trigger the correct (profitable) action, establishing a short position.</p><p>In several time series classification studies, the labeling is conditional on a gating value g: an instance is labelled +1 if the response variable 𝑦 &gt; 𝑔, -1 otherwise. For example, Ballings et al. <ref type="bibr" target="#b11">[11]</ref> compared the performance of ensemble methods against single classifiers on the task to group European shares based on whether they will be up at least 25% in a year. Dixon et al. <ref type="bibr" target="#b12">[12]</ref> framed securities time series problems as multiclass attributing +1 to a positive movement, -1 to a downward direction and 0 as flat market, setting a value to determine 'no action' in order to balance the classes. Labelling examples, using an arbitrary fixed threshold does not take into account that returns are realised in a specific market regime. Defining for example a threshold of ±5% to determine the bounds of the 0 class, might be appropriate for a quiet market environment, however, it could be too small in a high volatility phase. Research should be conducted to scale raw data in ways that would result in predictors that carry information content related to the respective market regime.</p><p>Accuracy in time series classification problems might not reflect profitability if a model fails to capture the correct direction for large moves. For example, consider the sequence of returns +0.8%, +1%, +0.5%, -3%, and two binary classifiers (+1, -1): the first predicts four upwards movements, it is therefore 75% accurate. The second classifier outputs -1, -1, +1, -1: it is 50% accurate. If the outputs were to be fed into a trading system, the first classifier would generate a 0.7% loss while the second would yield a profit of 1.7%. An approach to mitigate this issue, suggested by industry practitioners <ref type="bibr" target="#b13">[13]</ref> is to train a model to predict returns and then value it based on direction accuracy (also called hit ratio).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Features</head><p>Despite the potential of machine learning algorithms to extract knowledge in many dimensions, several studies do not go beyond using lags of the target series as predictors. For example, Fischer and Krauss <ref type="bibr" target="#b14">[14]</ref> used only percentage changes of adjusted prices of the S&amp;P 500 index constituents.</p><p>An interesting feature engineering technique that tries to capture both past observations and market regime can be seen in <ref type="bibr" target="#b15">[15]</ref>. The authors implement a relative change transformation of the predictors in each data window: each element in a sample is subtracted and divided by the first observation of the sequence. As a result, the network will be learning from a price change that is put in the context of the short-term market environment in which it was generated. Possible avenues of research would be to devise ad hoc methods to rescale data dynamically.</p><p>The overwhelming majority of the papers surveyed in this study employs technical indicators <ref type="bibr" target="#b16">[16]</ref> as additional features. Patel et al. <ref type="bibr" target="#b17">[17]</ref> ran experiments on Indian equities using different representations of technical indicators: in their original form and in discrete form. The latter, called "trend-deterministic," is obtained by discretising continuous values of oscillators (e.g the Relative Strength Index, RSI) in two categories: +1, -1. Their study shows that the trend deterministic representation improves results irrespective of the algorithm.</p><p>Sentiment analysis is performed to take the pulse of the market participants' emotional state. Extracting sentiment from social media, particularly for short time frames applications has gained paramount importance given the rise of retail traders, whose decisions combined can have a major impact on price formation. Sentiment indicators can be the direct result of investors polls like for example, the American Association of Individual Investors (AAII) survey. The Investopedia portal<ref type="foot" target="#foot_0">2</ref> computes the Investopedia Anxiety Index (IAI) based on their readers' interests for topics such as macroeconomics, negative market and credit disruptions.</p><p>Schumaker and Chen <ref type="bibr" target="#b18">[18]</ref> proposed a model to predict the intraday share price of the companies after a piece of news was released. They used as predictors the price forecast using a linear regression model and features derived from text analysis of news articles. Kazemian et al. <ref type="bibr" target="#b19">[19]</ref> deployed an SVM to classify the sentiment extracted from financial news on US stocks. Bollen et al. <ref type="bibr" target="#b20">[20]</ref> showed that the emotional state, particularly the 'Calm' dimension, of the broad population has predictive power on the daily changes in the DJIA. Othan et al. <ref type="bibr" target="#b21">[21]</ref> proposed a model to predict the direction of Turkish stocks based exclusively on sentiment extracted from Twitter posts.</p><p>It is noteworthy that these sentiment centred techniques aim to output short term predictions. It would be interesting to extend this research over longer time horizons, using texts from commentators with domain knowledge, for example analysing blog posts from the likes of "Seeking Alpha".</p><p>Cho et al. <ref type="bibr" target="#b22">[22]</ref> simulated an investment strategy based on the text characteristics of equity research reports published by brokerage houses. The authors deployed Part of Speech tagging to engineer features such as: numbers of nouns, adjectives, number of sentences. Classifiers, using the text extracted features, were trained on the task of recognising successful buy recommendations on Korean equities. Fundamental analysis does much more than assessing the intrinsic value of an asset or company given that it includes both macro-econometrics and micro-econometrics approaches. As such it focuses on financial statements and macroeconomic data. Specific attention is warranted to avoid look-ahead bias: new data releases and revisions should enter the time series only when the updated information is disclosed. For example, quarterly GDP data, after the initial release, are later revised twice to get to the final figure <ref type="figure">.</ref> Only a limited number of studies in the field adopt fundamental data; this is probably due, on one hand to the aforementioned issues, and on the other to the low frequency nature. Olson and Mossman <ref type="bibr" target="#b23">[23]</ref> studied predictive modelling of Canadian stock excess returns and direction using as inputs 61 accounting ratios. Tsai et al. <ref type="bibr" target="#b24">[24]</ref> studied the application of ensemble learning methods to Taiwanese stock market quarterly direction forecast. Predictors included company financial ratios and macroeconomic indicators.</p><p>Fundamental reported data are backward-looking. Alberg et al. <ref type="bibr" target="#b25">[25]</ref> and Chauhan et al. <ref type="bibr" target="#b26">[26]</ref> while studying neural network applications to factor investing <ref type="bibr" target="#b27">[27]</ref> in US stocks, built a predictive model of companies' fundamental metrics. Stocks were then ranked and picked to form portfolios based on the forecasted fundamental values. These studies show that investing based on predicted company data outperforms stock selection based on reported information. An alternative solution could be using, as predictors consensus forecast figures from the financial analyst community. This approach would also allow sampling data with a frequency higher than the quarterly earnings cycle.</p><p>As summarised in Table <ref type="table" target="#tab_0">1</ref>, technical features can be easily retrieved from data vendors or calculated from price series. They are mostly used by practitioners to have short term timing indications, albeit with mixed results. Studying sentiment allows to read the emotional state of market participants. Sentiment data is mostly unstructured therefore, requires specific Natural Language Processing (NLP) tasks. Fundamental data are low frequency and potentially subject to the dangers of lookahead bias. However, this kind of data reveals the state of the economy. A predictive model aiming to generate a medium-or long-term forecast should take fundamental variables in consideration.</p><p>The    </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Ensemble Learning</head><p>Ensemble methods prescribe combing multiple algorithms to achieve better performance than inducing only the best member. Ensemble architectures are determined by how a population of diverse models is deployed and by the choice of aggregation mechanism to derive the final prediction. The Random Forest (RF) algorithm <ref type="bibr" target="#b28">[28]</ref> represents a prototypical example.</p><p>In Krauss et al. <ref type="bibr" target="#b29">[29]</ref>, a statistical arbitrage strategy is simulated after an ensemble architecture with majority voting (composed by a deep neural netwowk, gradient boosted tree and RF) has classified S&amp;P 500 constituents according to the probability to outperform the index. Yuan et al. <ref type="bibr" target="#b30">[30]</ref>, deployed NN, SVM and RF, to classify Chinese stocks based on belonging to the top 30% of companies in generating excess return over one month.</p><p>The authors highlight an issue arising adopting standard k-folds cross validation for time series problems: future data might be used to predict past observations, overstating the performance. They evaluate algorithms using a sliding window train and test set instead. Evaluating a model on periods prior to the training set might be desirable in certain cases: for example, for stress testing purposes.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Support Vector Machines</head><p>The Support Vector Machine (SVM) <ref type="bibr" target="#b31">[31]</ref> is a very effective algorithm able to solve non-linearly separable problems by enlarging the feature space thanks to the "kernel trick". Using the kernel functions allow to solve the problem in the original dimension without having to transform the data in a more complex space.</p><p>SVMs were compared in <ref type="bibr" target="#b32">[32]</ref> to linear and quadratic discrimination analysis, and Elman network to forecast the weekly direction of the Nikkei 225 index. Zbikowski <ref type="bibr" target="#b33">[33]</ref> proposed to consider volume data by plugging this information directly in the SVM formulation, multiplying the hyper-parameter representing the cost of margin violation, C, by a coefficient v based on the transaction volume in a given security over the input window. Patel et al. <ref type="bibr" target="#b34">[34]</ref> deployed a 2 stages model with the task of predicting forward closing prices. Their architecture comprises a Support Vector Regressor (SVR) to predict the features' values, and then feed this output into a different model to produce the estimated index close price.</p><p>SVM incurs in high computational costs with a large dataset. The adoption of deep learning has grown in popularity thanks to the capability to overcome SVM scalability problems without sacrificing performance. Chong et al. <ref type="bibr" target="#b35">[35]</ref> run experiments on stocks listed on the Korean market to make intraday returns prediction (5 minutes). The authors considered a network to be deep with just three hidden layers. Over the subsequent few years, structures significantly more complex will be developed. The impact of the network depth on a financial time series classification task performance was studied in <ref type="bibr" target="#b36">[36]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.">Deep Learning</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.1.">Recurrent Neural Networks</head><p>A Recurrent Neural Network (RNN) processes at any given stage as inputs information from that time step, and a hidden state derived from the previous one. Dixon et al. <ref type="bibr" target="#b37">[37]</ref> show that a RNN, with linear activation, can be assimilated to a Auto Regressive time series model. The output of a given time step can be written as: 𝑌𝑡 = 𝑓 (𝑊𝑥𝑥𝑡 + 𝑊𝑦𝑦𝑡−1 + 𝑏).</p><p>The Long Short Term Memory (LSTM) cell <ref type="bibr" target="#b38">[38]</ref> overcomes the RNNs limitations (exploding or vanishing gradient). A LSTM neuron adds to the recurrent unit hidden state (short term memory), a long-term cell state controlled by different gates. LSTM network can therefore handle long sequences.</p><p>A comparison of LSTM to RF, NNs can be seen in <ref type="bibr" target="#b39">[39]</ref>: the task in question was the prediction of the direction of 5 components of the BOVESPA index in a high frequency setting. Fischer and Krauss <ref type="bibr" target="#b14">[14]</ref> used as feature only the return series of the past 240 observations to classify 1 day forward returns, showing the ability of LSTM cells to learn long sequences. Alonso et al. <ref type="bibr" target="#b13">[13]</ref> tackled predicting the 1 day ahead return and the related direction of 50 constituents of the S&amp;P 500. This study showed that increasing the number of time steps to train the model from 1 to 10 improves the performance of the LSTM.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.2.">Convolutional Neural Networks</head><p>Convolutional Neural Networks (CNNs) have been particularly effective in computer vision. Convolution layers exhibit equivariance to translation; in time series data this property allows the algorithm, to detect patterns within a sample and recognise them, notwithstanding at which point in time they appear. Convolution filters over 1-dimension (1D) can be deployed to slide across time, deriving hidden patterns within samples. 1-dimensional convolution layers can be deployed as feature extractors before LSTMs, forming a CNN-LSTM architecture proposed in <ref type="bibr" target="#b15">[15]</ref>.</p><p>The dilation rate d of a convolution layer indicates the frequency of the number of elements in the input to which apply a convolution. Researchers from DeepMind conceived an architecture called WaveNet <ref type="bibr" target="#b40">[40]</ref>, able to achieve state-of-the-art performance in several text to speech tasks without the use of RNNs. It is obtained by stacking several 1D convolution layers, doubling the dilation rate at every layer. Thus, the receptive field is larger, albeit without additional parameters. The initial layers learn short term patterns, while as data progresses towards the output, sequences of longer term are extracted.</p><p>Borovykh et al. <ref type="bibr" target="#b41">[41]</ref> adapted the Wavenet architecture, using ReLU as activation function, for multivariate financial time series forecasting: 1D dilated causal convolutions run independently for each input time series to be combined before making the prediction. Experiments were run on several financial instruments, on 1 day forward return prediction tasks. Wavenet and LSTM performed equally in terms of forecasting the direction, however, Wavenet outputs more accurate point estimation. Borjesson et al. <ref type="bibr" target="#b42">[42]</ref> proposed a WaveNet inspired model, using as activation function the Scaled exponential Linear Unit (SeLU) for the convolution layers. They ran experiments with the goal of predicting the next day price and trend of the S&amp;P 500.</p><p>Convolutions over two dimensions (2D) could be used to extract the most salient features and the most significant sub sequence in a sample. This approach, recently emerging in the literature, offers the advantage to learn jointly patterns within each predictor time series, and the relationship between features. This could be particularly advantageous with economic time series, where the correlation between variables changes over time, albeit in a recurrent fashion.</p><p>Gudelek et al. <ref type="bibr" target="#b43">[43]</ref> used 2D convolutions simulating trading strategies on several Exchange Traded Fund (ETFs). Prices were differenced once to mitigate the issues of non-stationarity and transformed to be in a range between +1 and -1. The authors interpret the prediction in this range as confidence values. It would be interesting to conduct further research applying to financial time series tasks, architectures centred on 2D convolutions that have proven to be successful in other domains.</p><p>A recent stream of research leverages the success achieved in computer vision directly: time series data is transformed in order to assume the characteristics of pixel values and intensity. Cohen et al. <ref type="bibr" target="#b44">[44]</ref> converts a time series classification problem (spotting technical patterns) as an image recognition task; Zeng et al. <ref type="bibr" target="#b45">[45]</ref> ported a multivariate time series forecasting problem in US equities to the video prediction domain.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.3.">Autoencoders</head><p>Autoencoders (AE) are models conceived to replicate their inputs without supervision. The design usually prescribes an input layer, an encoding layer with a smaller number of units and a decoding layer of the same size of the input, providing a reconstructed representation. Autoencoders can be applied to financial time series prediction problems to reduce dimensions or noise. Troiano et al. <ref type="bibr" target="#b46">[46]</ref> focused on the impact of the feature reduction stage (starting from 40 technical indicators). Denoising Autoencoders were used in <ref type="bibr" target="#b9">[9]</ref> in order to create a latent feature representation, adding a noise component that randomly alters the raw data, forcing the algorithm to reconstruct robust inputs. Bao et al. <ref type="bibr" target="#b47">[47]</ref> stacked 5 autoencoders connecting the final output to a LSTM network to predict the one step ahead level of several stock market indices.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.4.">Generative Adversarial Networks</head><p>Generative Adversarial Networks (GANs) <ref type="bibr" target="#b48">[48]</ref> are composed by 2 competing models: the generator aims to approximate the data distribution and outputs synthetic samples; the discriminator takes either actual or synthetic data and estimates the probability that the sample in question is genuine. The generator aims to maximise the probability that the discriminator will make a mistake. Zhou et al. <ref type="bibr" target="#b49">[49]</ref> applied GANs to make one step ahead predictions in 42 Chinese stocks within a high frequency framework. The generator is an LSTM network, while a 1D-CNN plays the role of the discriminator.</p><p>Back testing is a common approach to measure the profitability of a model against past trends in the precise order in which they occurred. GANs could be employed to provide synthetic test sets, as if engineers were forward testing algorithms devised by researchers. A recent architecture fit for this purpose is Time-series Generative Adversarial Network (TimeGAN) <ref type="bibr" target="#b50">[50]</ref>. This framework was conceived to capture the time dependent conditional distribution of data. In addition to the unsupervised adversarial loss, the model prescribes the use of a supervised loss based on the original data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.5.">Attention</head><p>Attention mechanisms, pioneered by Bahdanau et al. <ref type="bibr" target="#b51">[51]</ref>, allow a decoder to focus at each step of a sequence on the most relevant (encoded) input. The decoder computes a weighted sum of the output of the encoder; the weights are learned by an attention layer, using as inputs the encoder output concatenated with the decoder previous hidden state. These techniques, developed for neural machine translation problems, have been applied to time series forecasting: attention mechanism weights differently each time step of a sequence, this is then fed to a forecasting model to derive a prediction. Zhang et al. <ref type="bibr" target="#b52">[52]</ref>proposed the AT-LSTM architecture: an attention mechanism using LSTM as encoder, assigns different weights to input features (time steps). Attention weighted sequences are than used as inputs into an LSTM network to output the prediction. A more complex version of this architecture can be seen in <ref type="bibr" target="#b53">[53]</ref>: here the input series is first encoded with an LSTM and an attention layer assigns weights to the features at each time step, obtaining an attention weighted features matrix. In the next stage another LSTM based attention mechanism weights the different hidden states across time steps. The final stage prescribes an LSTM bloc to make a prediction using as inputs the output of the previous stage and the target time series. This Dual-Stage Attention RNN (DA-RNN) aims to capture the most important features while learning time dependencies.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.6.">Underexplored Areas</head><p>So far we have discussed researchers tackling the problems of non-stationarity of financial data, different market regimes and low signal to noise ratio, deploying more and more complex algorithms. Further study should be conducted focusing on feature engineering: rescaling and labelling examples considering the related market environment, therefore avoiding a fixed arbitrary threshold to define classes, would put the data in relation to the context in which they were generated.</p><p>Framing the prediction problem in terms of classification is vulnerable to not identifying large movements. On the other hand, developing a model to predict future securities prices could have the pitfall that a fairly accurate point estimate, albeit in the wrong direction, could result in a loss-making course of action.</p><p>Research could be pursued in developing alternative approaches in terms of training, for example, conceiving models learning jointly regression and classification tasks.</p><p>In contrast with many of the studies reviewed that use as input the target series and technical indicators, further research could be conducted combining features from different domains. A diverse data pool could point towards unexplored avenues in economics research.</p><p>The literature reviewed in this study adopts input time series exclusively in tabular form, however, financial professional place considerable value in extracting knowledge from the relationship and interaction amongst different variables. Graph Neural Networks (GNNs) <ref type="bibr" target="#b54">[54]</ref> are able to extract knowledge from the interplay between different nodes in a graph, therefore could represent a novel approach, worthy of further research in our field. An exploratory study related to Japanese equities can be seen in <ref type="bibr" target="#b55">[55]</ref>. The authors motivated the use of GNNs to leverage inter-market and inter-company relationships.</p><p>The main paradigm adopted by both industry and academia when devising a machine learning solution has been to consider a dataset as fixed, focusing on algorithm development. This survey shows that there is potential for progress, keeping the algorithm fixed, placing the data at the centre of the research process instead.</p><p>Ensemble learning approaches combining neural networks have been the winning architecture in image recognition competitions. Similar ideas could be explored, applying diversified network ensembles to financial data. Different models could be trained on different market regimes. One way to deal with a changing environment, is to constantly discard old data and retrain the model with more recent examples. Nevertheless, often, market dynamics observed in the past occur in a similar way at a later stage. Conceiving a way to use past, however, relevant information is an interesting avenue to pursue further study.</p><p>While the value of machine learning methods to equity time series forecasting has been shown in the short term, it would be interesting to test further these techniques sampling data with lower frequency. Extending findings to monthly data would graduate machine learning methods to applications beyond the realm of trading.</p><p>This survey shows how the playground for machine learning experiment in equities is the S&amp;P 500. Few studies try to corroborate findings extending the research to different countries. European Equities in particular, emerge as an area which remains rather under-explored.</p><p>Moreover, given that different algorithms are simulated on different data, it is difficult to assess what could be considered the state of the art. It would be very fruitful for the field if, perhaps as a cooperative project between industry and academia, different financial multivariate datasets ( e.g., one for US equities and one for European shares) would be engineered as standard, in order to provide a more objective common ground to conduct research.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Concluding Remarks</head><p>Researchers tackled the problem of equity market forecasting, initially deploying statistical time-series forecasting techniques and then experimenting with complex deep learning architectures.</p><p>In particular, LSTM has been proven to be useful in solving the vanishing/exploding gradient problem while offering the advantage of modelling non-linear time series data. Dilated convolutions, on their own, or as feature extractors, constitute an effective technique when dealing with long sequences. C2D centred architectures are an emerging method capable of extracting local knowledge about the interaction of different features.</p><p>With this review, we advocate the pursuit of research on every component of the machine learning value chain, rather than focusing exclusively on the algorithmic core. Most studies show results only on a specific market or related to a specific period, thus, the general robustness of findings could be improved. Applying machine learning to financial time series is a challenging, however, rewarding endeavour. Given the importance of the decisions based on equity market forecasts, even a small improvement in model performance can have a major impact.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Machine learning methods for equity market forecasting; algorithms and reference papers.</figDesc><graphic coords="2,302.62,84.19,214.32,130.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Surveyed papers grouped by kinds of features adopted. The combination is composed by studies using at least two sources of inputs, e.g., technical &amp; sentiment.</figDesc><graphic coords="4,303.32,191.41,201.97,101.72" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Surveyed papers grouped by Sampling frequency.</figDesc><graphic coords="4,302.98,344.17,202.65,116.44" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. In light of this survey more attention should be devoted to expanding the feature space, via both feature engineering based on domain knowledge, and combining predictors from different sources of data (technical, fundamental and sentiment). The literature surveyed appears to be centred on short term forecasting as shown in Figure3. Furthermore, tests are mostly related to US markets ( Figure4).</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Markets used for experiments. Global encompasses research using securities from multiple geographic areas. Others refer to securities of different asset classes, e.g., futures on indices and commodities.</figDesc><graphic coords="5,89.98,84.19,201.99,117.19" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Feed</head><label></label><figDesc>forward neural networks extend linear models by composing different functions that might carry an element of non-linearity. As a result, this is equivalent to expanding the linear problem 𝑦 = 𝑤𝑥 + 𝑏 to 𝑦 = 𝑤(𝑔(𝑥, 𝜃)) + 𝑏. An example of activation function is the well known Rectified Linear Unit (ReLU). In this study the terms Deep Learning and Deep Neural Network (DNN) are used for architectures encompassing more than 3 layers.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>vast majority of research consulted for this study used only one or two types of features, as summarised in Pros and Cons of different kinds of features.</figDesc><table><row><cell>Feature type</cell><cell>Examples</cell><cell>Pros</cell><cell>Cons</cell></row><row><cell>Technical</cell><cell>RSI</cell><cell>Easy to</cell><cell>Mixed</cell></row><row><cell></cell><cell>Momentum</cell><cell>compute</cell><cell>results</cell></row><row><cell>Sentiment</cell><cell>AAII</cell><cell>Capture</cell><cell>Requires</cell></row><row><cell></cell><cell>Twitter Data</cell><cell>emotional st.</cell><cell>NLP</cell></row><row><cell>Fundamental</cell><cell>GDP</cell><cell>Medium-or</cell><cell>Look-ahead</cell></row><row><cell></cell><cell>P/E</cell><cell>Long-term</cell><cell>bias</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_0">Please see www.investopedia.com</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Efficient capital markets: A review of theory and empirical work</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">F</forename><surname>Fama</surname></persName>
		</author>
		<ptr target="http://www.jstor.org/stable/2325486" />
	</analytic>
	<monogr>
		<title level="j">The Journal of Finance</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<biblScope unit="page" from="383" to="417" />
			<date type="published" when="1970">1970</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Returns to buying winners and selling losers: Implications for stock market efficiency</title>
		<author>
			<persName><forename type="first">N</forename><surname>Jegadeesh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Titman</surname></persName>
		</author>
		<idno type="DOI">10.1111/j.1540-6261.1993.tb04702.x</idno>
		<ptr target="https://doi.org/10.1111/j.1540-6261.1993.tb04702.x" />
	</analytic>
	<monogr>
		<title level="j">The Journal of Finance</title>
		<imprint>
			<biblScope unit="volume">48</biblScope>
			<biblScope unit="page" from="65" to="91" />
			<date type="published" when="1993">1993</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">The efficient market hypothesis and its critics</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">G</forename><surname>Malkiel</surname></persName>
		</author>
		<ptr target="http://www.jstor.org/stable/3216840" />
	</analytic>
	<monogr>
		<title level="j">The Journal of Economic Perspectives</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page" from="59" to="82" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">On the impossibility of informationally efficient markets</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">J</forename><surname>Grossman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">E</forename><surname>Stiglitz</surname></persName>
		</author>
		<idno type="DOI">10.7916/D8765R99</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.7916/D8765R99" />
	</analytic>
	<monogr>
		<title level="j">American Economic Review</title>
		<imprint>
			<biblScope unit="volume">72</biblScope>
			<biblScope unit="page" from="393" to="408" />
			<date type="published" when="1982">1982</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Option trading and individual investor performance</title>
		<author>
			<persName><forename type="first">R</forename><surname>Bauer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Cosemans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Eichholtz</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Banking &amp; Finance</title>
		<imprint>
			<biblScope unit="volume">33</biblScope>
			<biblScope unit="page">731</biblScope>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title/>
		<idno type="DOI">10.1016/j.jbankfin.2008.11.005</idno>
		<ptr target="https://doi.org/10.1016/j.jbankfin.2008.11.005" />
		<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Sensation seeking, overconfidence, and trading activity</title>
		<author>
			<persName><forename type="first">M</forename><surname>Grinblatt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Keloharju</surname></persName>
		</author>
		<ptr target="http://www.jstor.org/stable/20487979" />
	</analytic>
	<monogr>
		<title level="j">The Journal of Finance</title>
		<imprint>
			<biblScope unit="volume">64</biblScope>
			<biblScope unit="page" from="549" to="578" />
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Why the efficient market offers hope to active management</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">L</forename><surname>Bernstein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Applied Corporate Finance</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page" from="129" to="136" />
			<date type="published" when="1999">1999</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">Adaptive Markets: Financial Evolution at the Speed of Thought</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">W</forename><surname>Lo</surname></persName>
		</author>
		<ptr target="http://www.jstor.org/stable/j.ctvc77k3n" />
		<imprint>
			<date type="published" when="2017">2017</date>
			<publisher>Princeton University Press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<title level="m" type="main">Financial series prediction: Comparison between precision of time series models and machine learning methods</title>
		<author>
			<persName><forename type="first">X.-Y</forename><surname>Qian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Gao</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<title level="m" type="main">Empirical asset pricing via machine learning</title>
		<author>
			<persName><forename type="first">S</forename><surname>Gu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">T</forename><surname>Kelly</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Xiu</surname></persName>
		</author>
		<idno type="DOI">10.2139/ssrn.3281018</idno>
		<idno>doi:</idno>
		<ptr target="10.2139/ssrn.3281018" />
		<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Evaluating multiple classifiers for stock price direction prediction</title>
		<author>
			<persName><forename type="first">M</forename><surname>Ballings</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">V</forename><surname>Poel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Hespeels</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Gryp</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2015.05.013</idno>
		<ptr target="https://doi.org/10.1016/j.eswa.2015.05.013.doi:10.1016/j.eswa.2015.05.013" />
	</analytic>
	<monogr>
		<title level="j">Expert Syst. Appl</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="page" from="7046" to="7056" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<title level="m" type="main">Classifficationbased financial markets prediction using deep neural networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Dixon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Klabjan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Bang</surname></persName>
		</author>
		<idno>CoRR abs/1603.08604</idno>
		<ptr target="http://arxiv.org/abs/1603.08604.arXiv:1603.08604" />
		<imprint>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<author>
			<persName><forename type="first">T</forename><surname>Guida</surname></persName>
		</author>
		<title level="m">Big Data and Machine Learning in Quantitative Investment</title>
				<imprint>
			<publisher>Wiley</publisher>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Deep learning with long short-term memory networks for financial market predictions</title>
		<author>
			<persName><forename type="first">T</forename><surname>Fischer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Krauss</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ejor.2017.11.054</idno>
		<ptr target="https://doi.org/10.1016/j.ejor.2017.11.054.doi:10.1016/j.ejor.2017.11.054" />
	</analytic>
	<monogr>
		<title level="j">Eur. J. Oper. Res</title>
		<imprint>
			<biblScope unit="volume">270</biblScope>
			<biblScope unit="page" from="654" to="669" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Novel deep learning model with CNN and bi-directional LSTM for improved stock market index prediction</title>
		<author>
			<persName><forename type="first">J</forename><surname>Eapen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Bein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Verma</surname></persName>
		</author>
		<idno type="DOI">10.1109/CCWC.2019.8666592</idno>
		<ptr target="https://doi.org/10.1109/CCWC.2019.8666592.doi:10.1109/CCWC.2019.8666592" />
	</analytic>
	<monogr>
		<title level="m">IEEE 9th Annual Computing and Communication Workshop and Conference, CCWC 2019</title>
				<meeting><address><addrLine>Las Vegas, NV, USA</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2019">January 7-9, 2019. 2019</date>
			<biblScope unit="page" from="264" to="270" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<title level="m" type="main">Technical Analysis of the Futures Markets: A Comprehensive Guide to Trading Methods and Applications</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">J</forename><surname>Murphy</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1986">1986</date>
			<publisher>Prentice Hall</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Predicting stock and stock price index movement using trend deterministic data preparation and machine learning techniques</title>
		<author>
			<persName><forename type="first">J</forename><surname>Patel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Thakkar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Kotecha</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2014.07.040</idno>
		<ptr target="https://doi.org/10.1016/j.eswa.2014.07.040.doi:10.1016/j.eswa.2014.07.040" />
	</analytic>
	<monogr>
		<title level="j">Expert Syst. Appl</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="page" from="259" to="268" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Textual analysis of stock market prediction using breaking financial news: The azfin text system</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">P</forename><surname>Schumaker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Chen</surname></persName>
		</author>
		<idno type="DOI">10.1145/1462198.1462204</idno>
		<idno>doi:10.1145/1462198</idno>
		<ptr target="https://doi.org/10.1145/1462198.1462204" />
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Inf. Syst</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="page">19</biblScope>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Evaluating sentiment analysis in the context of securities trading</title>
		<author>
			<persName><forename type="first">S</forename><surname>Kazemian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Penn</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/p16-1197</idno>
		<ptr target="https://doi.org/10.18653/v1/p16-1197.doi:10.18653/v1/p16-1197" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016</title>
		<title level="s">Long Papers</title>
		<meeting>the 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016<address><addrLine>Berlin, Germany</addrLine></address></meeting>
		<imprint>
			<publisher>The Association for Computer Linguistics</publisher>
			<date type="published" when="2016">August 7-12, 2016. 2016</date>
			<biblScope unit="volume">1</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Twitter mood predicts the stock market</title>
		<author>
			<persName><forename type="first">J</forename><surname>Bollen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Mao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zeng</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jocs.2010.12.007</idno>
		<ptr target="https://doi.org/10.1016/j.jocs.2010.12.007.doi:10.1016/j.jocs.2010.12.007" />
	</analytic>
	<monogr>
		<title level="j">J. Comput. Sci</title>
		<imprint>
			<biblScope unit="volume">2</biblScope>
			<biblScope unit="page" from="1" to="8" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Financial sentiment analysis for predicting direction of stocks using bidirectional encoder representations from transformers (bert) and deep learning models</title>
		<author>
			<persName><forename type="first">D</forename><surname>Othan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><forename type="middle">H</forename><surname>Kilimci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. Int. Conf. Innov. Intell. Technol</title>
				<meeting>Int. Conf. Innov. Intell. Technol</meeting>
		<imprint>
			<date type="published" when="2019">2019. 2019</date>
			<biblScope unit="page" from="30" to="35" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Equity research reportdriven investment strategy in korea using binary classification on stock price direction</title>
		<author>
			<persName><forename type="first">P</forename><surname>Cho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Park</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Song</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page" from="46364" to="46373" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Neural network forecasts of canadian stock returns using accounting ratios</title>
		<author>
			<persName><forename type="first">D</forename><surname>Olson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mossman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Forecasting</title>
		<imprint>
			<biblScope unit="volume">19</biblScope>
			<biblScope unit="page" from="453" to="465" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Predicting stock returns by classifier ensembles</title>
		<author>
			<persName><forename type="first">C</forename><surname>Tsai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">C</forename><surname>Yen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Chen</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.asoc.2010.10.001</idno>
		<ptr target="https://doi.org/10.1016/j.asoc.2010.10.001.doi:10.1016/j.asoc.2010.10.001" />
	</analytic>
	<monogr>
		<title level="j">Appl. Soft Comput</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="page" from="2452" to="2459" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<monogr>
		<title level="m" type="main">Improving factor-based quantitative investing by forecasting company fundamentals</title>
		<author>
			<persName><forename type="first">J</forename><surname>Alberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><forename type="middle">C</forename><surname>Lipton</surname></persName>
		</author>
		<idno>CoRR abs/1711.04837</idno>
		<ptr target="http://arxiv.org/abs/1711.04837.arXiv:1711.04837" />
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Uncertaintyaware lookahead factor models for quantitative investing</title>
		<author>
			<persName><forename type="first">L</forename><surname>Chauhan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Alberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><forename type="middle">C</forename><surname>Lipton</surname></persName>
		</author>
		<ptr target="http://proceedings.mlr.press/v119/chauhan20a.html" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 37th International Conference on Machine Learning, ICML 2020</title>
				<meeting>the 37th International Conference on Machine Learning, ICML 2020<address><addrLine>PMLR</addrLine></address></meeting>
		<imprint>
			<publisher>Proceedings of Machine Learning Research</publisher>
			<date type="published" when="2020-07">July 2020. 2020</date>
			<biblScope unit="volume">119</biblScope>
			<biblScope unit="page" from="1489" to="1499" />
		</imprint>
	</monogr>
	<note>Virtual Event</note>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">A five-factor asset pricing model</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">F</forename><surname>Fama</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">R</forename><surname>French</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of financial economics</title>
		<imprint>
			<biblScope unit="volume">116</biblScope>
			<biblScope unit="page" from="1" to="22" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Random forests</title>
		<author>
			<persName><forename type="first">L</forename><surname>Breiman</surname></persName>
		</author>
		<idno type="DOI">10.1023/A:1010933404324</idno>
		<ptr target="https://doi.org/10.1023/A:1010933404324.doi:10.1023/A:1010933404324" />
	</analytic>
	<monogr>
		<title level="j">Mach. Learn</title>
		<imprint>
			<biblScope unit="volume">45</biblScope>
			<biblScope unit="page" from="5" to="32" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Deep neural networks, gradient-boosted trees, random forests: Statistical arbitrage on the s&amp;p 500</title>
		<author>
			<persName><forename type="first">C</forename><surname>Krauss</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><forename type="middle">A</forename><surname>Do</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Huck</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ejor.2016.10.031</idno>
		<ptr target="https://doi.org/10.1016/j.ejor.2016.10.031.doi:10.1016/j.ejor.2016.10.031" />
	</analytic>
	<monogr>
		<title level="j">Eur. J. Oper. Res</title>
		<imprint>
			<biblScope unit="volume">259</biblScope>
			<biblScope unit="page" from="689" to="702" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Integrated long-term stock selection models based on feature selection and machine learning algorithms for china stock market</title>
		<author>
			<persName><forename type="first">X</forename><surname>Yuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Yuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><forename type="middle">U</forename><surname>Ain</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACCESS.2020.2969293</idno>
		<ptr target="https://doi.org/10.1109/ACCESS.2020.2969293.doi:10.1109/ACCESS.2020.2969293" />
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="22672" to="22685" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Support-vector networks</title>
		<author>
			<persName><forename type="first">C</forename><surname>Cortes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Vapnik</surname></persName>
		</author>
		<idno type="DOI">10.1007/BF00994018</idno>
		<ptr target="https://doi.org/10.1007/BF00994018.doi:10.1007/BF00994018" />
	</analytic>
	<monogr>
		<title level="j">Mach. Learn</title>
		<imprint>
			<biblScope unit="volume">20</biblScope>
			<biblScope unit="page" from="273" to="297" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">Forecasting stock market movement direction with support vector machine</title>
		<author>
			<persName><forename type="first">W</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Nakamori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S.-Y</forename><surname>Wang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computers &amp; operations research</title>
		<imprint>
			<biblScope unit="volume">32</biblScope>
			<biblScope unit="page" from="2513" to="2522" />
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">Using volume weighted support vector machines with walk forward testing and feature selection for the purpose of creating stock trading strategy</title>
		<author>
			<persName><forename type="first">K</forename><surname>Zbikowski</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2014.10.001</idno>
		<ptr target="https://doi.org/10.1016/j.eswa.2014.10.001.doi:10.1016/j.eswa.2014.10.001" />
	</analytic>
	<monogr>
		<title level="j">Expert Syst. Appl</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="page" from="1797" to="1805" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Predicting stock market index using fusion of machine learning techniques</title>
		<author>
			<persName><forename type="first">J</forename><surname>Patel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Thakkar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Kotecha</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2014.10.031</idno>
		<ptr target="https://doi.org/10.1016/j.eswa.2014.10.031.doi:10.1016/j.eswa.2014.10.031" />
	</analytic>
	<monogr>
		<title level="j">Expert Syst. Appl</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="page" from="2162" to="2172" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<analytic>
		<title level="a" type="main">Deep learning networks for stock market analysis and prediction: Methodology, data representations, and case studies</title>
		<author>
			<persName><forename type="first">E</forename><surname>Chong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">C</forename><surname>Park</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">83</biblScope>
			<biblScope unit="page" from="187" to="205" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">Predicting the daily return direction of the stock market using hybrid machine learning algorithms</title>
		<author>
			<persName><forename type="first">X</forename><surname>Zhong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Enke</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Financial Innovation</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="1" to="20" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">F</forename><surname>Dixon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Halperin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bilokon</surname></persName>
		</author>
		<title level="m">Machine learning in Finance</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="volume">1406</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<analytic>
		<title level="a" type="main">Long short-term memory</title>
		<author>
			<persName><forename type="first">S</forename><surname>Hochreiter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Schmidhuber</surname></persName>
		</author>
		<idno type="DOI">10.1162/neco.1997.9.8.1735</idno>
		<ptr target="https://doi.org/10.1162/neco.1997.9.8.1735.doi:10.1162/neco.1997.9.8.1735" />
	</analytic>
	<monogr>
		<title level="j">Neural Comput</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page" from="1735" to="1780" />
			<date type="published" when="1997">1997</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">Stock market&apos;s price movement prediction with lstm neural networks</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Nelson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">C</forename><surname>Pereira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">A</forename><surname>De</surname></persName>
		</author>
		<author>
			<persName><surname>Oliveira</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">2017 International joint conference on neural networks (IJCNN)</title>
				<imprint>
			<publisher>Ieee</publisher>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="1419" to="1426" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<analytic>
		<title level="a" type="main">Wavenet: A generative model for raw audio</title>
		<author>
			<persName><forename type="first">A</forename><surname>Van Den Oord</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dieleman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Simonyan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Vinyals</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Graves</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Kalchbrenner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">W</forename><surname>Senior</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Kavukcuoglu</surname></persName>
		</author>
		<ptr target="http://www.isca-speech.org/archive/SSW_2016/abstracts/ssw9_DS-4_van_den_Oord.html" />
	</analytic>
	<monogr>
		<title level="m">The 9th ISCA Speech Synthesis Workshop</title>
				<meeting><address><addrLine>Sunnyvale, CA, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ISCA</publisher>
			<date type="published" when="2016-09-15">13-15 September 2016. 2016</date>
			<biblScope unit="page">125</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b41">
	<monogr>
		<title level="m" type="main">Conditional time series forecasting with convolutional neural networks</title>
		<author>
			<persName><forename type="first">A</forename><surname>Borovykh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Bohté</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">W</forename><surname>Oosterlee</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b42">
	<analytic>
		<title level="a" type="main">Forecasting financial time series through causal and dilated convolutional neural networks</title>
		<author>
			<persName><forename type="first">L</forename><surname>Börjesson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Singull</surname></persName>
		</author>
		<idno type="DOI">10.3390/e22101094</idno>
		<ptr target="https://doi.org/10.3390/e22101094.doi:10.3390/e22101094" />
	</analytic>
	<monogr>
		<title level="j">Entropy</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<date type="published" when="1094">2020. 1094</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b43">
	<analytic>
		<title level="a" type="main">A deep learning based stock trading model with 2-d CNN trend detection</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">U</forename><surname>Gudelek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Boluk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Ozbayoglu</surname></persName>
		</author>
		<idno type="DOI">10.1109/SSCI.2017.8285188</idno>
		<ptr target="https://doi.org/10.1109/SSCI.2017.8285188.doi:10.1109/SSCI.2017.8285188" />
	</analytic>
	<monogr>
		<title level="m">IEEE Symposium Series on Computational Intelligence, SSCI 2017</title>
				<meeting><address><addrLine>Honolulu, HI, USA</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2017-11-27">2017. November 27 -Dec. 1, 2017. 2017</date>
			<biblScope unit="page" from="1" to="8" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b44">
	<analytic>
		<title level="a" type="main">Trading via image classification</title>
		<author>
			<persName><forename type="first">N</forename><surname>Cohen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Balch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Veloso</surname></persName>
		</author>
		<idno type="DOI">10.1145/3383455.3422544</idno>
		<idno>doi:10.1145/3383455. 3422544</idno>
		<ptr target="https://doi.org/10.1145/3383455.3422544" />
	</analytic>
	<monogr>
		<title level="m">ICAIF &apos;20: The First ACM International Conference on AI in Finance</title>
				<editor>
			<persName><forename type="first">T</forename><surname>Balch</surname></persName>
		</editor>
		<meeting><address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2020">October 15-16, 2020. 2020</date>
			<biblScope unit="volume">53</biblScope>
			<biblScope unit="page">6</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b45">
	<analytic>
		<title level="a" type="main">Deep video prediction for time series forecasting</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Zeng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Balch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Veloso</surname></persName>
		</author>
		<idno type="DOI">10.1145/3490354.3494404</idno>
		<idno>doi:10.1145/3490354.3494404</idno>
		<ptr target="https://doi.org/10.1145/3490354.3494404" />
	</analytic>
	<monogr>
		<title level="m">ICAIF&apos;21: 2nd ACM International Conference on AI in Finance, Virtual Event</title>
				<editor>
			<persName><forename type="first">A</forename><surname>Calinescu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Szpruch</surname></persName>
		</editor>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2021">November 3 -5, 2021. 2021</date>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="page">7</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b46">
	<monogr>
		<title level="m" type="main">On feature reduction using deep learning for trend prediction in finance</title>
		<author>
			<persName><forename type="first">L</forename><surname>Troiano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Mejuto</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Kriplani</surname></persName>
		</author>
		<idno>CoRR abs/1704.03205</idno>
		<ptr target="http://arxiv.org/abs/1704.03205.arXiv:1704.03205" />
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b47">
	<analytic>
		<title level="a" type="main">A deep learning framework for financial time series using stacked autoencoders and long-short term memory</title>
		<author>
			<persName><forename type="first">W</forename><surname>Bao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Yue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Rao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">PloS one</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page">e0180944</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b48">
	<analytic>
		<title level="a" type="main">Generative adversarial nets</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">J</forename><surname>Goodfellow</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Pouget-Abadie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mirza</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Warde-Farley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ozair</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">C</forename><surname>Courville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Bengio</surname></persName>
		</author>
		<ptr target="https://proceedings.neurips.cc/paper/2014/hash/5ca3e9b122f61f8f06494c97b1afccf3-Abstract.html" />
	</analytic>
	<monogr>
		<title level="m">Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014</title>
				<editor>
			<persName><forename type="first">Z</forename><surname>Ghahramani</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Welling</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Cortes</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><forename type="middle">D</forename><surname>Lawrence</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">K</forename><forename type="middle">Q</forename><surname>Weinberger</surname></persName>
		</editor>
		<meeting><address><addrLine>Montreal, Quebec, Canada</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2014">December 8-13 2014. 2014</date>
			<biblScope unit="page" from="2672" to="2680" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b49">
	<analytic>
		<title level="a" type="main">Stock market prediction on high-frequency data using generative adversarial nets</title>
		<author>
			<persName><forename type="first">X</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Pan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Zhao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Mathematical Problems in Engineering</title>
		<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b50">
	<analytic>
		<title level="a" type="main">Time-series generative adversarial networks</title>
		<author>
			<persName><forename type="first">J</forename><surname>Yoon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Jarrett</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Van Der Schaar</surname></persName>
		</author>
		<ptr target="https://proceedings.neurips.cc/paper/2019/hash/c9efe5f26cd17ba6216bbe2a7d26d490-Abstract.html" />
	</analytic>
	<monogr>
		<title level="m">Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019</title>
				<editor>
			<persName><forename type="first">H</forename><forename type="middle">M</forename><surname>Wallach</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Larochelle</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Beygelzimer</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Alché-Buc</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">E</forename><forename type="middle">B</forename><surname>Fox</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">R</forename><surname>Garnett</surname></persName>
		</editor>
		<meeting><address><addrLine>NeurIPS; Vancouver, BC, Canada</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019-12-08">2019. December 8-14, 2019. 2019</date>
			<biblScope unit="page" from="5509" to="5519" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b51">
	<analytic>
		<title level="a" type="main">Neural machine translation by jointly learning to align and translate</title>
		<author>
			<persName><forename type="first">D</forename><surname>Bahdanau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Cho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Bengio</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/1409.0473" />
	</analytic>
	<monogr>
		<title level="m">3rd International Conference on Learning Representations, ICLR 2015</title>
				<editor>
			<persName><forename type="first">Y</forename><surname>Bengio</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Y</forename><surname>Lecun</surname></persName>
		</editor>
		<meeting><address><addrLine>San Diego, CA, USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2015">May 7-9, 2015. 2015</date>
		</imprint>
	</monogr>
	<note>Conference Track Proceedings</note>
</biblStruct>

<biblStruct xml:id="b52">
	<analytic>
		<title level="a" type="main">At-lstm: An attention-based lstm model for financial time series prediction</title>
		<author>
			<persName><forename type="first">X</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Liang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Zhiyuli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Wu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IOP Conference Series: Materials Science and Engineering</title>
				<imprint>
			<publisher>IOP Publishing</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">569</biblScope>
			<biblScope unit="page">52037</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b53">
	<analytic>
		<title level="a" type="main">A dual-stage attention-based recurrent neural network for time series prediction</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Qin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">W</forename><surname>Cottrell</surname></persName>
		</author>
		<idno type="DOI">10.24963/ijcai.2017/366</idno>
		<idno>ijcai.org</idno>
		<ptr target="https://doi.org/10.24963/ijcai.2017/366.doi:10.24963/ijcai.2017/366" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017</title>
				<editor>
			<persName><forename type="first">C</forename><surname>Sierra</surname></persName>
		</editor>
		<meeting>the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017<address><addrLine>Melbourne, Australia, Au</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">gust 19-25, 2017. 2017</date>
			<biblScope unit="page" from="2627" to="2633" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b54">
	<analytic>
		<title level="a" type="main">Graph neural networks: A review of methods and applications</title>
		<author>
			<persName><forename type="first">J</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Cui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sun</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AI Open</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="57" to="81" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b55">
	<monogr>
		<author>
			<persName><forename type="first">D</forename><surname>Matsunaga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Suzumura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Takahashi</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1909.10660</idno>
		<title level="m">Exploring graph neural networks for stock market predictions with rolling window analysis</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
