Urban traffic flow prediction method based on Markov clustering graph attention network

A Markov clustering and urban transportation technology, applied in the field of transportation, can solve problems such as abandoning the overall structure and not being able to assign importance to adjacent nodes

Pending Publication Date: 2022-03-18
HEBEI NORMAL UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, there are still deficiencies in these methods. GCN only considers the global structure of the graph, and cannot assign different importance to adjacent nodes. GAT can assign different weight values ​​to adjacent nodes, but to a certain extent, it abandons the overall structure of the graph.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Urban traffic flow prediction method based on Markov clustering graph attention network
  • Urban traffic flow prediction method based on Markov clustering graph attention network
  • Urban traffic flow prediction method based on Markov clustering graph attention network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0055] Attached below figure 1 The present invention will be described in detail.

[0056] Such as figure 1 As shown, an urban traffic flow prediction method based on Markov cluster graph attention network includes the following steps:

[0057] Step 1: According to the historical traffic travel data, construct the structural information of the time series graph for the selected area, and obtain the corresponding flow matrix; the specific operation is divided into the following sub-steps:

[0058] 1.1) Structural map information: first divide the selected area into equidistant small-scale plots, use them as the nodes of the graph structure, set the number of nodes obtained as N, and mark them with 1-N serial numbers in turn; The selected area is divided into small-scale plots of 1km*1km, G={N}, where N={N 1 , N 2 ,...,N N ,} is a set of nodes; the calculation formula for dividing the selected area into equidistant small-scale plots is as follows:

[0059]

[0060]

...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to an urban traffic flow prediction method based on a Markov clustering graph attention network, and the method comprises the following steps: 1, obtaining a time sequence flow matrix according to historical transportation data; 2, natural structure information existing in the graph is extracted based on a Markov clustering algorithm idea, and a global correlation node matrix is obtained; 3, establishing a generative adversarial neural network model, and expanding an improved graph attention module in a model generator to global correlation node information obtained based on a Markov clustering algorithm instead of limiting neighbor nodes in first-order neighbor nodes in a graph attention network when acquiring spatial hidden features; learning the training model, and taking the learned model as a regional traffic flow prediction model; the improved graph attention module not only pays attention to local neighbor nodes, but also dynamically considers neighbor node information in an overall graph structure, and gives different weights to the neighbor nodes, so that the acquisition capability of spatial features is improved.

Description

technical field [0001] The invention relates to a method for predicting urban traffic flow based on a Markov cluster graph attention network, which belongs to the technical field of traffic. Background technique [0002] With the development of the economy and the improvement of people's living standards, the traffic problems caused by travel are becoming more and more serious. The mining and analysis of traffic data has become a hot topic for researchers, and the prediction of traffic data has also become popular. [0003] Traditional statistics-based methods use historical data to predict future trends, such as: Autoregressive Integrated Moving Average (ARIMA) and Kalman Filter (KF), but they cannot handle non-linear traffic data because it is assumed that future predictions are related to The past data have the same characteristics; in recent years, neural network methods based on deep learning, such as graph convolutional neural network (GCN) to extract spatial features ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q10/04G06Q50/30G06N3/04G06N3/08
CPCG06Q10/04G06N3/08G06N3/044G06Q50/40
Inventor 魏志成张韬毅王玉波
Owner HEBEI NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products