<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurorobot.</journal-id>
<journal-title>Frontiers in Neurorobotics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurorobot.</abbrev-journal-title>
<issn pub-type="epub">1662-5218</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnbot.2021.661037</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A New Way of Airline Traffic Prediction Based on GCN-LSTM</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Yu</surname> <given-names>Jiangni</given-names></name>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1217190/overview"/>
</contrib>
</contrib-group>
<aff><institution>School of Economics and Management, Beijing University of Posts and Telecommunications</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Xin Luo, Chongqing Institute of Green and Intelligent Technology (CAS), China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Long Wang, University of Science and Technology Beijing, China; Chao Huang, University of Macau, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Jiangni Yu <email>yu-jiangni&#x00040;163.com</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>10</day>
<month>12</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>15</volume>
<elocation-id>661037</elocation-id>
<history>
<date date-type="received">
<day>30</day>
<month>01</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>11</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2021 Yu.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Yu</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license> </permissions>
<abstract><p>With the development of society and the improvement of people&#x00027;s material level, more and more people like to travel by airplane. If we can predict the passenger flow of an airline in advance, it can be used as an important decision-making basis for its flight route planning, crew scheduling planning and ticket price formulation in the process of management and operation. However, due to the high complexity of aviation network, the existing traffic prediction methods generally have the problem of low prediction accuracy. In order to overcome this problem, this paper makes full use of graph convolutional neural network and long&#x02014;short memory network to construct a prediction system with short&#x02014;term prediction ability. Specifically, this paper uses the graph convolutional neural network as a feature extraction tool to extract the key features of air traffic data, and solves the problem of long term and short term dependence between data through the long term memory network, then we build a high-precision air traffic prediction system based on it. Finally, we design a comparison experiment to compare the algorithm with the traditional algorithms. The results show that the algorithm we proposed in this paper has a higher accuracy in air flow prediction according to the lower loss function value.</p></abstract>
<kwd-group>
<kwd>graph convolutional network</kwd>
<kwd>long short term memory network</kwd>
<kwd>flow</kwd>
<kwd>airlines</kwd>
<kwd>predict</kwd>
</kwd-group>
<counts>
<fig-count count="5"/>
<table-count count="2"/>
<equation-count count="12"/>
<ref-count count="24"/>
<page-count count="8"/>
<word-count count="4778"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>In recent years, as an important industry in national economic and social development and an advanced mode of transportation, the demand for civil aviation passenger transport has been growing rapidly along with the rapid development of national economy and the substantial increase of people&#x00027;s income. Air fare has always been the focus of attention because it is related to the development of civil aviation industry, the profitability of airlines and the vital interests of passengers. Pricing strategies of airlines are mostly based on revenue management theory (Donovan, <xref ref-type="bibr" rid="B5">2005</xref>; Klein et al., <xref ref-type="bibr" rid="B10">2020</xref>), in which air traffic forecasting plays an important role. The forecast results can be used to dynamically adjust the ticket prices, so that the airlines can get the maximum benefits (Diego and Sang-Yeob, <xref ref-type="bibr" rid="B4">2012</xref>). However, the pricing mechanism of each airline is complex, and the real-time ticket price is constantly changing under the influence of many factors, which has the characteristics of trend, randomness and volatility. Therefore, how to forecast air passenger flow accurately and reasonably has become an important content of air transport management in China.</p>
<p>Air passenger flow prediction has been studied at home and abroad. In Etzioni et al. (<xref ref-type="bibr" rid="B6">2003</xref>), an ensemble learning binary classification algorithm by Hamlet, is proposed based on Q-learning. Hamlet applies rule learning, reinforcement learning and time series techniques, and combines their results through superposition generalization to produce the final decision. The accuracy can reach 74.5%. There is still much room for improvement in traffic prediction. Riedel and Gabrys (<xref ref-type="bibr" rid="B16">2003</xref>) used autoregressive model (AR) to realize the prediction of air traffic. An AR is the regression of a variable relative to itself, using past observations to make predictions about current values. Moving average model (MA) is a regression model based on past forecasting errors. Sickles et al. (<xref ref-type="bibr" rid="B17">1998</xref>) proposed a model ARMA that combines autoregressive model and moving average model. ARIMA (autoregressive integrated moving average) (Li et al., <xref ref-type="bibr" rid="B13">2018</xref>) and Bayesian structured time series Bayesian structured time series (BSTS) model (Kulkarni et al., <xref ref-type="bibr" rid="B11">2018</xref>; Madhavan et al., <xref ref-type="bibr" rid="B15">2020</xref>) are used to forecast the air passenger and cargo demand of the Indian aviation industry. Wang et al. (<xref ref-type="bibr" rid="B19">2013</xref>) used gray scale model to forecast passenger flow, applied a function to the observation data set, converted it into a monotonically increasing data set, and obtained the forecast results. Carmona-Ben&#x000ED;tez and Nieto (<xref ref-type="bibr" rid="B2">2020</xref>) proposed a new damping trend gray model (DTSM) based on dynamic seasonal damping factor, which is used to predict airline passenger demand (PAX) in the air transport industry. This model is called Sarima Damped Trend Gray Prediction Model (SDTGM), which can effectively improve the accuracy of prediction.</p>
<p>The classical time series model is based on the assumption that there is a linear relationship between the past and the future value, but the time series model to predict the traffic demand data must have correlation, because the passenger flow is affected by various factors change, trend and randomness and volatility characteristics, which will also affect the forecast of air flow. Causal models attempt to establish an explanatory equation that adequately describes the observation as the output of one or more underlying causative factors. Liu and Li (<xref ref-type="bibr" rid="B14">2012</xref>) proposed to use the probability logarithmic model to predict passenger flow, establish factors that can explain past demands, and then use the model to provide predicted values. Logit models, such as multinomial models, nested models and cross-nested models, are widely used in demand prediction of passenger selection models Leng et al. (<xref ref-type="bibr" rid="B12">2015</xref>).</p>
<p>It is a good trend to apply machine learning technology to solve nonlinear time series problems. Various machine learning algorithms have been studied and deployed. Neural Network model Tsai et al. (<xref ref-type="bibr" rid="B18">2009</xref>); Babai et al. (<xref ref-type="bibr" rid="B1">2020</xref>); Yustiawan et al. (<xref ref-type="bibr" rid="B23">2021</xref>) is widely used in long-term demand prediction. Grimme et al. (<xref ref-type="bibr" rid="B7">2020</xref>) use them for short-term demand forecasting. They compared two advanced formulas, MTUNN and PENN, with the general multilayer perceptron model. Wei and Chen (Chen et al., <xref ref-type="bibr" rid="B3">2020</xref>) used hybrid neural network model to predict passenger flow in rapid transit systems. A Bayesian state-space model can be created by generating the current state matrix from the observed data in the time series (Zhang et al., <xref ref-type="bibr" rid="B24">2020</xref>). Support vector machine (SVM) is regarded as a classification tool, and support vector regression aims to identify and optimize the error range of regression. Jiang et al. (<xref ref-type="bibr" rid="B9">2015</xref>) applied gray SVM combined with empirical mode decomposition (EMD) to high-speed railway passenger flow prediction. Xie et al. (<xref ref-type="bibr" rid="B22">2013</xref>) used EMD to model passenger flow prediction of airport terminals by least squares support vector machine. Weng et al. (<xref ref-type="bibr" rid="B21">2019</xref>) applied the hybrid model combining LSTM and Light TGBM to air ticket sales prediction. Artificial intelligence or machine learning models are computation-intensive self-learning algorithms that iteratively modify and fine-tune the interpretation model through the evaluation results, and reduce the margin of error. However, the above method based on machine learning is based on the historical data of each air station forecast, this method does not take into account the impact of ticket prices and the ridership flow of other stations and the current ridership flow of the station, so the prediction performance is poor.</p>
<p>Graphic Convolutional Neural Network (GCN), as a Neural Network that can extract unstructured data, which has attracted a lot of attention in solving the relationship between adjacent points (Wei et al., <xref ref-type="bibr" rid="B20">2019</xref>; He et al., <xref ref-type="bibr" rid="B8">2020</xref>). In view of the low accuracy of air passenger flow prediction and the trend, randomness and volatility of air traffic affected by many factors, we built a graph convolution-long short-term memory model based on graph convolutional neural network and the long short-term memory (LSTM) neural network. In this model, the GCN is used to map the features of the data set. Then the LSTM model are used to process the matrix data set, and the fare prediction is realized. The method considers the different effects of various factors on the ticket price, and combines the trend and fluctuation characteristics of the ticket price. The experimental results show that the graph convolution model of long memory and short memory can predict the air ticket price well. Our contributions are summaried as:
<list list-type="order">
<list-item><p>In order to improve the feature extraction ability of aviation data, we have a deep understanding of the data characteristics of aviation data. By constructing a GCN feature extractor, we can transform non-European spatial data into concise and efficient features. This method improves the feature expression ability of the data.</p></list-item>
<list-item><p>In order to solve the problem of long term and short term dependence of time series data, in this paper, we introduce the LSTM network to solve the data dependence of samples through logical gating unit, and further improve the performance of prediction.</p></list-item>
<list-item><p>The air flow prediction scheme based on GCN-LSTM shows excellent performance on the existing aviation data. The experimental results show that the prediction performance of the proposed algorithm is obviously better than that of other existing algorithms.</p></list-item>
</list></p>
<p>The remaining part of this paper is organized as follows. The main contribution of this paper is descripted in section 2. In section 3, two comparative experiments are used to prove the effectiveness of the algorithm. And conclusions are drawn in section 4.</p></sec>
<sec id="s2">
<title>2. Main Result</title>
<p>In airlines, the spatial distribution of aircraft stations is a non-euclidean structure, that is, the number of stations around each station is uncertain, and even if two stations are adjacent, they may not actually communicate with each other, resulting in no spatial relationship between their traffic. Therefore, traditional convolutional neural network (CNN) cannot accurately obtain their spatial information. At this point, multiple sites can be abstracted into A graph (see <xref ref-type="fig" rid="F1">Figure 1</xref>). Features are extracted from the original input data to obtain the result of feature mapping of multiple channels. The intercommunication relationship between each site is represented by adjacency matrix A.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>The distribution of the stations.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-15-661037-g0001.tif"/>
</fig>
<sec>
<title>2.1. The Definition of the Problem</title>
<p>The problem of airline passenger flow prediction can be described as follows: the historical flow data of each station <italic>X</italic><sub><italic>t</italic>&#x02212;<italic>s</italic></sub>, <italic>X</italic><sub><italic>t</italic>&#x02212;<italic>s</italic>&#x0002B;1</sub>, <italic>X</italic><sub><italic>t</italic>&#x02212;2</sub>, &#x022EF;&#x02009;, <italic>X</italic><sub><italic>t</italic>&#x02212;1</sub> (s is the time step) can be used to predict the flow <italic>X</italic><sub><italic>t</italic></sub> of the next period. The formula is described as
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>s</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where, <italic>X</italic><sub><italic>t</italic></sub> is the site characteristics at each time step, and <italic>F</italic> is a nonlinear function.</p>
<p>In the actual traffic system, the network is regarded as a directed graph <italic>G</italic> &#x0003D; (<italic>Q, V, A</italic>). Each sensor in the network is regarded as a node <italic>v</italic><sub><italic>i</italic></sub> and its value <italic>Q</italic> &#x02208; <italic>R</italic> is a scalar. <italic>V</italic> &#x02208; <italic>R</italic><sup><italic>N</italic></sup> and <italic>N</italic> is the number of sensors. The flow relationship between nodes consists of adjacency matrix <italic>A</italic> that is, the element <italic>A</italic><sub><italic>ij</italic></sub> in <italic>A</italic> represents the connection relationship between node <italic>V</italic><sub><italic>i</italic></sub> and <italic>V</italic><sub><italic>j</italic></sub>.</p></sec>
<sec>
<title>2.2. The Description of the GCN</title>
<p>When dealing with the structure of the graph, it is necessary to obtain its Symmetric normalized Laplacian matrix <italic>L</italic>, which is generally defined in the following ways:
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>-</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where, <italic>I</italic><sub><italic>N</italic></sub> is the identity matrix of <italic>N</italic> &#x000D7; <italic>N</italic>; Degree matrix <italic>D</italic> is defined as <inline-formula><mml:math id="M3"><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msubsup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. Decompose the eigenvalue of <italic>L</italic> to get <italic>L</italic> &#x0003D; L &#x0003D; U&#x0039B;U<sup>T</sup>. &#x0039B; is made up of L eigenvalues of diagonal matrix. U &#x0003D; {u<sub>1</sub>, u<sub>2</sub>, &#x02026;, u<sub>N</sub>} is composed of the eigenvector L, and it is an orthonormal basis for R<sup>N</sup>.</p>
<p>The spectral convolution theory in the graph structure has been supplemented and perfected in the paper. The convolution operation of convolution kernel <italic>G</italic> and input signal <italic>X</italic> in the time domain can be converted into the inner product form in the frequency domain.
<disp-formula id="E3"><label>(3)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:msup><mml:mi>g</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x02299;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:msup><mml:mstyle mathvariant="bold-italic"><mml:mi>x</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <inline-formula><mml:math id="M5"><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mtext>diag</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x003B8;</mml:mi><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, &#x02299; represents the hadamar product, <italic>U</italic><sup><italic>T</italic></sup><italic>g</italic> means mapping <italic>g</italic> to the frequency domain space based on <italic>U</italic>. Due to <italic>g</italic><sub>&#x003B8;</sub> high computational complexity, so hierarchical linear model constraints and the chebyshev polynomial are used to approximate calculation. In this paper, the simplified first order polynomial form of <italic>g</italic>&#x0002A;<italic>x</italic> is adopted.
<disp-formula id="E4"><label>(4)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:msubsup><mml:mo>&#x02248;</mml:mo><mml:mi>&#x003B8;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <inline-formula><mml:math id="M7"><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mover accent="false"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:msup><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mtext>&#x02003;</mml:mtext><mml:mi>&#x000C3;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mi>A</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M8"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Therefore, the output of layer <italic>L</italic> is
<disp-formula id="E5"><label>(5)</label><mml:math id="M9"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:mover accent="false"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where &#x003B4; is the activation function, <inline-formula><mml:math id="M10"><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x000D7;</mml:mo><mml:msup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:msup></mml:math></inline-formula>, <italic>C</italic><sup>(<italic>L</italic> &#x02212; 1)</sup> is the output dimension of the (<italic>L</italic> &#x02212; 1) layer, and <italic>F</italic><sup>(<italic>L</italic>&#x02212;1)</sup> is the characteristic vector size of each dimension. Therefore
<disp-formula id="E6"><label>(6)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:mover accent="false"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
At present, there is no effective measurement method for the calculation of adjacency matrix <italic>A</italic>. Most scholars use heuristic methods, that is, based on the Euclidean distance or Markov distance between sensors to determine the element value corresponding to the adjacency matrix. However, these methods all require manual calculation of the distance relationship between the sensors in advance. In this paper, the data-driven method is adopted to calculate the adjacency matrix, and <italic>A</italic> &#x0003D; <italic>D</italic>. The formula can be written as
<disp-formula id="E7"><label>(7)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mover accent="false"><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
The element value of matrix <italic>A</italic> is learned from the sample data, that is, the matrix is composed of trainable parameters. The data-driven approach is more realistic than the heuristic approach. Therefore, the L layer of the convolutional neural network is constructed in accordance with Formula 7. It should be noted that the initial matrix <italic>A</italic> is the same for each layer of the convolutional network, and the parameters are updated only when the error is propagated backwards.</p>
<p>GCN introduces the spatial features of the graph by convolving the Laplace matrix with the input. In this paper, the model takes flight segments as nodes and the association between flight segments as edges to build a graph. According to the graph, the adjacency matrix is obtained and the demand of future flight segments is predicted by combining the price and demand of historical flight segments.</p></sec>
<sec>
<title>2.3. The Problem of Time Series</title>
<p>It is found that Recurrent Neural networks (RNN) are widely used in sequential data such as natural language and image processing, which have a significant effect. Since then, various types of Circulating Neural Networks have been used. Aiming at the problem of air passenger flow prediction, this paper introduces the LSTM, which can extract the characteristic information of the input sequence and find its internal relation, so as to improve the prediction accuracy of the model. In order to make use of the spatial-temporal characteristic of the airborne data information at the same time, the GCN model is combined with the LSTM model, and it is added to the output of the upper level.</p>
<p>The LSTM network structure used in this paper is shown as <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>The structure of LSTM.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-15-661037-g0002.tif"/>
</fig>
<p>The network model mainly accepts three inputs: <italic>X</italic>, <italic>H</italic> and <italic>C</italic> represent the current state, hidden layer state and cell state, respectively.</p>
<p>LSTM mainly realizes the management of long and short term memory through three gating units. Firstly, the LSTM needs to determine what information needs to be thrown out. This step is decided by the layer called the &#x0201C;Forget Gate.&#x0201D; Input <italic>x</italic> and <italic>h</italic>, output a number between 0 and 1. The value of 1 means &#x0201C;keep the value completely,&#x0201D; while 0 means &#x0201C;throw the value away completely.&#x0201D; The formula of forgetting gate is as follows:
<disp-formula id="E8"><label>(8)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
where <italic>W</italic><sub><italic>f</italic></sub> and <italic>b</italic><sub><italic>f</italic></sub> are the parameters to be learned, and &#x003C3; is the sigmod activation function.</p>
<p>Secondly, the LSTM needs to determine what information need to store in the cell state. There are two stages to this question. First, the layer of &#x0201C;Input Gate&#x0201D; determine which data needs to be updated. Then, the vector <italic>C</italic><sub>1</sub> was created by a tanh layer.
<disp-formula id="E9"><label>(9)</label><mml:math id="M14"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo class="qopname">tanh</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
After deciding what needs to be forgotten and what needs to be added, <italic>C</italic><sub><italic>t</italic>&#x02212;1</sub> can be updated to <italic>C</italic><sub><italic>t</italic></sub>.
<disp-formula id="E11"><label>(10)</label><mml:math id="M16"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02217;</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02217;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
Finally, we need to decide what to export. This output is based on our cell state. The final output is part of the cell state. First, we run an output gate to determine which part of the cell state we are going to output. Then we put the cell state into the tanh (pressing the value between &#x02013;1 and 1). Finally we multiply it by the output of the output gate.
<disp-formula id="E12"><label>(11)</label><mml:math id="M17"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mtable style="text-align:axis;" equalrows="false" columnlines="" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02217;</mml:mo><mml:mo class="qopname">tanh</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></sec>
<sec>
<title>2.4. The Description of Algorithm</title>
<p>The network structure based on GCN-LSTM model proposed in this paper is shown in the <xref ref-type="fig" rid="F3">Figure 3</xref>. The model mainly adopts encoder-decoder structure. In the encoder, multiple parallel GCN modules are used to extract the key features of the graph network with different time series. Then, the extracted time series features are transmitted to LSTM, and feature analysis and further feature extraction are carried out on the sequence data through LSTM to solve the long-term and short-term dependencies between the data. Finally, the encoder generates an encoded pair vector and sends it to the decoder. In the decoder, the multi-layer feedforward neural network is used to further process the features of the coding vector. Finally, the processed data is transmitted to a GCN network to produce predicted values.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Overall structure of GCN-LSTM model (original features of air passenger flow data are extracted by using first-order approximate GCN, and output features are analyzed by LSTM for long-term and short-term sequence characteristics, and then predicted values are obtained).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-15-661037-g0003.tif"/>
</fig>
<p>In order to improve the prediction performance of the GCN-LSTM algorithm, in this paper, we use the final output through the network and the value of the real label to calculate <italic>L</italic><sub>1</sub> loss, also known as the mean absolute error (MAE), and take the mean square error (MSE) as the evaluation index of the model. The specific calculation formula is as:
<disp-formula id="E13"><label>(12)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="right center left"><mml:mtr><mml:mtd><mml:mo class="qopname">loss</mml:mo><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mo stretchy="false">|</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x00177;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">|</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>&#x00177;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
In this paper, the Adam-based batch gradient descent optimization algorithm is used to learn and update parameters through the loss function to minimize the loss function until the loss function converges. The trained model is used to predict the test set and calculate the MSE. The smaller the MSE value is, the closer the predicted value of the model is to the real value and the better the generalization ability of the model is.</p></sec></sec>
<sec id="s3">
<title>3. Experiments</title>
<p>This paper selects 6, 9111, 332 ticket sales data examples of 28,809 flights of 17 domestic airlines between September 1, 2020 and October 31, 2020 to verify the feasibility and effectiveness of the GCN-LSTM combined prediction model. The selected data set is relatively complete without missing values. After obtaining a complete data set, an adjacency matrix is constructed according to the data set. Each flight segment is a node. Between nodes, if the origin is the same, it is considered to have a diverting effect on traffic, and the weight is set as the number of (0,1). If the destination is the same and the traffic is considered to be promoted, the weight is set as the number greater than 1 and the rest as 0.</p>
<p>In order to do a comparative experiment, our experimental environment and experimental parameters are set as: epoch = 100, batch size = 1,000, learning rate = 0.001, GPU = NVIDIA 2080Ti. The ratio of training set to test set is 8:2.</p>
<p>Five sections of AAT_URC, CAN_PEK, CAN_CSX, CAN_CTU, and CAN_CKG are taken as examples to construct an adjacency matrix, in which AAT, URC, CAN, PEK, CSX, CTU, and CKG are city names. The adjacency matrix of these five cities is shown in <xref ref-type="table" rid="T1">Table 1</xref>. If the origin of two flight sections is the same, it is considered to have a diversion effect on traffic, and the weight is set as 0.5. None of the five sections had the same destination, so the rest of the weights were set to 0.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Adjacent matrix.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th/>
<th valign="top" align="center"><bold>AAT_URC</bold></th>
<th valign="top" align="center"><bold>CAN_PEK</bold></th>
<th valign="top" align="center"><bold>CAN_CSX</bold></th>
<th valign="top" align="center"><bold>CAN_CTU</bold></th>
<th valign="top" align="center"><bold>CAN_CKG</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">AAT_URC</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0.0</td>
<td valign="top" align="center">0.0</td>
<td valign="top" align="center">0.0</td>
<td valign="top" align="center">0.0</td>
</tr>
<tr>
<td valign="top" align="left">CAN_PEK</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0.0</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.5</td>
</tr>
<tr>
<td valign="top" align="left">CAN_CSX</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.0</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.5</td>
</tr>
<tr>
<td valign="top" align="left">CAN_CTU</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.0</td>
<td valign="top" align="center">0.5</td>
</tr>
<tr>
<td valign="top" align="left">CAN_CKG</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">0.0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Then we need to construct a time series of prices. The above five flight sections are also taken as examples. According to the take-off time, the price series 14 days before the take-off time is taken as the <italic>X</italic> feature. The flow of 1 day before the take-off was taken as <italic>Y</italic>, and such input and output were a sample. The take-off time was calculated forward to increase the number of samples. In this way, there are 14 days&#x00027; data, one piece of demand data, arranged in a time series according to time.</p>
<p>In this paper, the data set of 2 months is divided into training set and test set according to the ratio of 8:2, normalized and trained by GCN-LSTM. The timing step size of the model is 15, and the window is constantly moved to predict. Under the premise of the same input of historical price time series, it is compared with the experimental results of autoregressive model (AR), Moving Average(MA), Exponential Smoothing(ES), Long short-term memory(LSTM) and Support Vector Regression(SVR).</p>
<p><xref ref-type="table" rid="T2">Table 2</xref> lists five precise results of route prediction, The prediction mean square error (MSE) of the proposed GCN-LSTM model is smaller than that of LSTM, SVR, AR, MA and ES. The results show that the GCN-LSTM model can improve the accuracy of prediction.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Prediction results of different methods.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th/>
<th valign="top" align="center"><bold>GCN-LSTM(%)</bold></th>
<th valign="top" align="center"><bold>LSTM(%)</bold></th>
<th valign="top" align="center"><bold>SVR(%)</bold></th>
<th valign="top" align="center"><bold>AR(%)</bold></th>
<th valign="top" align="center"><bold>MA(%)</bold></th>
<th valign="top" align="center"><bold>ES(%)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Average of five routes</td>
<td valign="top" align="center">6.86</td>
<td valign="top" align="center">10.84</td>
<td valign="top" align="center">12.72</td>
<td valign="top" align="center">14.46</td>
<td valign="top" align="center">13.73</td>
<td valign="top" align="center">16.93</td>
</tr>
<tr>
<td valign="top" align="left">AAT_URC</td>
<td valign="top" align="center">5.44</td>
<td valign="top" align="center">8.71</td>
<td valign="top" align="center">10.73</td>
<td valign="top" align="center">11.37</td>
<td valign="top" align="center">10.74</td>
<td valign="top" align="center">14.39</td>
</tr>
<tr>
<td valign="top" align="left">CAN_PEK</td>
<td valign="top" align="center">6.91</td>
<td valign="top" align="center">9.74</td>
<td valign="top" align="center">12.02</td>
<td valign="top" align="center">12.75</td>
<td valign="top" align="center">11.71</td>
<td valign="top" align="center">16.47</td>
</tr>
<tr>
<td valign="top" align="left">CAN_CSX</td>
<td valign="top" align="center">8.87</td>
<td valign="top" align="center">12.03</td>
<td valign="top" align="center">13.07</td>
<td valign="top" align="center">17.13</td>
<td valign="top" align="center">14.57</td>
<td valign="top" align="center">18.29</td>
</tr>
<tr>
<td valign="top" align="left">CAN_CTU</td>
<td valign="top" align="center">6.24</td>
<td valign="top" align="center">11.73</td>
<td valign="top" align="center">14.35</td>
<td valign="top" align="center">15.01</td>
<td valign="top" align="center">13.79</td>
<td valign="top" align="center">17.48</td>
</tr>
<tr>
<td valign="top" align="left">CAN_CKG</td>
<td valign="top" align="center">6.84</td>
<td valign="top" align="center">11.99</td>
<td valign="top" align="center">13.43</td>
<td valign="top" align="center">16.04</td>
<td valign="top" align="center">17.84</td>
<td valign="top" align="center">18.02</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>AAT_URC a single route, for example, using the proposed GCN-LSTM traffic prediction model, the horizontal axis shows departure date from September 15, 2020 to October 31, 2020, 14 days before the use of the time sequence to forecast the traffic on the same day price, compare the renderings as shown in <xref ref-type="fig" rid="F4">Figure 4</xref>, dot shows the actual passenger flow, square said according to 14 days before the price time series prediction of passenger flow.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>OGCN-LSTM model prediction results of AAT URC route.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-15-661037-g0004.tif"/>
</fig>
<p><xref ref-type="fig" rid="F5">Figure 5</xref> shows the average MSE values predicted by AR model, moving average, exponential smoothing, LSTM and SVR for 5 airlines. The horizontal axis represents five different airlines, the vertical axis represents square error (MSE), and the red line is the prediction results of the proposed GCN-LSTM model.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Comparison of MSE results of five airlines.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnbot-15-661037-g0005.tif"/>
</fig>
<p>It can be seen from the figure that the GCN-LSTM model is used for prediction, and the error fluctuation is small, and the MSE is basically in the range of 5%-9%. The prediction results of the proposed GCN-LSTM model are obviously better than those of other models.</p></sec>
<sec sec-type="conclusions" id="s4">
<title>4. Conclusion</title>
<p>In view of the problems existing in air flow prediction, an air flow prediction model based on graph convolutional neural network and long short-term memory network is proposed based on in-depth analysis of the influencing factors of air flow prediction. Firstly, based on the characteristics of air traffic data, a feature extraction network based on graph convolutional neural network is designed. Then combined with the long&#x02014;short memory network to solve the problem of long&#x02014;short&#x02014;term data dependence; Finally, the prediction results are outputted based on the feedforward neural network. In the experimental part, we verify the performance of the GCN-LSTM model on aviation data sets. The experimental results show that the training effect of this model is obviously better than other models, and it has lower MSE loss value. This also shows that the prediction result has a higher prediction accuracy.</p></sec>
<sec sec-type="data-availability" id="s5">
<title>Data Availability Statement</title>
<p>The datasets presented in this study can be found in online repositories. The names of the repository/repositories and accession number(s) can be found below: <ext-link ext-link-type="uri" xlink:href="https://github.com/qetmes/GCN-LSTM">https://github.com/qetmes/GCN-LSTM</ext-link>.</p></sec>
<sec id="s6">
<title>Author Contributions</title>
<p>The author confirms being the sole contributor of this work and has approved it for publication.</p></sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of Interest</title>
<p>The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p></sec>
<sec sec-type="disclaimer" id="s7">
<title>Publisher&#x00027;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p></sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Babai</surname> <given-names>M.</given-names></name> <name><surname>Tsadiras</surname> <given-names>A.</given-names></name> <name><surname>Papadopoulos</surname> <given-names>C.</given-names></name></person-group> (<year>2020</year>). <article-title>On the empirical performance of some new neural network methods for forecasting intermittent demand</article-title>. <source>IMA J. Manag. Math</source>. <volume>31</volume>, <fpage>281</fpage>&#x02013;<lpage>305</lpage>. <pub-id pub-id-type="doi">10.1093/imaman/dpaa003</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Carmona-Ben&#x000ED;tez</surname> <given-names>R. B.</given-names></name> <name><surname>Nieto</surname> <given-names>M. R.</given-names></name></person-group> (<year>2020</year>). <article-title>Sarima damp trend gray forecasting model for airline industry</article-title>. <source>J. Air Trans. Manag</source>. <volume>82</volume>:<fpage>101736</fpage>. <pub-id pub-id-type="doi">10.1016/j.jairtraman.2019.101736</pub-id></citation></ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>D.</given-names></name> <name><surname>Zhang</surname> <given-names>J.</given-names></name> <name><surname>Jiang</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>Forecasting the short-term metro ridership with seasonal and trend decomposition using loess and lstm neural networks</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>91181</fpage>&#x02013;<lpage>91187</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2995044</pub-id><pub-id pub-id-type="pmid">27295638</pub-id></citation></ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Diego</surname> <given-names>E.</given-names></name> <name><surname>Sang-Yeob</surname> <given-names>L.</given-names></name></person-group> (<year>2012</year>). <article-title>Demand shifting across flights and airports in a spatial competition model</article-title>. <source>Lett. Spatial Resour. Sci</source>. <volume>5</volume>, <fpage>175</fpage>&#x02013;<lpage>183</lpage>. <pub-id pub-id-type="doi">10.2139/ssrn.2722349</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Donovan</surname> <given-names>A. W.</given-names></name></person-group> (<year>2005</year>). <article-title>Yield management in the airline industry</article-title>. <source>J. Aviat. Aerospace Educ. Res</source>. <volume>14</volume>, <fpage>9</fpage>. <pub-id pub-id-type="pmid">32362731</pub-id></citation></ref>
<ref id="B6">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Etzioni</surname> <given-names>O.</given-names></name> <name><surname>Tuchinda</surname> <given-names>R.</given-names></name> <name><surname>Knoblock</surname> <given-names>C. A.</given-names></name> <name><surname>Yates</surname> <given-names>A.</given-names></name></person-group> (<year>2003</year>). <article-title>To buy or not to buy: mining airfare data to minimize ticket purchase price</article-title>, in <source>Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>, <fpage>119</fpage>&#x02013;<lpage>128</lpage>.</citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Grimme</surname> <given-names>W.</given-names></name> <name><surname>Bingemer</surname> <given-names>S.</given-names></name> <name><surname>Maertens</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>An analysis of the prospects of ultra-long-haul airline operations using passenger demand data</article-title>. <source>Transport. Res. Procedia</source> <volume>51</volume>, <fpage>208</fpage>&#x02013;<lpage>216</lpage>. <pub-id pub-id-type="doi">10.1016/j.trpro.2020.11.023</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>He</surname> <given-names>X.</given-names></name> <name><surname>Deng</surname> <given-names>K.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>M.</given-names></name></person-group> (<year>2020</year>). <article-title>Lightgcn: Simplifying and powering graph convolution network for recommendation</article-title>. <source>arXiv preprint</source> arXiv:2002.02126. <pub-id pub-id-type="doi">10.1145/3397271.3401063</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname> <given-names>X.</given-names></name> <name><surname>Chen</surname> <given-names>X.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Zhang</surname> <given-names>R.</given-names></name></person-group> (<year>2015</year>). <article-title>Dynamic demand forecasting and ticket assignment for high-speed rail revenue management in china</article-title>. <source>Transp. Res. Rec</source>. <volume>2475</volume>, <fpage>37</fpage>&#x02013;<lpage>45</lpage>. <pub-id pub-id-type="doi">10.3141/2475-05</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Klein</surname> <given-names>R.</given-names></name> <name><surname>Koch</surname> <given-names>S.</given-names></name> <name><surname>Steinhardt</surname> <given-names>C.</given-names></name> <name><surname>Strauss</surname> <given-names>A. K.</given-names></name></person-group> (<year>2020</year>). <article-title>A review of revenue management: recent generalizations and advances in industry applications</article-title>. <source>Eur. J. Oper. Res</source>. <volume>284</volume>, <fpage>397</fpage>&#x02013;<lpage>412</lpage>. <pub-id pub-id-type="doi">10.1016/j.ejor.2019.06.034</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kulkarni</surname> <given-names>G. E.</given-names></name> <name><surname>Muley</surname> <given-names>A. A.</given-names></name> <name><surname>Deshmukh</surname> <given-names>N. K.</given-names></name> <name><surname>Bhalchandra</surname> <given-names>P. U.</given-names></name></person-group> (<year>2018</year>). <article-title>Autoregressive integrated moving average time series model for forecasting air pollution in nanded city, maharashtra, india</article-title>. <source>Model. Earth Syst. Environ</source>. <volume>4</volume>, <fpage>1435</fpage>&#x02013;<lpage>1444</lpage>. <pub-id pub-id-type="doi">10.1007/s40808-018-0493-2</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Leng</surname> <given-names>N.</given-names></name> <name><surname>Nie</surname> <given-names>L.</given-names></name> <name><surname>Guo</surname> <given-names>G.</given-names></name> <name><surname>Wu</surname> <given-names>X.</given-names></name></person-group> (<year>2015</year>). <article-title>Passenger flow forecasting for chinese high speed rail network</article-title>, in <source>2015 International Conference on Mechatronics, Electronic, Industrial and Control Engineering (MEIC-15)</source> (<publisher-loc>Atlantis Press</publisher-loc>), <fpage>675</fpage>&#x02013;<lpage>678</lpage>.</citation></ref>
<ref id="B13">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Han</surname> <given-names>H.</given-names></name> <name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Li</surname> <given-names>C.</given-names></name></person-group> (<year>2018</year>). <article-title>Passenger flow forecast of sanya airport based on arima model</article-title>, in <source>International Conference of Pioneering Computer Scientists, Engineers and Educators</source> (<publisher-loc>Springer</publisher-loc>), <fpage>442</fpage>&#x02013;<lpage>454</lpage>.</citation></ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>R.</given-names></name> <name><surname>Li</surname> <given-names>A.</given-names></name></person-group> (<year>2012</year>). <article-title>Forecasting high-speed rail ridership using a simultaneous modeling approach</article-title>. <source>Transp. Plann. Technol</source>. <volume>35</volume>, <fpage>577</fpage>&#x02013;<lpage>590</lpage>. <pub-id pub-id-type="doi">10.1080/03081060.2012.701816</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Madhavan</surname> <given-names>M.</given-names></name> <name><surname>Ali Sharafuddin</surname> <given-names>M.</given-names></name> <name><surname>Piboonrungroj</surname> <given-names>P.</given-names></name> <name><surname>Yang</surname> <given-names>C.-C.</given-names></name></person-group> (<year>2020</year>). <article-title>Short-term forecasting for airline industry: the case of indian air passenger and air cargo</article-title>. <source>Glob. Bus. Rev</source>. <pub-id pub-id-type="doi">10.1177/0972150920923316</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Riedel</surname> <given-names>S.</given-names></name> <name><surname>Gabrys</surname> <given-names>B.</given-names></name></person-group> (<year>2003</year>). <article-title>Adaptive mechanisms in an airline ticket demand forecasting system</article-title>, in <source>EUNITE&#x00027;2003 Conference: European Symposium on Intelligent Technologies, Hybrid Systems and their Implementation on Smart Adaptive Systems</source> (<publisher-loc>Oulu</publisher-loc>).</citation></ref>
<ref id="B17">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Sickles</surname> <given-names>R.</given-names></name> <name><surname>Good</surname> <given-names>D.</given-names></name> <name><surname>Postert</surname> <given-names>A.</given-names></name> <name><surname>Getachew</surname> <given-names>L.</given-names></name></person-group> (<year>1998</year>). <article-title>A model of world aircraft demand</article-title>, in <source>Airport Facilities: Innovations for the Next Century. Proceedings of the 25th International Air Transportation Conference</source> (<publisher-loc>American Society of Civil Engineers</publisher-loc>).</citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tsai</surname> <given-names>T.-H.</given-names></name> <name><surname>Lee</surname> <given-names>C.-K.</given-names></name> <name><surname>Wei</surname> <given-names>C.-H.</given-names></name></person-group> (<year>2009</year>). <article-title>Neural network based temporal feature models for short-term railway passenger demand forecasting</article-title>. <source>Expert Syst. Appl</source>. <volume>36</volume>, <fpage>3728</fpage>&#x02013;<lpage>3736</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2008.02.071</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>X.</given-names></name> <name><surname>Han</surname> <given-names>Y.</given-names></name> <name><surname>Guo</surname> <given-names>S.</given-names></name></person-group> (<year>2013</year>). <article-title>Forecast of passenger and freight traffic volume based on elasticity coefficient method and grey model</article-title>. <source>Procedia Soc. Behav. Sci</source>. <volume>96</volume>, <fpage>136</fpage>&#x02013;<lpage>147</lpage>. <pub-id pub-id-type="doi">10.1016/j.sbspro.2013.08.019</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>Nie</surname> <given-names>L.</given-names></name> <name><surname>He</surname> <given-names>X.</given-names></name> <name><surname>Hong</surname> <given-names>R.</given-names></name> <name><surname>Chua</surname> <given-names>T.-S.</given-names></name></person-group> (<year>2019</year>). <article-title>Mmgcn: multi-modal graph convolution network for personalized recommendation of micro-video</article-title>, in <source>Proceedings of the 27th ACM International Conference on Multimedia</source>, <fpage>1437</fpage>&#x02013;<lpage>1445</lpage>.</citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Weng</surname> <given-names>T.</given-names></name> <name><surname>Liu</surname> <given-names>W.</given-names></name> <name><surname>Xiao</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Supply chain sales forecasting based on lightgbm and lstm combination model</article-title>. <source>Ind. Manag. Data Syst</source>. <volume>120</volume>, <fpage>265</fpage>&#x02013;<lpage>279</lpage>. <pub-id pub-id-type="doi">10.1108/IMDS-03-2019-0170</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Xie</surname> <given-names>G.</given-names></name> <name><surname>Wang</surname> <given-names>S.</given-names></name> <name><surname>Lai</surname> <given-names>K. K.</given-names></name></person-group> (<year>2013</year>). <article-title>Air passenger forecasting by using a hybrid seasonal decomposition and least squares support vector regression approach</article-title>, in <source>Proceedings of the 59th World Statistics Congress of the International Statistical Institute</source> (<publisher-loc>Hong Kong</publisher-loc>).</citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yustiawan</surname> <given-names>Y.</given-names></name> <name><surname>Ramadhan</surname> <given-names>H.</given-names></name> <name><surname>Kwon</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). <article-title>A stacked denoising autoencoder and long short-term memory approach with rule-based refinement to extract valid semantic trajectories</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>73152</fpage>&#x02013;<lpage>73168</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3080288</pub-id><pub-id pub-id-type="pmid">27295638</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Wang</surname> <given-names>C.</given-names></name> <name><surname>Gao</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>Passenger flow forecast of rail station based on multi-source data and long short term memory network</article-title>. <source>IEEE Access</source> <volume>8</volume>, <fpage>28475</fpage>&#x02013;<lpage>28483</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2971771</pub-id><pub-id pub-id-type="pmid">27295638</pub-id></citation></ref>
</ref-list>
</back>
</article>