CN113537626B - Method for predicting neural network combined time sequence by aggregating information difference - Google Patents

Method for predicting neural network combined time sequence by aggregating information difference Download PDF

Info

Publication number
CN113537626B
CN113537626B CN202110886769.8A CN202110886769A CN113537626B CN 113537626 B CN113537626 B CN 113537626B CN 202110886769 A CN202110886769 A CN 202110886769A CN 113537626 B CN113537626 B CN 113537626B
Authority
CN
China
Prior art keywords
matrix
neural network
passenger flow
gate
subway
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110886769.8A
Other languages
Chinese (zh)
Other versions
CN113537626A (en
Inventor
高超
刘浩
李向华
王震
朱培灿
李学龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northwestern Polytechnical University
Original Assignee
Northwestern Polytechnical University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN202110886769.8A priority Critical patent/CN113537626B/en
Publication of CN113537626A publication Critical patent/CN113537626A/en
Application granted granted Critical
Publication of CN113537626B publication Critical patent/CN113537626B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/21Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
    • G06F18/211Selection of the most significant subset of features
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/04Architecture, e.g. interconnection topology
    • G06N3/045Combinations of networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/01Detecting movement of traffic to be counted or controlled
    • G08G1/0104Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125Traffic data processing
    • G08G1/0129Traffic data processing for creating historical data or processing based on historical data

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Business, Economics & Management (AREA)
  • Evolutionary Computation (AREA)
  • Strategic Management (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Computing Systems (AREA)
  • Molecular Biology (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Computational Linguistics (AREA)
  • Biophysics (AREA)
  • Biomedical Technology (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Evolutionary Biology (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The invention discloses a method for predicting a neural network combining time sequence of aggregated information difference, belongs to the field of deep learning and intelligent transportation, and can simultaneously capture time and space characteristics of subway passenger flow data. According to the method, through a gating mechanism in the GateRecurrentUnit model, the change trend of historical information is still kept as much as possible while the passenger flow information at the current moment is captured, the time dependence relationship between the passenger flow information is fully considered, and finally, the influence of a smoothing filter defined in the Fourier domain of the graph neural network on a prediction result can be effectively counteracted by testing on the real traffic network on the sea subway traffic network, so that the problem that the prediction accuracy is low due to the fact that the prediction result is smooth when the peak passenger flow data is predicted is solved.

Description

Method for predicting neural network combined time sequence by aggregating information difference
Technical Field
The invention relates to the field of deep learning and intelligent traffic, in particular to a method for predicting a neural network combined time sequence for aggregating information differences.
Background
Nowadays, artificial intelligence technology is rapidly developed, meanwhile, along with the large amount of application of cheap traffic sensor technology, explosion-type growing traffic data is adopted, people start to enter traffic big data and intelligent traffic age, an intelligent traffic system aims to establish a complete set of traffic information service and traffic management control system, the system can relieve traffic jam problems, such as recently popularized ETC, automatic vehicle charging is completed by using an automatic vehicle identification technology, the vehicle passing efficiency of expressway toll gate is accelerated, the holiday vehicle jam problem is effectively relieved, the intelligent traffic system can monitor and predict road traffic in real time, reasonably plan traffic state of a road network, further improve traffic efficiency of vehicles, reduce traffic accidents, and along with rapid economic development, pace acceleration of urban modernization construction and stable population growth, urban traffic congestion is more and more serious, subways are an important component of urban rail traffic, great effect is exerted in terms of relieving the traffic congestion, worldwide development is rapid, subway passenger flow prediction is an important research direction in intelligent traffic systems, historical passenger flow data is utilized to reasonably predict passenger flow of future subway stations, reasonable planning suggestions can be provided for subway operation planners, operation efficiency of subway networks is improved and improved, subway line structures are more and more complicated along with the increase of subway lines in cities, safety and efficiency of subway operation face serious challenges, subway passenger flow is one of main factors affecting subway operation scheduling, accurate passenger flow prediction is an important means for coping with the challenges, and managers are helped to formulate reasonable operation plans, the method has the advantages that the traffic jam is relieved, the subway operation efficiency is improved, the basic scale of a newly built subway station, the length of a platform, the crowd evacuation capacity of the platform and the like can be judged according to various data of passenger flow prediction, the dangerous factors of the subway station are eliminated from the root, and various safety problems of the subway station are avoided. The accurate passenger flow prediction can also help travelers to plan an optimal travel route, effectively avoid peak passenger flow, improve travel efficiency and ensure travel safety, and in addition, the neural network based on aggregate information difference can be used for predicting the passenger flow of subway stations and can also be applied to road and vehicle flow prediction in combination with a passenger flow prediction method of a time sequence. The accurate traffic flow prediction has important reference value for planning, designing, managing and controlling traffic facilities, for example, by predicting traffic flow information of road traffic, a manager can effectively relieve the congestion degree of peak road sections by controlling signal lamps or dispatching traffic police and the like; and provide reference information for future planning road design, for example, the road should be designed into several lanes, which part of the road can reduce the number of lanes, which part needs to increase the number of lanes, which is a single-way road, etc., thus the newly planned road can be guaranteed to be capable of effectively relieving or even solving the road congestion problem to the greatest extent;
the traditional traffic flow prediction method is mainly divided into two major types, namely a statistical method and a traditional machine learning method, wherein the statistical method is based on ARIMA and variants, VAR and Kalman filtering of the ARIMA, the VAR and the Kalman filtering have mathematical bases and have strong interpretability, however, the high nonlinearity and the dynamic property of traffic data enable the methods to be not in line with the assumption of linearity and stationarity, so that the actual application is poor, the traditional machine learning method is based on a support vector machine, a K nearest neighbor and the like, the methods can model nonlinear relations and extract complex relations in the traffic data, but under the age background of big data, the methods need to manually extract the characteristics in the data, and when a data set is huge, a great amount of manpower is consumed and accuracy cannot be ensured.
Disclosure of Invention
In view of the above problems, the present invention aims to provide a method for predicting a time series by combining a neural network with an aggregate information difference, which improves the capability of capturing time and space features of traffic data, especially the capability of extracting space features, in an original graph rolling network model, due to a smoothing filter defined in a fourier domain, when a graph rolling network model is used for predicting passenger flow, the prediction of peak data is smoother than that of real peak data, and the peak feature is missing. Compared with a circulating neural network model, the gating recursion unit model has the advantages of simple structure, less parameter quantity and short training time, and finally, the method is applied to the Shanghai subway traffic network to successfully predict the passenger flow of each subway station, thereby having great significance in relieving traffic jam and improving subway operation efficiency and providing reference information for travelers to improve travel efficiency.
In order to achieve the purpose of the invention, the invention is realized by the following technical scheme: a method for combining neural networks aggregating information differences with time series prediction, comprising the steps of:
step one: firstly, inputting data, inputting an adjacency matrix of a subway network G= (V, E), then inputting historical passenger flow data X of each station, and regarding passenger flow as the attribute of the station, which can be expressed as X epsilon R N×F
Step two: the weight of the node is enhanced, the weight proportion of the node in extracting the space features is enhanced by increasing the alpha-time identity matrix on the diagonal of the normalized matrix after the normalization of the Laplace matrix by a method of maximizing the difference based on the aggregation information;
step three: extracting spatial features, namely extracting the spatial features through the historical passenger flow data of each station and the preprocessed adjacent matrix of the subway network, which are input in the step one;
step four: reset gate r in Gate Recurrent Unit model t Then, a reset gate r is calculated t Reset gate r t Mainly for controlling candidate state c t Whether or not the value of (2) depends on the previous state h t-1
Step five: computing update gate u t The update gate in Gate Recurrent Unit model is mainly used for controlling the current state h t How much from the previous state h needs to be reserved t-1 Is to be from candidate state c t How much information is received;
step six: performing calculation of candidate state c t Obtaining a reset gate r through the fifth step t By resetting the gate r t Can calculate the candidate state c t Information of (2);
step seven: updating cell state h t Finally, the prediction result P is output through the full connection layer t+1 ,P t+2 ,...,P t+T ]And predicting the passenger flow data of the T time steps in the future by using the historical passenger flow data of the T time steps.
The further improvement is that: in the first step, v= { V in the subway network G i |i∈[1,N]And E= { E ij =(v i ,v j )|i,j∈[1,N]I +.j }, where if v i And v j E when there is an edge between ij E has a value of 1, V represents a set of subway stations, N represents the number of stations, E represents physical edges between stations, F represents the number of node attribute features and X t And representing the passenger flow values of all stations at the time t.
The further improvement is that: in the first step, the Laplace matrix is obtained through the input calculation of the first step
Figure BDA0003194512020000051
In the middle of
Figure BDA0003194512020000052
And->
Figure BDA0003194512020000053
Representing the adjacency matrix A plus the identity matrix I N And->
Figure BDA0003194512020000054
Representation->
Figure BDA0003194512020000055
Is a degree matrix of (2).
The further improvement is that: in the second step, the weight proportion of the node in extracting the space feature is enhanced by increasing the unit matrix of alpha times, and the weight proportion is expressed by the following formula
Figure BDA0003194512020000056
Wherein when alpha is 0.7, the final prediction result is the best, the degree matrix is a diagonal matrix, and the element values on the diagonal represent the degree of each vertex, wherein I N Is a matrix of units which is a matrix of units,
Figure BDA0003194512020000057
representing the adjacency matrix A plus the identity matrix I N ,/>
Figure BDA0003194512020000058
Representation->
Figure BDA0003194512020000059
The coefficient alpha has a value ranging between 0 and 1.
The further improvement is that: in the third step, the historical passenger flow data of each station and the adjacency matrix of the preprocessed subway network are extracted to extract the spatial characteristics, and the spatial characteristics are expressed by using the following formula
Figure BDA00031945120200000510
By the formula H can be found when l=0 l =x, and W l Represents layer I learnable parameters, and H (l+1) Representing the output of the first layer, while the value will be the input to the next layer, the two-layer neural network is represented using the following formula
Figure BDA0003194512020000061
In the formula
Figure BDA0003194512020000062
W in the formula (0) Is the learning parameter matrix of the first layer neural network, W (1) For the learning parameter matrix of the second layer neural network, X' is time series data with spatial characteristics output by the two-layer graph neural network model, H l Output representing layer i of the graph neural network, σ (·) representing nonlinear activation function, ++>
Figure BDA0003194512020000063
Representing the adjacency matrix A plus the identity matrix I N 、/>
Figure BDA0003194512020000064
Representation->
Figure BDA0003194512020000065
And (3) the degree matrix of each site, wherein X represents the historical passenger flow data matrix of each site input in the step one.
The further improvement is that: in the fourth step, a reset gate r is calculated t Calculated by the following formula
r t =σ(W r [X′ t ,h t-1 ]+b r )
W in the formula r And b r Is the parameter matrix and deviation in the training process, and r represents the calculation r t Parameters and deviations of X t ' means that time series data with spatial characteristics at time t are obtained from the graph neural network model.
Further improvementsThe method comprises the following steps: in the fifth step, a calculation update gate u is calculated t Calculated by the following formula
u t =σ(W u [X′ t ,h t-1 ]+b u )
W in the formula u And b u Is a parameter matrix and bias in the training process, wherein u represents the calculated u t Parameters and deviations of (a).
The further improvement is that: in the sixth step, the gate r is reset t Calculating candidate state c t Calculated by the following formula
c t =tanh(W c [X′ t ,(r t *h t-1 )]+b c )
W in the formula c And b c Is a parameter matrix and bias in the training process, wherein c represents the calculated c t Parameter matrix and bias at that time.
The further improvement is that: in the seventh step, the state h of the unit at the current moment is controlled by two door mechanisms of the fifth step and the sixth step t And updating the cell state in relation to the cell state at the previous time, calculated by the following formula
h t =u t *h t-1 +(1-u t )*c t
U in the formula t And c t Is the result of the calculation by the procedure of step six and step seven.
The beneficial effects of the invention are as follows: the invention combines the graph convolution network model with the enhanced self-node weight and the time sequence prediction model, so that the invention can utilize the time characteristics of traffic data and the space characteristics of the traffic data; in addition, for the extraction of the spatial features, the method of maximizing the difference of aggregation information is utilized to optimize the graph neural network model, so that the extraction effect of the method on the spatial features is better; meanwhile, the method is suitable for the problem of predicting the passenger flow of the subway station, and the scheme and other methods are compared and tested on the real world network, so that the result shows that the scheme is superior to other comparison methods, the method has higher accuracy, and the passenger flow in a future period of time can be effectively predicted.
Drawings
FIG. 1 is a flow chart of the present invention.
Fig. 2 is a detailed illustration of the present invention.
Fig. 3 shows an effect diagram of the present invention on prediction on the data of the subway network in the open sea.
Fig. 4 is a real network dataset scale.
FIG. 5 is a graph showing the comparison of the predicted effect of passenger flow on a real traffic network for multiple methods
Detailed Description
The present invention will be further described in detail with reference to the following examples, which are only for the purpose of illustrating the invention and are not to be construed as limiting the scope of the invention.
Example 1
According to the embodiment shown in fig. 1-3, a method for predicting a neural network combined time sequence of aggregated information difference is provided, which includes the following steps:
step one: firstly, inputting data, inputting an adjacency matrix of a subway network G= (V, E), then inputting historical passenger flow data X of each station, and regarding passenger flow as the attribute of the station, which can be expressed as X epsilon R N×F
Step two: the weight of the node is enhanced, the weight proportion of the node in extracting the space features is enhanced by increasing the alpha-time identity matrix on the diagonal of the normalized matrix after the normalization of the Laplace matrix by a method of maximizing the difference based on the aggregation information;
step three: extracting spatial features, namely extracting the spatial features through the historical passenger flow data of each station and the preprocessed adjacent matrix of the subway network, which are input in the step one;
step four: reset gate r in Gate Recurrent Unit model t Then, a reset gate r is calculated t Reset gate r t Mainly for controlling candidate state c t Whether or not the value of (2) depends onThe former state h t-1
Step five: computing update gate u t The update gate in Gate Recurrent Unit model is mainly used for controlling the current state h t How much from the previous state h needs to be reserved t-1 Is to be from candidate state c t How much information is received;
step six: performing calculation of candidate state c t Obtaining a reset gate r through the fifth step t By resetting the gate r t Can calculate the candidate state c t Information of (2);
step seven: updating cell state h t Finally, the prediction result P is output through the full connection layer t+1 ,P t+2 ,...,P t+T ]And predicting the passenger flow data of the T time steps in the future by using the historical passenger flow data of the T time steps.
In step one, v= { V in subway network G i |i∈[1,N]And E= { E ij =(v i ,v j )|i,j∈[1,N]I +.j }, where if v i And v j E when there is an edge between ij E has a value of 1, V represents a set of subway stations, N represents the number of stations, E represents physical edges between stations, F represents the number of node attribute features and X t And representing the passenger flow values of all stations at the time t.
In the first step, the Laplace matrix is obtained through the input calculation of the first step
Figure BDA0003194512020000091
In the middle of
Figure BDA0003194512020000092
And->
Figure BDA0003194512020000093
Representing the adjacency matrix A plus the identity matrix I N And->
Figure BDA0003194512020000094
Representation->
Figure BDA0003194512020000095
Is a degree matrix of (2).
In the second step, the weight proportion of the node in extracting the space feature is enhanced by increasing the unit matrix of alpha times, and the following formula is used for expression
Figure BDA0003194512020000096
In the third step, the historical passenger flow data of each station and the adjacency matrix of the preprocessed subway network are extracted to extract the spatial characteristics, and the spatial characteristics are expressed by using the following formula
Figure BDA0003194512020000097
By the formula H can be found when l=0 l =x, and W l Represents layer I learnable parameters, and H (l+1) Representing the output of the first layer, while the value will be the input to the next layer, the two-layer neural network is represented using the following formula
Figure BDA0003194512020000101
In the formula
Figure BDA0003194512020000102
W in the formula (0) Is the learning parameter matrix of the first layer neural network, W (1) For the learning parameter matrix of the second layer neural network, X' is time series data with spatial characteristics output by the two-layer graph neural network model, H l Output representing layer i of the graph neural network, σ (·) representing nonlinear activation function, ++>
Figure BDA0003194512020000103
Representing the adjacency matrix A plus the identity matrix I N 、/>
Figure BDA0003194512020000104
Representation->
Figure BDA0003194512020000105
And X represents the historical passenger flow data matrix of each site input in the step one.
In step four, the reset gate r is calculated t Calculated by the following formula
r t =σ(W r [X′ t ,h t-1 ]+b r )
W in the formula r And b r Is the parameter matrix and deviation in the training process, and r represents the calculation r t Parameters and deviations of X t ' means that time series data with spatial characteristics at time t are obtained from the graph neural network model.
In step five, a calculation update gate u is performed t Calculated by the following formula
u t =σ(W u [X′ t ,h t-1 ]+b u )
W in the formula u And b u Is a parameter matrix and bias in the training process, wherein u represents the calculated u t Parameters and deviations of (a).
In step six, the gate r is reset t Calculating candidate state c t Calculated by the following formula
c t =tanh(W c [X′ t ,(r t *h t-1 )]+b c )
W in the formula c And b c Is a parameter matrix and bias in the training process, wherein c represents the calculated c t Parameter matrix and bias at that time.
In the seventh step, the state h of the unit at the current moment is controlled by two door mechanisms of the fifth step and the sixth step t And updating the cell state in relation to the cell state at the previous time, calculated by the following formula
h t =u t *h t-1 +(1-u t )*c t
U in the formula t And c t Is the result of the calculation by the procedure of step six and step seven.
When the method is used, the EST-GCN model consists of two parts, namely a graph rolling network for enhancing self-node weight and a gating recursion unit, firstly, subway network topological structures at different moments and passenger flow data of each station are extracted to serve as input data of the ES-GCN model, then, based on an aggregation information difference maximizing method, the model solves the influence of a smoothing filter defined in a Fourier domain in an original graph rolling network on a prediction result, the smoothing filter can lead the model to be smoother compared with real peak data when the model predicts the peak data, the prediction result lacks the peak characteristics, and the spatial characteristics of traffic data can be extracted better by solving the problem. The result obtained by the graph-convolution network model with enhanced self-node weights is time-series data with spatial feature information, then to obtain the temporal feature, we input the obtained time-series data with spatial feature into a gated recursive unit model, then through inter-unit transfer information to get dynamic changes, the gated recursive unit model is actuated by two doors, reset the door r t Mainly for controlling candidate state c t Whether or not the value of (2) depends on the previous state h t-1 Update gate u t Mainly used for controlling the current state h t How much from the previous state h needs to be reserved t-1 Information of (c) and need to be derived from candidate state c t How much information is received. Through the two gating mechanisms, the gating recursion unit model not only can acquire the passenger flow information at the current moment, but also can keep the historical passenger flow information as much as possible, and finally, a final prediction result is obtained from the full-connection layer.
Example two
According to fig. 3, the present embodiment provides a method for predicting the neural network of aggregated information difference in combination with time series, and the areas a to d in fig. 3 show the comparison result of the real value and the predicted value of the passenger flow volume of each station at different time granularity from eight points in the morning,from the visual results, the actual passenger flows of a small number of stations are slightly different from the predicted passenger flows, but more than about 80% of stations are basically fit with the predicted passenger flows under different time granularities; the regions e to h in FIG. 3 show v 3 The comparison result of the real value and the predicted value of the passenger flow volume of the station from different time and at different time granularity can be seen from the visual result, and the station v at the time granularity of 15min 3 The real value and the predicted value of the passenger flow have a larger gap at the beginning, but the gap is smaller and smaller along with the time, because training data are increased, the prediction capability of the model is also improved, and the model, on the whole, because the influence of a smoothing filter in the Fourier domain of the graph convolution neural network on the space feature extraction result is counteracted by increasing the weight value of a node on the diagonal line of the adjacent matrix, the model has an excellent prediction result on the peak value, the beginning and the end of the peak time can be detected, and the prediction result has a similar mode with the change trend of the passenger flow of the actual rail transit station.
According to the method for predicting the neural network combined time sequence of the aggregated information difference provided by the embodiment shown in fig. 4, the method is all data of real subway network data for testing, wherein the number of subway stations is 285 stations in total, the time span of historical passenger flow data is 2015, 4, 6, 4, 26, 20 days in total, and the interval time of each piece of data is 15 minutes.
According to the embodiment shown in fig. 5, a method for combining neural networks with time sequence prediction for aggregating information differences is provided, which shows that the effects of passenger flow prediction on a plurality of real networks are compared by a plurality of comparison methods and the method provided by the invention, and the effect of passenger flow prediction is evaluated by mean absolute error, root mean square error, coefficient determination, interpretation variance score and accuracy, and the bolded items in each row indicate that the method has the best effect on the data set of the corresponding row, so that the effect of the EST-GCN method provided by the invention on passenger flow prediction is better than other methods.
The foregoing has shown and described the basic principles, principal features and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present invention, and various changes and modifications may be made without departing from the spirit and scope of the invention, which is defined in the appended claims. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (9)

1. A method for combining neural networks aggregating information differences with time series prediction, comprising the steps of:
step one: firstly, inputting data, inputting an adjacency matrix of a subway network G= (V, E), then inputting historical passenger flow data X of each station, and regarding passenger flow as the attribute of the station, which can be expressed as X epsilon R N×F X is a matrix of N rows and F columns, N represents the number of sites, and F is the number of node attribute features;
wherein v= { V in subway network G i |i∈[1,N]And E= { E ij =(v i ,v j )|i,j∈[1,N]I +.j }, where when v i And v j E when there is an edge between ij The value of E is 1, V represents the set of subway stations, N represents the number of stations, and E represents the physical connection edges between stations;
step two: the weight of the node is enhanced, the weight proportion of the node in extracting the space features is enhanced by increasing the alpha-time identity matrix on the diagonal of the normalized matrix after the normalization of the Laplace matrix by a method of maximizing the difference based on the aggregation information;
step three: extracting spatial features, namely extracting the spatial features through the historical passenger flow data of each station and the preprocessed adjacent matrix of the subway network, which are input in the step one;
step four: reset gate r in Gate Recurrent Unit model t Then, a reset gate r is calculated t Heavy weightDoor r t Mainly for controlling candidate state c t Whether or not the value of (2) depends on the previous state h t-1
Step five: computing update gate u t The update gate in Gate Recurrent Unit model is mainly used for controlling the current state h t How much from the previous state h needs to be reserved t-1 I.e. updating the gate help model decides how much past information to pass to the future;
step six: performing calculation of candidate state c t Obtaining a reset gate r through the fourth step t By resetting the gate r t Can calculate the candidate state c t Information of (2);
step seven: updating cell state h t Finally, the prediction result P is output through the full connection layer t+1 ,P t+2 ,...,P t+T ]And predicting passenger flow data for T time steps in the future using the historical passenger flow data for T time steps, wherein P t+1 Passenger flow data representing predicted first time step, P t+T Passenger flow data representing a predicted T-th time step.
2. The method for combining time series prediction with neural network for aggregating information differences according to claim 1, wherein: in the first step, v= { V in the subway network G i |i∈[1,N]And E= { E ij =(v i ,v j )|i,j∈[1,N]I +.j }, where if v i And v j E when there is an edge between ij E has a value of 1, V represents a set of subway stations, N represents the number of stations, E represents physical edges between stations, F represents the number of node attribute features and X t And representing the passenger flow values of all stations at the time t.
3. The method for combining time series prediction with neural network for aggregating information differences according to claim 1, wherein: in the first step, the Laplace matrix is obtained through the input calculation of the first step
Figure FDA0004137146100000021
In the middle of
Figure FDA0004137146100000022
And->
Figure FDA0004137146100000023
Representing the adjacency matrix A plus the identity matrix I N And->
Figure FDA0004137146100000024
Representation->
Figure FDA0004137146100000025
Is a degree matrix of (2).
4. The method for combining time series prediction with neural network for aggregating information differences according to claim 1, wherein: in the second step, the weight proportion of the node in extracting the space feature is enhanced by increasing the unit matrix of alpha times, and the weight proportion is expressed by the following formula
Figure FDA0004137146100000026
Wherein when alpha is 0.7, the final prediction result is the best, the degree matrix is a diagonal matrix, and the element values on the diagonal represent the degree of each vertex, wherein I N Is a matrix of units which is a matrix of units,
Figure FDA0004137146100000031
representing the adjacency matrix A plus the identity matrix I N ,/>
Figure FDA0004137146100000032
Representation->
Figure FDA0004137146100000033
The coefficient alpha has a value ranging between 0 and 1.
5. The method for combining time series prediction with neural network for aggregating information differences according to claim 1, wherein: in the third step, the historical passenger flow data of each station and the adjacency matrix of the preprocessed subway network are extracted to extract the spatial characteristics, and the spatial characteristics are expressed by using the following formula
Figure FDA0004137146100000034
By the formula H can be found when l=0 l =x, and W l Represents layer I learnable parameters, and H (l+1) Representing the output of the first layer, while the value will be the input to the next layer, the two-layer neural network is represented using the following formula
Figure FDA0004137146100000035
In the formula
Figure FDA0004137146100000036
W in the formula (0) Is the learning parameter matrix of the first layer neural network, W (1) For the learning parameter matrix of the second layer neural network, X' is time series data with spatial characteristics output by the two-layer graph neural network model, H l Output representing layer i of the graph neural network, σ (·) representing nonlinear activation function, ++>
Figure FDA0004137146100000037
Representing the adjacency matrix A plus the identity matrix I N 、/>
Figure FDA0004137146100000038
Representation->
Figure FDA0004137146100000039
And (3) the degree matrix of each site, wherein X represents the historical passenger flow data matrix of each site input in the step one.
6. The method for combining time series prediction with neural network for aggregating information differences as recited in claim 5, wherein: in the fourth step, a reset gate r is calculated t Calculated by the following formula
r t =σ(W r [X′ t ,h t-1 ]+b r )
W in the formula r And b r Is the parameter matrix and deviation in the training process, and r represents the calculation r t Parameters and deviations of X t ' means that time series data with spatial characteristics at time t are obtained from the graph neural network model.
7. The method for combining time series prediction with neural network for aggregating information differences as recited in claim 5, wherein: in the fifth step, a calculation update gate u is calculated t Calculated by the following formula
u t =σ(W u [X′ t ,h t-1 ]+b u )
W in the formula u And b u Is a parameter matrix and bias in the training process, wherein u represents the calculated u t Parameters and deviations of (a).
8. The method for combining time series prediction with neural network for aggregating information differences as recited in claim 5, wherein: in the sixth step, the gate r is reset t Calculating candidate state c t Calculated by the following formula
c t =tanh(W c [X′ t, (r t *h t-1 )]+b c )
W in the formula c And b c Is the parameter matrix and bias in the training process,wherein c represents the calculation c t Parameter matrix and bias at that time, tanh represents the hyperbolic tangent activation function.
9. The method for combining time series prediction with neural network for aggregating information differences according to claim 1, wherein: in the seventh step, the gate u is updated in the fifth step t And step six candidate state c t To control the state h of the unit at the current time t And is in contact with the cell state h at the last moment t-1 In relation, updating the cell state is performed, calculated by the following formula
h t =u t *h t-1 +(1-u t )*c t
U in the formula t And c t Is the result of the calculation by the procedures of the step five and the step six.
CN202110886769.8A 2021-08-03 2021-08-03 Method for predicting neural network combined time sequence by aggregating information difference Active CN113537626B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110886769.8A CN113537626B (en) 2021-08-03 2021-08-03 Method for predicting neural network combined time sequence by aggregating information difference

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110886769.8A CN113537626B (en) 2021-08-03 2021-08-03 Method for predicting neural network combined time sequence by aggregating information difference

Publications (2)

Publication Number Publication Date
CN113537626A CN113537626A (en) 2021-10-22
CN113537626B true CN113537626B (en) 2023-05-05

Family

ID=78090332

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110886769.8A Active CN113537626B (en) 2021-08-03 2021-08-03 Method for predicting neural network combined time sequence by aggregating information difference

Country Status (1)

Country Link
CN (1) CN113537626B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114330868A (en) * 2021-12-27 2022-04-12 西北工业大学 Passenger flow prediction method based on self-attention personalized enhanced graph convolution network
CN114722334B (en) * 2022-04-11 2022-12-27 哈尔滨工程大学 STFT-based online identification method for gas injection time characteristics of high-pressure natural gas direct injection engine
CN114973653B (en) * 2022-04-27 2023-12-19 中国计量大学 Traffic flow prediction method based on space-time diagram convolutional network

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170214943A1 (en) * 2016-01-22 2017-07-27 Mitsubishi Electric Research Laboratories, Inc. Point Cloud Compression using Prediction and Shape-Adaptive Transforms
CN111126704B (en) * 2019-12-25 2022-07-29 河海大学常州校区 Multi-region precipitation prediction model construction method based on multi-graph convolution and memory network
CN112418547B (en) * 2020-12-03 2024-04-09 北京工业大学 Bus stop passenger flow prediction method based on GCN-LSTM combination model
CN112350899B (en) * 2021-01-07 2021-04-06 南京信息工程大学 Network flow prediction method based on graph convolution network fusion multi-feature input
CN112819213B (en) * 2021-01-22 2022-06-14 华南理工大学 Highway freight volume prediction method and system based on deep learning network

Also Published As

Publication number Publication date
CN113537626A (en) 2021-10-22

Similar Documents

Publication Publication Date Title
CN113537626B (en) Method for predicting neural network combined time sequence by aggregating information difference
CN107529651B (en) Urban traffic passenger flow prediction method and equipment based on deep learning
US20210407284A1 (en) Vehicle traffic flow prediction method with missing data
WO2023056696A1 (en) Urban rail transit short-term passenger flow forecasting method based on recurrent neural network
CN103632212B (en) System and method for predicating time-varying user dynamic equilibrium network-evolved passenger flow
CN110390349A (en) Bus passenger flow volume based on XGBoost model predicts modeling method
CN112489426B (en) Urban traffic flow space-time prediction scheme based on graph convolution neural network
CN108985965A (en) A kind of photovoltaic power interval prediction method of combination neural network and parameter Estimation
CN114330868A (en) Passenger flow prediction method based on self-attention personalized enhanced graph convolution network
CN110299011A (en) A kind of traffic flow forecasting method of the highway arbitrary cross-section based on charge data
CN111242292B (en) OD data prediction method and system based on deep space-time network
CN114692984B (en) Traffic prediction method based on multi-step coupling graph convolution network
CN111242395B (en) Method and device for constructing prediction model for OD (origin-destination) data
US20240143999A1 (en) Multi-modal data prediction method based on causal markov model
CN113380043B (en) Bus arrival time prediction method based on deep neural network calculation
CN107656987A (en) A kind of subway station function method for digging based on LDA models
CN111160622A (en) Scenic spot passenger flow prediction method and device based on hybrid neural network model
CN115204478A (en) Public traffic flow prediction method combining urban interest points and space-time causal relationship
CN110348601A (en) A kind of short-term passenger flow forecast method of subway based on two-way shot and long term memory network
CN107729938A (en) Rail station classification method based on bus connection radiation zone characteristics
CN106504535A (en) A kind of combination Gravity Models and the trip distribution modeling method of Fratar models
CN107832779A (en) Track station classification system
CN114580751B (en) Method, system, storage medium and terminal for predicting evacuation time of passengers arriving at airport
CN114418606A (en) Network taxi appointment order demand prediction method based on space-time convolutional network
Miao et al. A queue hybrid neural network with weather weighted factor for traffic flow prediction

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant