# Research on Decision-Making of Complex Venture Capital Based on Financial Big Data Platform

Authors: Tao Luo
Journal: Complexity
 (2018)

---

## Abstract

The prediction of stock premium has always been a hot issue. By predicting stock premiums to provide a way for companies to respond to financial risk investments, companies can avoid investment failures. In this paper, under the financial big data platform, bootstrap resampling technology and long short-term memory (LSTM) are used to predict the value of the stock premium within 20 months. First, using the theme crawler, jsoup page parsing, Solr search, and Hadoop architecture to build a platform for financial big data. Secondly, based on the block bootstrap resampling technology, the existing data information is expanded to make full use of the existing data information. Then, based on the LSTM network, the stock premium in 20 months is predicted and compared with the values predicted by support vector machine regression (SVR), and theSSE and R-square average indicators are calculated, respectively. The calculation results show that the SSE value of LSTM is lower than SVR, and the R-square value of LSTM is higher than SVR, which means that the effect of LSTM prediction is better than SVR. Finally, based on the forecast results and evaluation indicators of the stock premium, we provide countermeasures for the company’s financial risk investment.


---

## Body

## 1. Introduction

Nowadays, investment strategies based on deep learning to analyze the future of corporate finance have become a trend [1–4]. In the historical data, a certain corresponding mode between the independent variable and the dependent variable is obtained through deep learning. The existing independent variable can be input into the pattern to predict the numerical value of the dependent variable; since the historical data has big data, the characteristics of the traditional prediction algorithm is difficult to achieve. Considering the above two reasons, we proposed a real-time forecasting model of LSTM stock premium on the financial big data platform. By predicting the value of the stock premium, it can provide a countermeasure for the company’s financial investment risk.Financial data has the characteristics of big data in time series. To perform real-time predictive analysis on financial big data, it is necessary to use the financial big data platform [5, 6]. Literature [7] based on an in-depth study of the Tmall platform web page structure uses automated testing techniques to simulate the way people browse web pages and e-commerce platform search engines, effectively avoiding the limitations of anticrawling technology. The correct data rate for batch acquisition exceeds 96%, meeting the practical requirements of scientific and industrial data analysis. Literature [8] puts forward and realizes the platform of jsoup as the basic technology, including data crawling, information extraction, and data analysis of agricultural product big data from the Internet, in view of the problem that agricultural product information circulation is difficult to maintain balance between agricultural production and market. Literature [9] uses the open-source software Solr to build a high-speed search engine to achieve efficient search for a large number of heterogeneous and unstructured medical data. And based on this, a web search and viewing system was developed. Conclusion: Solr’s search performance far exceeds that of traditional relational databases, and Solr has proven to be highly efficient. Literature [10] proposed a series of methods to optimize concurrent MapReduce. Optimize Hadoop group load modeling based on data-dependent dependencies and allocate appropriate resources for concurrent tasks. This method takes into account the negative interception of the Hadoop group for the first time for Hive/MapReduce optimization and achieves ideal results in practical experiments.The prediction of financial data has always been a hot issue [11–14]. Business organizations accumulate a large amount of historical transaction information while conducting transactions, and corporate managers expect to analyze some of the available models from these data in order to discover business opportunities. Through trend analysis, you can even find out in advance some emerging opportunities. In the financial services industry, analysts can develop targeted software that analyzes time series data to find profitable trading patterns. After further verification, the operator can use these trading patterns to make actual transactions and thus make a profit.The literature [15] used the Bayesian network to predict the average price of the NIKKEI stock and the price-earnings ratio of Toyota Motor Corporation’s stock price. The results show that the correlation accuracy and the root mean square error are better than the traditional time series prediction algorithm. Literature [16] sought to use an adaptive neurofuzzy inference system to design a model to investigate the trend of stock prices of the “Iran KHODRO” company in Tehran Stock Exchange. Three independent variables were selected, including the dependent variable of trading volume, yield, closing price, and stock price volatility as the optimal model. The results of the study show that the trend of the stock price can be predicted with a lower error level. Literature [17] proposed a hybrid prediction model that uses multiple technical indicators to predict stock price trends. By selecting the popular indicators of the correlation matrix, the cumulative probability distribution method (CPDM), the minimum entropy principle method (MEPA), the rough set theory (RST) tool set, and the genetic algorithm (GA) are used to obtain better prediction accuracy and stock gains. The validity of the proposed model was verified using a six-year TAIEX as an experimental data set. The experimental results show that the proposed model is superior to the above two prediction models (RST and GAs) in accuracy, and the stock return evaluation shows that the proposed model produces higher profits than the above two models.In this paper, we studied the issue of stock premiums, considering the complex combination of book-to-market ratio (b/m), net equity expansion (ntis), cross-sectional premium (csp), etc. Equity premium is determined by book-to-market ratio (b/m), net equity expansion (ntis), cross-sectional premium (csp), and other indicators. It can be seen that this is a very complicated risk investment decision problem. Under the financial big data platform created, we make full use of the existing information based on the block bootstrap method and use the LSTM method to predict the stock premium in real time, which provides a countermeasure for the company’s financial risk investment. LSTM-based systems can also learn to control robots, analyze images, summarize documents, recognize videos and handwriting, run chat bots, predict diseases and click rates and stock markets, compose music, and much more.


## 2. Financial Big Data Platform

### 2.1. Characteristics of Financial Big Data

In the bond market, stock prices change over time. Therefore, for other big data, it has unique characteristics. These characteristics have a great impact on the subsequent data preprocessing and LSTM real-time prediction models, so the characteristics of financial big data are briefly described [18].
(1)
Financial data is infinite. In the financial market, data is generated all the time
(2)
Financial data is time series. The generation of financial data changes with the time series, so financial data is often processed in order
(3)
Financial data is real time. Financial data is generated at each time node and the time at which the data arrives is often ordered
(4)
Financial data is unpredictable. In financial markets, the price of stocks is the result of multiple factorsAccording to the characteristics of big data, combining the characteristics of the above financial data, financial data can be called financial big data.


### 2.2. Key Technologies of Financial Big Data Platform

(1)
Theme crawler. The most basic working principle of the crawler: starting from the URL (universal resource locator) of one or several initial web pages, the URL is used as the initial node. In the process of crawling the web page, the new URL is continuously obtained from the current page until a certain stop condition of the system is satisfied. Web crawlers are divided into general crawlers and theme crawlers. The general crawler is suitable for large search engines. When you see a web page, it will be crawled. For example, Baidu’s web crawler, while the theme crawler will focus on the crawler of a certain topic. The topic crawler mentioned in this article refers to the focus on the financial field, news, and other data
(2)
jsoup web page parsing. Web page parsing refers to the process of parsing the DOM structure of a web page and obtaining web page nodes to obtain web page content. jsoup is an open-source Java-based HTML parser that directly parses a URL address and HTML text content. It can get the nodes of the document in a way similar to JQuery, which can be very convenient to parse the web page. jsoup supports reading a web page from a URL or stream and obtains the node information of the web page according to the DOM structure of the web page but generally does not use jsoup to directly read the web page from the URL because the network processing of jsoup is not powerful enough. In this article, we choose jsoup for parsing HTML pages
(3)
Solr search. Solr is an open-source project from Apache and is an enterprise search engine based on Lucene. Solr provides full-text search capabilities and supports highlighting search results and distributed indexes. Solr’s output formats are XML format and JSON format. Solr has been applied on many large websites, mature and stable, and is a search engine solution that is very suitable for big data platforms
(4)
Hadoop architecture. Hadoop is a distributed system infrastructure developed by the Apache Foundation. The significance of Hadoop is that users can distribute distributed programs without taking into account the underlying details of the distributed and make full use of the power of the cluster for high-speed computing and storage. The core part of Hadoop’s framework is HDFS and MapReduce. HDFS provides storage for massive amounts of data, and MapReduce provides calculations for massive amounts of data. HDFS can be viewed as a hierarchical file system, but its architecture is built on a specific set of distributed nodes. These nodes include a primary node, the NameNode, and several child nodes, the DataNode. Files stored in HDFS are divided into blocks, which are then copied to multiple computers (DataNodes). This is very different from the traditional RAID architecturePhysically, application centers, computing centers, data collection centers, relational data stores, and index servers are all inside a local area network. The computer in the computing center deployed a Hadoop cluster for offline distributed computing. The application center’s server provides services to the outside. The data collection center server is used for data collection, and the relational data storage server is used for relational database construction. Solr index server users build a distributed search engine. The overall network topology of the system is shown in Figure1.Figure 1
System network topology.


### 2.3. Construction of Financial Big Data Platform

The architecture of the whole platform is introduced from a holistic perspective, and then the overall structure of each part is introduced from the perspective of each part [19, 20]. The system summary design section mainly explains the design ideas and concepts from the overall perspective, as well as the architecture of the system. The big data platform is divided into six parts: computing center, data center, collection center, dispatch center, application center, and open center.The computing center includes four parts: streaming computing, distributed computing, task management, and computing module library. Stream computing refers to real-time streaming computing, which can provide real-time computing functions; distributed computing mainly refers to some distributed MapReduce calculations; task management provides management functions for managing cluster computing tasks; and the computational module library mainly encapsulates some computational algorithms that can be supplied to a variety of computational model libraries.The data center is responsible for the storage, indexing, and management of data. Data indexing refers to indexing various data collected by the collection center, including unstructured financial data, crawled web page data, and some structured data. Data storage is stored in the form of file storage and relational data storage.The collection center is responsible for the collection and integration of system data, including system integration acquisition, financial data collection, and some other data collection. System fusion acquisition refers to the integration of all structured and unstructured data of other units; financial data collection refers to the collection and processing of all financial related information; and other data collection refers to the collection of other data information, including information of personnel, etc.The dispatch center includes task management, resource scheduling, availability management, and load balancing. The open center is designed to provide data access interfaces to various organizational platforms outside the platform to support the application data sources of other organizations.The application center provides some applications based on the data platform. Currently, the applications include data collection applications, financial product topics, and research reports. The overall structure view of the big data platform is shown in Figure2.Figure 2
Overall structure view of the big data platform.


## 2.1. Characteristics of Financial Big Data

In the bond market, stock prices change over time. Therefore, for other big data, it has unique characteristics. These characteristics have a great impact on the subsequent data preprocessing and LSTM real-time prediction models, so the characteristics of financial big data are briefly described [18].
(1)
Financial data is infinite. In the financial market, data is generated all the time
(2)
Financial data is time series. The generation of financial data changes with the time series, so financial data is often processed in order
(3)
Financial data is real time. Financial data is generated at each time node and the time at which the data arrives is often ordered
(4)
Financial data is unpredictable. In financial markets, the price of stocks is the result of multiple factorsAccording to the characteristics of big data, combining the characteristics of the above financial data, financial data can be called financial big data.


## 2.2. Key Technologies of Financial Big Data Platform

(1)
Theme crawler. The most basic working principle of the crawler: starting from the URL (universal resource locator) of one or several initial web pages, the URL is used as the initial node. In the process of crawling the web page, the new URL is continuously obtained from the current page until a certain stop condition of the system is satisfied. Web crawlers are divided into general crawlers and theme crawlers. The general crawler is suitable for large search engines. When you see a web page, it will be crawled. For example, Baidu’s web crawler, while the theme crawler will focus on the crawler of a certain topic. The topic crawler mentioned in this article refers to the focus on the financial field, news, and other data
(2)
jsoup web page parsing. Web page parsing refers to the process of parsing the DOM structure of a web page and obtaining web page nodes to obtain web page content. jsoup is an open-source Java-based HTML parser that directly parses a URL address and HTML text content. It can get the nodes of the document in a way similar to JQuery, which can be very convenient to parse the web page. jsoup supports reading a web page from a URL or stream and obtains the node information of the web page according to the DOM structure of the web page but generally does not use jsoup to directly read the web page from the URL because the network processing of jsoup is not powerful enough. In this article, we choose jsoup for parsing HTML pages
(3)
Solr search. Solr is an open-source project from Apache and is an enterprise search engine based on Lucene. Solr provides full-text search capabilities and supports highlighting search results and distributed indexes. Solr’s output formats are XML format and JSON format. Solr has been applied on many large websites, mature and stable, and is a search engine solution that is very suitable for big data platforms
(4)
Hadoop architecture. Hadoop is a distributed system infrastructure developed by the Apache Foundation. The significance of Hadoop is that users can distribute distributed programs without taking into account the underlying details of the distributed and make full use of the power of the cluster for high-speed computing and storage. The core part of Hadoop’s framework is HDFS and MapReduce. HDFS provides storage for massive amounts of data, and MapReduce provides calculations for massive amounts of data. HDFS can be viewed as a hierarchical file system, but its architecture is built on a specific set of distributed nodes. These nodes include a primary node, the NameNode, and several child nodes, the DataNode. Files stored in HDFS are divided into blocks, which are then copied to multiple computers (DataNodes). This is very different from the traditional RAID architecturePhysically, application centers, computing centers, data collection centers, relational data stores, and index servers are all inside a local area network. The computer in the computing center deployed a Hadoop cluster for offline distributed computing. The application center’s server provides services to the outside. The data collection center server is used for data collection, and the relational data storage server is used for relational database construction. Solr index server users build a distributed search engine. The overall network topology of the system is shown in Figure1.Figure 1
System network topology.


## 2.3. Construction of Financial Big Data Platform

The architecture of the whole platform is introduced from a holistic perspective, and then the overall structure of each part is introduced from the perspective of each part [19, 20]. The system summary design section mainly explains the design ideas and concepts from the overall perspective, as well as the architecture of the system. The big data platform is divided into six parts: computing center, data center, collection center, dispatch center, application center, and open center.The computing center includes four parts: streaming computing, distributed computing, task management, and computing module library. Stream computing refers to real-time streaming computing, which can provide real-time computing functions; distributed computing mainly refers to some distributed MapReduce calculations; task management provides management functions for managing cluster computing tasks; and the computational module library mainly encapsulates some computational algorithms that can be supplied to a variety of computational model libraries.The data center is responsible for the storage, indexing, and management of data. Data indexing refers to indexing various data collected by the collection center, including unstructured financial data, crawled web page data, and some structured data. Data storage is stored in the form of file storage and relational data storage.The collection center is responsible for the collection and integration of system data, including system integration acquisition, financial data collection, and some other data collection. System fusion acquisition refers to the integration of all structured and unstructured data of other units; financial data collection refers to the collection and processing of all financial related information; and other data collection refers to the collection of other data information, including information of personnel, etc.The dispatch center includes task management, resource scheduling, availability management, and load balancing. The open center is designed to provide data access interfaces to various organizational platforms outside the platform to support the application data sources of other organizations.The application center provides some applications based on the data platform. Currently, the applications include data collection applications, financial product topics, and research reports. The overall structure view of the big data platform is shown in Figure2.Figure 2
Overall structure view of the big data platform.


## 3. Data and Preprocessing

### 3.1. Data Acquisition and Structure Analysis

We obtained a monthly equity premium for a company between 1947 and 2015, as well as a book-to-market ratio (b/m), a net equity expansion (ntis), cross-sectional premium (csp), and other independent variable data. Figure3 is a three-dimensional view of the independent variables in the experimental data, which is drawn by MATLAB. Interpolation is used in the process of drawing to fit the discrete data [21]. In Figure 3, x and y are equally divided into 50 equal parts.Figure 3
The 3D view of the independent variables in the experimental data.It can be seen from Figure3 that there is a large fluctuation in the magnitude of the independent variable. Therefore, the data needs to be normalized when inputting training data. The standardization of data is to scale the data to fit into a small specific interval. In the paper, we normalize the data using min–max normalization based on the characteristics of the data. Normalization needs to be after block bootstrap operations. The first normalization is for the convenience of subsequent data processing, and the second is to ensure that the program runs faster when it converges. The processed data can reduce the training efficiency of the LSTM and reduce the time spent on training.Here, we need to predict the stock premium in December. Stock premium means that the issue price of a stock is higher than the face value of the stock, also known as stock premium issue. The issue premium of the stock represents the market’s expectation of the stock and is a representative indicator of the company’s development. By predicting the value of the stock premium, the company will provide corresponding countermeasures for the company’s financial risk investment, thus helping the company to make a profit. Figure4 is a schematic diagram of the 20-day equity premium that needs to be predicted.Figure 4
Schematic diagram of the equity premium that needs to be predicted.


### 3.2. Bootstrap Repeated Sampling

The bootstrap method is a statistical inference method that relies on only given observation information, without the need for other assumptions and the addition of new observations, by the American technologist Eflon [22, 23]. Bootstrap can use a small number of samples to simulate large samples for statistical estimation. It is based on the original data-based simulation sampling statistical inference method; the sample capacity is expanded by repeated sampling, so as to obtain the empirical distribution of the sample sequence statistics. It can be used to study a certain statistical distribution of a set of data, especially for interval estimates and hypothesis tests that are difficult to obtain parameters by conventional methods.The basic principle of the bootstrap method is to consider a random sample sequence of lengthn from a completely undefined distribution P. Among them, Xi is the independent random sampling of the distribution, which is the basic requirement of the bootstrap method. The bootstrap process consists of the following steps:
(1)
Letti denote the value of a particular sample statistic T. Extracting B random replacement samples with sample size n from the sample field, denoted by Si (subscript i denotes the ith resampling)
(2)
LetSi∗=X1∗,X2∗,…,Xi∗ denote a simple random sample taken from the guide, which is a bootstrap sample
(3)
For each subsampleSi∗, calculate its T value, denoted by t1,t2,…,ti, respectively. The distribution of this T value is called the bootstrap empirical distributionIfB is large enough, an approximation is provided for all possible values of the statistic T by repeating the sampling therefrom. In this way, the small sample can be statistically simulated by the bootstrap method, and the statistical estimation of the known distribution and the known parameters can be obtained. The bootstrap implementation process is shown in Figure 5.Figure 5
Bootstrap algorithm flow.


### 3.3. Data Preprocessing Based on Block Bootstrap

In many cases, statistical data cannot satisfy the nature of independent and identical distribution, but there are certain dependent structures, such as time series data. In this case, if you continue to apply independent and identically distributed bootstrap, it is likely to cause failure [24].Because there is a dependency within the data, bootstrap cannot be performed on a single data point; otherwise, the dependent structure is completely destroyed. Then, in resampling, it must be ensured that the data of a whole “block” is extracted in the same unit, which is the origin of the “block.” Here is a brief introduction to the bootstrap method of block structure [25, 26].
(1)
First, then data points are split into N blocks according to their order, and each block has a data length of l, that is, Bi=X1,…,Xi,…,Bi=XN,…,Xn, among them N=n−l+1
(2)
After the data is split, the resampled object becomes theN data blocks. For example, n/1 data blocks are extracted from them, and the resampled data with the sample size still can be formed by splicing together, supposing l can be divided into n blocks. For resampled data, the method described in Section 3.2 can still be used to calculate the corresponding estimated value and approximate statistical distributionIn order to clearly illustrate the operation of the block bootstrap, blocked bootstrap operations were performed on 0.07, 0.18, 0, 33, 049, 067, 071, 0.8, 1.01, 0.93, 09, 101, 099, 088, 082, 078, 063, 044, 026, 018, and 011. Figure5 is a diagram of the results of the bootstrap operation.It can be seen from the point in Figure6 that such a batch of data has a certain internal structure, the data with a small sample number has an upward trend, and the data with a large serial number has a downward trend. If you use independent and identically distributed bootstrap, this dependency structure will be masked. The data blocks extracted in the figure overlap: the 5th, 6th, and 11th blocks are drawn, and the 5th block is drawn twice (not directly visible on the figure).Figure 6
Bootstrap operation process diagram.


## 3.1. Data Acquisition and Structure Analysis

We obtained a monthly equity premium for a company between 1947 and 2015, as well as a book-to-market ratio (b/m), a net equity expansion (ntis), cross-sectional premium (csp), and other independent variable data. Figure3 is a three-dimensional view of the independent variables in the experimental data, which is drawn by MATLAB. Interpolation is used in the process of drawing to fit the discrete data [21]. In Figure 3, x and y are equally divided into 50 equal parts.Figure 3
The 3D view of the independent variables in the experimental data.It can be seen from Figure3 that there is a large fluctuation in the magnitude of the independent variable. Therefore, the data needs to be normalized when inputting training data. The standardization of data is to scale the data to fit into a small specific interval. In the paper, we normalize the data using min–max normalization based on the characteristics of the data. Normalization needs to be after block bootstrap operations. The first normalization is for the convenience of subsequent data processing, and the second is to ensure that the program runs faster when it converges. The processed data can reduce the training efficiency of the LSTM and reduce the time spent on training.Here, we need to predict the stock premium in December. Stock premium means that the issue price of a stock is higher than the face value of the stock, also known as stock premium issue. The issue premium of the stock represents the market’s expectation of the stock and is a representative indicator of the company’s development. By predicting the value of the stock premium, the company will provide corresponding countermeasures for the company’s financial risk investment, thus helping the company to make a profit. Figure4 is a schematic diagram of the 20-day equity premium that needs to be predicted.Figure 4
Schematic diagram of the equity premium that needs to be predicted.


## 3.2. Bootstrap Repeated Sampling

The bootstrap method is a statistical inference method that relies on only given observation information, without the need for other assumptions and the addition of new observations, by the American technologist Eflon [22, 23]. Bootstrap can use a small number of samples to simulate large samples for statistical estimation. It is based on the original data-based simulation sampling statistical inference method; the sample capacity is expanded by repeated sampling, so as to obtain the empirical distribution of the sample sequence statistics. It can be used to study a certain statistical distribution of a set of data, especially for interval estimates and hypothesis tests that are difficult to obtain parameters by conventional methods.The basic principle of the bootstrap method is to consider a random sample sequence of lengthn from a completely undefined distribution P. Among them, Xi is the independent random sampling of the distribution, which is the basic requirement of the bootstrap method. The bootstrap process consists of the following steps:
(1)
Letti denote the value of a particular sample statistic T. Extracting B random replacement samples with sample size n from the sample field, denoted by Si (subscript i denotes the ith resampling)
(2)
LetSi∗=X1∗,X2∗,…,Xi∗ denote a simple random sample taken from the guide, which is a bootstrap sample
(3)
For each subsampleSi∗, calculate its T value, denoted by t1,t2,…,ti, respectively. The distribution of this T value is called the bootstrap empirical distributionIfB is large enough, an approximation is provided for all possible values of the statistic T by repeating the sampling therefrom. In this way, the small sample can be statistically simulated by the bootstrap method, and the statistical estimation of the known distribution and the known parameters can be obtained. The bootstrap implementation process is shown in Figure 5.Figure 5
Bootstrap algorithm flow.


## 3.3. Data Preprocessing Based on Block Bootstrap

In many cases, statistical data cannot satisfy the nature of independent and identical distribution, but there are certain dependent structures, such as time series data. In this case, if you continue to apply independent and identically distributed bootstrap, it is likely to cause failure [24].Because there is a dependency within the data, bootstrap cannot be performed on a single data point; otherwise, the dependent structure is completely destroyed. Then, in resampling, it must be ensured that the data of a whole “block” is extracted in the same unit, which is the origin of the “block.” Here is a brief introduction to the bootstrap method of block structure [25, 26].
(1)
First, then data points are split into N blocks according to their order, and each block has a data length of l, that is, Bi=X1,…,Xi,…,Bi=XN,…,Xn, among them N=n−l+1
(2)
After the data is split, the resampled object becomes theN data blocks. For example, n/1 data blocks are extracted from them, and the resampled data with the sample size still can be formed by splicing together, supposing l can be divided into n blocks. For resampled data, the method described in Section 3.2 can still be used to calculate the corresponding estimated value and approximate statistical distributionIn order to clearly illustrate the operation of the block bootstrap, blocked bootstrap operations were performed on 0.07, 0.18, 0, 33, 049, 067, 071, 0.8, 1.01, 0.93, 09, 101, 099, 088, 082, 078, 063, 044, 026, 018, and 011. Figure5 is a diagram of the results of the bootstrap operation.It can be seen from the point in Figure6 that such a batch of data has a certain internal structure, the data with a small sample number has an upward trend, and the data with a large serial number has a downward trend. If you use independent and identically distributed bootstrap, this dependency structure will be masked. The data blocks extracted in the figure overlap: the 5th, 6th, and 11th blocks are drawn, and the 5th block is drawn twice (not directly visible on the figure).Figure 6
Bootstrap operation process diagram.


## 4. Research on Real-Time Forecasting Model of Equity Premium Based on LSTM

### 4.1. LSTM Internal Structure

Recurrent neural networks (RNN) are a very powerful computational model that can simulate almost any dynamic structure. However, gradient-based methods have important limitations. The magnitude of the error signal propagating in time depends on the amount of weight. Therefore, in the case where the hysteresis between input and output is greater than 5–10 discrete time steps, the standard RNN cannot be learned. This raises questions about whether standard RNNs have a significant advantage over time-window-based feedforward networks [27, 28]. Figure 7 is a schematic diagram of the gradient disappearance problem of RNN.Figure 7
The vanishing gradient problem for RNNs.In the opposite direction of time,1 explains why the gradient of the RNN will disappear.
(1)δkT=∂E∂netk=∂E∂nett∂nett∂netk=∂E∂nett∂nett∂nett−1∂nett−1∂nett−2⋯∂netk+1∂netk=Wdiagf′nett−1Wdiagf′nett−2⋯Wdiagf′netkδtl=δtT∏i=kt−1Wdiagf′neti.The shading in Figure7 indicates their sensitivity to the input at the first moment (the darker the shadow, the greater the sensitivity). As the new input hidden layer is activated, the network will gradually “forget” the first input, and the sensitivity will decay over time.For general sequence modeling, LSTM has proven to be a special RNN structure in previous studies: stability and robustness for modeling remote dependencies. The main innovation of LSTM is memory blocks, which basically act as accumulators of state information. Each memory block contains one or more self-connected memory cells and three multiplying cells, an input gate, an output gate, and a forgetting gate, which primarily provide continuous write, read, and reset operations for the cell. The unit is accessed, written, and cleared by several self-parameterized control gates. Whenever there is a new input, if the input gate is activated, its information will be accumulated into the cell. In addition, if the forgotten gate is opened, the past unit state may be “forgotten” in the process. Otherwise, the latest unit output will propagate to the final state and be further controlled by the output gate. One advantage of using memory cells and gates to control the flow of information is that the gradient will be captured in the cell and prevented from disappearing too quickly, which is an important innovation for the RNN model [29, 30]. Figure 8 is an internal structure of a memory block.Figure 8
Internal structure of the memory block.The three gates are nonlinear summation units that are activated from inside and outside the block and control the activation of the unit by multiplication (small black circles). The input and output gates multiply the input and output of the unit, while forgetting the gate is multiplied by the previous state of the unit. There is no activation function applied in the cell. The gate activation function is typically a logical S shape, so gate activation is selected between 0 and 1. The unit input and output activation functions are usually tanh or logistic sigmoid. All other connections within the block are unweighted, and the only output from the block to the rest of the network comes from the output gate multiplication.As previously mentioned,Wi,j is the weight of the connection from unit i to unit j, the network input to unit j at time t is represented by ajt, and the activation of unit j at time t is bjt. In a neural network, forward propagation is generally performed to output the results of the model and to determine whether the results are satisfactory. Backward propagation can find the partial derivative of the error of the weight in the neural network, thereby adjusting the weight.The LSTM equation is only given for a single memory block. For multiple blocks, you only have to repeat the calculations for each block in any order. The subscriptt,φ,ω refers to the input gate, the forgetting gate, and the output gate of the block, respectively. The subscript c refers to one of the C memory units. The weights from unit c to input, forgetting, and output gates are represented as Wc,t, Wc,φ, and Wc,ω, respectively. Sct is the state of the unit c at time t. f is the activation function of the gate and g and h are the unit input and output activation functions, respectively.LetI be the number of inputs, K be the number of outputs, and H be the number of cells in the hidden layer. We use the index h to refer to the unit output of other blocks in the hidden layer, exactly the same as the standard hidden unit. As with the standard RNN, the forward pass of the length T input sequence x is calculated starting from t=1, and the update equation is applied recursively as the t is incremented. The order in which the equations are calculated during forward and backward passes is important and should be performed as follows. As with standard RNN, all states and activations are initialized to zero at t=0, and all δ terms are zero at t=T+1.The final weight derivative is obtained by summing the derivatives of each time step, whereL is the loss function for training.
(2)δjt=def∂ℓ∂ajt.When passing forward, the mathematical expression of each structure inside the memory block:(3)Inputgate:ait=∑i=1Iwilxit+∑h=1Hwhlbht−1+∑c=1Cwitsct−1,bit=fait.(4)Forgottendoor:aϕt=∑i=1Iwiϕxit+∑h=1Hwhϕbht−1+∑c=1Cwiϕsct−1,bϕt=faϕt.(5)Cell:act=∑i=1Iwicxit+∑i=1Iwhcbht−1,sct=bϕtsct−1+bitgact.(6)Outputgate:awt=∑i=1Iwiwxit+∑h=1Hwhwbht−1+∑c=1Cwiwsct−1,bwt=fawt.(7)Celloutput:bct=bwthsct.Mathematical expression of each structure inside the memory block when passing backwards:(8)δct=def∂ℓ∂bct,δst=def∂ℓ∂sct.(9)Celloutput:εct=∑k=1Kwckδkt+∑h=1Hwchδht+1.(10)Outputgate:δwt=f′awt∑c=1Chsctεct.(11)Status:εst=bwth′sctεct+bϕt+1εct+1+wclδlt+1+wcϕδϕt+1+wcwδwt.(12)Cell:δct=bltg′actεst.(13)Forgottendoor:δϕt=f′aϕt∑c=1Csact−1εst.(14)Inputgate:δlt=f′alt∑c=1Cgactεst.


### 4.2. LSTM Overall Design

Based on the aforementioned test data characteristics and the theory of LSTM, we designed the network structure required in this paper. For clarity, we analyze the two-layer forward network. Figure9 is a schematic diagram of a two-layer network LSTM structure.Figure 9
Schematic diagram of two-layer network LSTM structure.In this figure, we can see that the input values are transmitted through the input gates to the gate, input and output activation ribbons in the first layer network. After the arithmetic processing of the memory block, the values are output to the gate, input and output activation functional areas of the first and second layers. At the same time, we also observe that the initial input value is output to the second level of the gate, input and output activation ribbons. Finally, the output values of the first and second layers are output to the network. A network larger than two layers can be modeled on a two-layer network. Since the number of arguments in this paper is 20 and there is only one output variable,n in Figure 9 is 20.


## 4.1. LSTM Internal Structure

Recurrent neural networks (RNN) are a very powerful computational model that can simulate almost any dynamic structure. However, gradient-based methods have important limitations. The magnitude of the error signal propagating in time depends on the amount of weight. Therefore, in the case where the hysteresis between input and output is greater than 5–10 discrete time steps, the standard RNN cannot be learned. This raises questions about whether standard RNNs have a significant advantage over time-window-based feedforward networks [27, 28]. Figure 7 is a schematic diagram of the gradient disappearance problem of RNN.Figure 7
The vanishing gradient problem for RNNs.In the opposite direction of time,1 explains why the gradient of the RNN will disappear.
(1)δkT=∂E∂netk=∂E∂nett∂nett∂netk=∂E∂nett∂nett∂nett−1∂nett−1∂nett−2⋯∂netk+1∂netk=Wdiagf′nett−1Wdiagf′nett−2⋯Wdiagf′netkδtl=δtT∏i=kt−1Wdiagf′neti.The shading in Figure7 indicates their sensitivity to the input at the first moment (the darker the shadow, the greater the sensitivity). As the new input hidden layer is activated, the network will gradually “forget” the first input, and the sensitivity will decay over time.For general sequence modeling, LSTM has proven to be a special RNN structure in previous studies: stability and robustness for modeling remote dependencies. The main innovation of LSTM is memory blocks, which basically act as accumulators of state information. Each memory block contains one or more self-connected memory cells and three multiplying cells, an input gate, an output gate, and a forgetting gate, which primarily provide continuous write, read, and reset operations for the cell. The unit is accessed, written, and cleared by several self-parameterized control gates. Whenever there is a new input, if the input gate is activated, its information will be accumulated into the cell. In addition, if the forgotten gate is opened, the past unit state may be “forgotten” in the process. Otherwise, the latest unit output will propagate to the final state and be further controlled by the output gate. One advantage of using memory cells and gates to control the flow of information is that the gradient will be captured in the cell and prevented from disappearing too quickly, which is an important innovation for the RNN model [29, 30]. Figure 8 is an internal structure of a memory block.Figure 8
Internal structure of the memory block.The three gates are nonlinear summation units that are activated from inside and outside the block and control the activation of the unit by multiplication (small black circles). The input and output gates multiply the input and output of the unit, while forgetting the gate is multiplied by the previous state of the unit. There is no activation function applied in the cell. The gate activation function is typically a logical S shape, so gate activation is selected between 0 and 1. The unit input and output activation functions are usually tanh or logistic sigmoid. All other connections within the block are unweighted, and the only output from the block to the rest of the network comes from the output gate multiplication.As previously mentioned,Wi,j is the weight of the connection from unit i to unit j, the network input to unit j at time t is represented by ajt, and the activation of unit j at time t is bjt. In a neural network, forward propagation is generally performed to output the results of the model and to determine whether the results are satisfactory. Backward propagation can find the partial derivative of the error of the weight in the neural network, thereby adjusting the weight.The LSTM equation is only given for a single memory block. For multiple blocks, you only have to repeat the calculations for each block in any order. The subscriptt,φ,ω refers to the input gate, the forgetting gate, and the output gate of the block, respectively. The subscript c refers to one of the C memory units. The weights from unit c to input, forgetting, and output gates are represented as Wc,t, Wc,φ, and Wc,ω, respectively. Sct is the state of the unit c at time t. f is the activation function of the gate and g and h are the unit input and output activation functions, respectively.LetI be the number of inputs, K be the number of outputs, and H be the number of cells in the hidden layer. We use the index h to refer to the unit output of other blocks in the hidden layer, exactly the same as the standard hidden unit. As with the standard RNN, the forward pass of the length T input sequence x is calculated starting from t=1, and the update equation is applied recursively as the t is incremented. The order in which the equations are calculated during forward and backward passes is important and should be performed as follows. As with standard RNN, all states and activations are initialized to zero at t=0, and all δ terms are zero at t=T+1.The final weight derivative is obtained by summing the derivatives of each time step, whereL is the loss function for training.
(2)δjt=def∂ℓ∂ajt.When passing forward, the mathematical expression of each structure inside the memory block:(3)Inputgate:ait=∑i=1Iwilxit+∑h=1Hwhlbht−1+∑c=1Cwitsct−1,bit=fait.(4)Forgottendoor:aϕt=∑i=1Iwiϕxit+∑h=1Hwhϕbht−1+∑c=1Cwiϕsct−1,bϕt=faϕt.(5)Cell:act=∑i=1Iwicxit+∑i=1Iwhcbht−1,sct=bϕtsct−1+bitgact.(6)Outputgate:awt=∑i=1Iwiwxit+∑h=1Hwhwbht−1+∑c=1Cwiwsct−1,bwt=fawt.(7)Celloutput:bct=bwthsct.Mathematical expression of each structure inside the memory block when passing backwards:(8)δct=def∂ℓ∂bct,δst=def∂ℓ∂sct.(9)Celloutput:εct=∑k=1Kwckδkt+∑h=1Hwchδht+1.(10)Outputgate:δwt=f′awt∑c=1Chsctεct.(11)Status:εst=bwth′sctεct+bϕt+1εct+1+wclδlt+1+wcϕδϕt+1+wcwδwt.(12)Cell:δct=bltg′actεst.(13)Forgottendoor:δϕt=f′aϕt∑c=1Csact−1εst.(14)Inputgate:δlt=f′alt∑c=1Cgactεst.


## 4.2. LSTM Overall Design

Based on the aforementioned test data characteristics and the theory of LSTM, we designed the network structure required in this paper. For clarity, we analyze the two-layer forward network. Figure9 is a schematic diagram of a two-layer network LSTM structure.Figure 9
Schematic diagram of two-layer network LSTM structure.In this figure, we can see that the input values are transmitted through the input gates to the gate, input and output activation ribbons in the first layer network. After the arithmetic processing of the memory block, the values are output to the gate, input and output activation functional areas of the first and second layers. At the same time, we also observe that the initial input value is output to the second level of the gate, input and output activation ribbons. Finally, the output values of the first and second layers are output to the network. A network larger than two layers can be modeled on a two-layer network. Since the number of arguments in this paper is 20 and there is only one output variable,n in Figure 9 is 20.


## 5. Result Analysis and Investment Strategies

### 5.1. Analysis and Evaluation of Prediction Results

Based on the above analysis, we designed a 50-layer network structure with a step size of 10, an activation function of tanh, a loss function of mse, and a number of learning samples of seven. In order to improve the efficiency of learning, we sacrificed memory to speed up the learning, that is, set batch_size = 72. The values of the various parameters are set as follows: neuralNums = 50, timeStep = 10, dropout = 0.1, loss = “mse,” optimizer = “adam,” activation = “tanh,” output_dim = 1, epochs = 7, and batch_size = 72. Using the grid search method, when neuralNums = 50, epochs = 7, and dropout = 0.1, the prediction effect of LSTM is optimal. In the LSTM network structure, the first layer does not use the activation function, and the other network layer uses the tanh function as the activation function. In this paper, we also use support vector machine regression (SVR) [31–34] and LSTM to predict the stock premium. Figure 10 is a comparison of the SVR and LSTM prediction results.Figure 10
Comparison of SVR and LSTM prediction results.We use the monthly independent variables and stock premiums from 1947 to 2005 as input samples and put them into the LSTM network for learning. Then, we input the 20-month independent variable into the trained model and get the value of the predicted stock premium. By analyzing Figure9, it can be seen that, overall, the prediction effect of LSTM is better than that of SVR, and it is stable. In order to more clearly describe the error between the predicted and actual values, we plot the error maps predicted by the two methods, as shown in Figure 11.Figure 11
Comparison of prediction errors between SVR and LSTM.RNN does not have long-term and short-term memory characteristics, which has been demonstrated in the existing literature. Therefore, RNN is not applicable for comparison in this paper. As can be seen from Figure11, the absolute value of the prediction error of the LSTM is smaller than the absolute value of the error predicted by the SVR, that is, its accuracy is high, which also explains the stability of the prediction from the side. In the actual forecast, we predict multiple time nodes in the future instead of one time node in the future. Because predicting multiple time nodes can see a trend in the future, this is more sensible than predicting a time node. Therefore, the number of time steps set in this paper is 10. In order to better evaluate the pros and cons of the prediction, we calculated the size of the SSE, that is, the sum of the squares of the errors of the predicted data and the corresponding points of the original data. The closer the SSE is to 0, the better the model selection and fit, and the more successful the data prediction. The SSE is defined as follows:
(15)SSE=∑i=1nyi−y^i2.At the same time, the size of the R-square is also calculated, that is, the sum of the squares of the prediction data and the mean difference. It can be seen from the above expression that the normal range of the R-square is [0 1], and the closer to 1, the stronger the explanatory power of the model. Its definition is as follows:(16)SST=∑i=1nyi=y¯i2,(17)R‐square=1−SSESST.The calculation results of the evaluation indicators are shown in Table1.Table 1
Evaluation index calculation result.
SSE
R-square
LSTM
0.024804
0.953882
SVR
0.075421
0.889393It can be seen from Table1 that the SSE value of the LSTM prediction result is smaller than the SSE value of the LSTM prediction result in the SSE evaluation index, indicating that the LSTM prediction effect is better than the SVR; it is also known that the LSTM prediction is in the R-square evaluation index. The R-square value of the result is larger than the R-square value of the LSTM prediction result, indicating that the LSTM prediction is better than the SVR. As we all know, the LSTM algorithm has many parameters to determine. In theory, particle swarm optimization algorithm and ant colony algorithm can be used to automatically find the optimal parameters. However, if the particle swarm algorithm is used, although the optimal parameters can be found automatically, the parameters of the particle swarm optimization algorithm need to be adjusted. This makes the results of the algorithm more uncontrollable. In the future, we can improve the performance of LSTM by using a new activation function, enhancing the link of cell to each gate.


### 5.2. Risk Investment Advice

It can be seen from the analysis of the results that the prediction effect of LSTM can be better than that of SVR. Based on this, we can design an operating software based on LSTM stock premium real-time forecasting under the financial big data platform. On the other hand, we can advise financial investments based on indicators. When both SSE and R-square are smaller than a certain reference value, we need to sell the stock; when both SSE and R-square are greater than a certain reference value, we can continue to buy the company’s stock; when any indicator is less than a certain reference value, we do not need to buy or sell. The reference value can be determined based on the analysis of historical data and the corresponding decision. Determine whether you need to hold a share or sell off by predicting the value and the size of the evaluation indicator. To improve the stability of the forecast, we can get more credible results by increasing the month of the predicted stock premium.


## 5.1. Analysis and Evaluation of Prediction Results

Based on the above analysis, we designed a 50-layer network structure with a step size of 10, an activation function of tanh, a loss function of mse, and a number of learning samples of seven. In order to improve the efficiency of learning, we sacrificed memory to speed up the learning, that is, set batch_size = 72. The values of the various parameters are set as follows: neuralNums = 50, timeStep = 10, dropout = 0.1, loss = “mse,” optimizer = “adam,” activation = “tanh,” output_dim = 1, epochs = 7, and batch_size = 72. Using the grid search method, when neuralNums = 50, epochs = 7, and dropout = 0.1, the prediction effect of LSTM is optimal. In the LSTM network structure, the first layer does not use the activation function, and the other network layer uses the tanh function as the activation function. In this paper, we also use support vector machine regression (SVR) [31–34] and LSTM to predict the stock premium. Figure 10 is a comparison of the SVR and LSTM prediction results.Figure 10
Comparison of SVR and LSTM prediction results.We use the monthly independent variables and stock premiums from 1947 to 2005 as input samples and put them into the LSTM network for learning. Then, we input the 20-month independent variable into the trained model and get the value of the predicted stock premium. By analyzing Figure9, it can be seen that, overall, the prediction effect of LSTM is better than that of SVR, and it is stable. In order to more clearly describe the error between the predicted and actual values, we plot the error maps predicted by the two methods, as shown in Figure 11.Figure 11
Comparison of prediction errors between SVR and LSTM.RNN does not have long-term and short-term memory characteristics, which has been demonstrated in the existing literature. Therefore, RNN is not applicable for comparison in this paper. As can be seen from Figure11, the absolute value of the prediction error of the LSTM is smaller than the absolute value of the error predicted by the SVR, that is, its accuracy is high, which also explains the stability of the prediction from the side. In the actual forecast, we predict multiple time nodes in the future instead of one time node in the future. Because predicting multiple time nodes can see a trend in the future, this is more sensible than predicting a time node. Therefore, the number of time steps set in this paper is 10. In order to better evaluate the pros and cons of the prediction, we calculated the size of the SSE, that is, the sum of the squares of the errors of the predicted data and the corresponding points of the original data. The closer the SSE is to 0, the better the model selection and fit, and the more successful the data prediction. The SSE is defined as follows:
(15)SSE=∑i=1nyi−y^i2.At the same time, the size of the R-square is also calculated, that is, the sum of the squares of the prediction data and the mean difference. It can be seen from the above expression that the normal range of the R-square is [0 1], and the closer to 1, the stronger the explanatory power of the model. Its definition is as follows:(16)SST=∑i=1nyi=y¯i2,(17)R‐square=1−SSESST.The calculation results of the evaluation indicators are shown in Table1.Table 1
Evaluation index calculation result.
SSE
R-square
LSTM
0.024804
0.953882
SVR
0.075421
0.889393It can be seen from Table1 that the SSE value of the LSTM prediction result is smaller than the SSE value of the LSTM prediction result in the SSE evaluation index, indicating that the LSTM prediction effect is better than the SVR; it is also known that the LSTM prediction is in the R-square evaluation index. The R-square value of the result is larger than the R-square value of the LSTM prediction result, indicating that the LSTM prediction is better than the SVR. As we all know, the LSTM algorithm has many parameters to determine. In theory, particle swarm optimization algorithm and ant colony algorithm can be used to automatically find the optimal parameters. However, if the particle swarm algorithm is used, although the optimal parameters can be found automatically, the parameters of the particle swarm optimization algorithm need to be adjusted. This makes the results of the algorithm more uncontrollable. In the future, we can improve the performance of LSTM by using a new activation function, enhancing the link of cell to each gate.


## 5.2. Risk Investment Advice

It can be seen from the analysis of the results that the prediction effect of LSTM can be better than that of SVR. Based on this, we can design an operating software based on LSTM stock premium real-time forecasting under the financial big data platform. On the other hand, we can advise financial investments based on indicators. When both SSE and R-square are smaller than a certain reference value, we need to sell the stock; when both SSE and R-square are greater than a certain reference value, we can continue to buy the company’s stock; when any indicator is less than a certain reference value, we do not need to buy or sell. The reference value can be determined based on the analysis of historical data and the corresponding decision. Determine whether you need to hold a share or sell off by predicting the value and the size of the evaluation indicator. To improve the stability of the forecast, we can get more credible results by increasing the month of the predicted stock premium.


## 6. Conclusion

First, using the crawler technology, jsoup page analysis technology, Solr search technology, and Hadoop architecture to build a platform for financial big data. Then, based on the block bootstrap resampling technique, the existing data information is utilized to the maximum extent. Finally, based on the LSTM network, the stock premium in 20 months is predicted and compared with the values predicted by support vector machine regression (SVR), and the respectiveSSE and R-square average indicators are calculated. The calculation results show that the SSE value of LSTM is 0.024804, and the SSE value of SVR is 0.075421; the R-square value of LSTM is 0.953882, and the R-square value of SVR is 0.889393, which means that the effect of LSTM prediction is better than SVR.



---

*Source: 5170281-2018-12-02.xml*