Alert button
Picture for Le Zhao

Le Zhao

Alert button

Spatial-Temporal Graph Convolutional Gated Recurrent Network for Traffic Forecasting

Oct 06, 2022
Le Zhao, Mingcai Chen, Yuntao Du, Haiyang Yang, Chongjun Wang

Figure 1 for Spatial-Temporal Graph Convolutional Gated Recurrent Network for Traffic Forecasting
Figure 2 for Spatial-Temporal Graph Convolutional Gated Recurrent Network for Traffic Forecasting
Figure 3 for Spatial-Temporal Graph Convolutional Gated Recurrent Network for Traffic Forecasting
Figure 4 for Spatial-Temporal Graph Convolutional Gated Recurrent Network for Traffic Forecasting

As an important part of intelligent transportation systems, traffic forecasting has attracted tremendous attention from academia and industry. Despite a lot of methods being proposed for traffic forecasting, it is still difficult to model complex spatial-temporal dependency. Temporal dependency includes short-term dependency and long-term dependency, and the latter is often overlooked. Spatial dependency can be divided into two parts: distance-based spatial dependency and hidden spatial dependency. To model complex spatial-temporal dependency, we propose a novel framework for traffic forecasting, named Spatial-Temporal Graph Convolutional Gated Recurrent Network (STGCGRN). We design an attention module to capture long-term dependency by mining periodic information in traffic data. We propose a Double Graph Convolution Gated Recurrent Unit (DGCGRU) to capture spatial dependency, which integrates graph convolutional network and GRU. The graph convolution part models distance-based spatial dependency with the distance-based predefined adjacency matrix and hidden spatial dependency with the self-adaptive adjacency matrix, respectively. Specially, we employ the multi-head mechanism to capture multiple hidden dependencies. In addition, the periodic pattern of each prediction node may be different, which is often ignored, resulting in mutual interference of periodic information among nodes when modeling spatial dependency. For this, we explore the architecture of model and improve the performance. Experiments on four datasets demonstrate the superior performance of our model.

Viaarxiv icon

The Nature of Novelty Detection

Oct 19, 2005
Le Zhao, Min Zhang, Shaoping Ma

Figure 1 for The Nature of Novelty Detection
Figure 2 for The Nature of Novelty Detection
Figure 3 for The Nature of Novelty Detection
Figure 4 for The Nature of Novelty Detection

Sentence level novelty detection aims at reducing redundant sentences from a sentence list. In the task, sentences appearing later in the list with no new meanings are eliminated. Aiming at a better accuracy for detecting redundancy, this paper reveals the nature of the novelty detection task currently overlooked by the Novelty community $-$ Novelty as a combination of the partial overlap (PO, two sentences sharing common facts) and complete overlap (CO, the first sentence covers all the facts of the second sentence) relations. By formalizing novelty detection as a combination of the two relations between sentences, new viewpoints toward techniques dealing with Novelty are proposed. Among the methods discussed, the similarity, overlap, pool and language modeling approaches are commonly used. Furthermore, a novel approach, selected pool method is provided, which is immediate following the nature of the task. Experimental results obtained on all the three currently available novelty datasets showed that selected pool is significantly better or no worse than the current methods. Knowledge about the nature of the task also affects the evaluation methodologies. We propose new evaluation measures for Novelty according to the nature of the task, as well as possible directions for future study.

* This paper pointed out the future direction for novelty detection research. 37 pages, double spaced version 
Viaarxiv icon