GCN-based Methods Research Articles

Combine multi-order representation learning and frame optimization learning for skeleton-based action recognition

Skeleton-based action recognition has broad application prospects in many fields such as virtual reality. Currently, the most popular way is to employ Graph Convolutional Networks (GCNs) or Hypergraph Convolutional Networks (HGCNs) for this task. However, GCN-based methods may heavily rely on the physical connectivity relationship between joints while lack the capture of higher-order information about interactions among distant joints, and HGCN-based methods usually introduce unnecessary noise when capturing low-order information of skeleton structures with simple topology. Besides, the current methods do not deal well with redundant frames and confusing frames. These limitations hinder the improvement of recognition accuracy. In this paper, we propose a novel network, called Hyper-Net, which combines multi-order representation learning and frame optimization learning for skeleton-based action recognition. Specifically, the proposed Hyper-Net contains Temporal-Channel Aggregation Graph Convolution (TCA-GC), Spatial-Temporal Aggregation Hypergraph Convolution (STA-HC) and Frame Optimization Learning (F-OL) modules. The TCA-GC aggregates low-order and local information from simple joint and bone topologies across different temporal and channel dimensions. The STA-HC captures high-order and global information from complex motion streams as well as solving the problem of spatial-temporal weight imbalance. The F-OL can adaptively extract key frames and distinguish confusing frames, thus improving the ability of the network to recognize confusing actions. A large number of experiments are conducted on the NTU RGB+D, NTU RGB+D 120 and NW-UCLA datasets for action recognition task. Experimental results demonstrate the superiority and effectiveness of the proposed network.

Towards attributed graph clustering using enhanced graph and reconstructed graph structure

Attributed graph clustering, leveraging both structural and attribute information, is crucial in various real-world applications. However, current approaches face challenges stemming from the sparsity of graphs and sensitivity to noise in Graph Convolutional Networks (GCNs). Moreover, GCN-based methods are often designed based on the assumption of homophilic graph and ignore heterophilic graph. To address these, we propose a graph clustering method that consists of four phases: graph enhance, graph reconstruction, graph refine, and dual-guidance supervisor module. An enhanced graph module is defined by an auxiliary graph to consider distant relationships in the topology structure to alleviate the limitations of sparse graphs. The graph reconstruction phase includes the creation and integration of homophily and heterophily graphs to achieve graph-agnostic. In graph refine, the auxiliary graph is iteratively improved to enhance the generalization of the representation. In this phase, a subspace clustering module is applied to convert attribute-based embeddings into relationship-based representations. Finally, the extracted graphs are fed to a dual-guidance supervisor module to obtain the final clustering result. Experimental validation on several benchmark datasets demonstrates the efficiency of our model. Meanwhile, the findings offer significant advancements in attributed graph clustering, promising improved applicability in various domains.

Attention-based stackable graph convolutional network for multi-view learning

In multi-view learning, graph-based methods like Graph Convolutional Network (GCN) are extensively researched due to effective graph processing capabilities. However, most GCN-based methods often require complex preliminary operations such as sparsification, which may bring additional computation costs and training difficulties. Additionally, as the number of stacking layers increases in most GCN, over-smoothing problem arises, resulting in ineffective utilization of GCN capabilities. In this paper, we propose an attention-based stackable graph convolutional network that captures consistency across views and combines attention mechanism to exploit the powerful aggregation capability of GCN to effectively mitigate over-smoothing. Specifically, we introduce node self-attention to establish dynamic connections between nodes and generate view-specific representations. To maintain cross-view consistency, a data-driven approach is devised to assign attention weights to views, forming a common representation. Finally, based on residual connectivity, we apply an attention mechanism to the original projection features to generate layer-specific complementarity, which compensates for the information loss during graph convolution. Comprehensive experimental results demonstrate that the proposed method outperforms other state-of-the-art methods in multi-view semi-supervised tasks.

Cluster-based Graph Collaborative Filtering

Graph Convolution Networks (GCNs) have significantly succeeded in learning user and item representations for recommendation systems. The core of their efficacy is the ability to explicitly exploit the collaborative signals from both the first- and high-order neighboring nodes. However, most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. Thus, the noisy information from unreliable neighbor nodes ( \(e.g.\) , users with dissimilar interests) negatively impacts the representation learning of the target node. Additionally, conducting graph convolution operations without differentiating high-order neighbors suffers the over-smoothing issue when stacking more layers, resulting in performance degradation. In this paper, we aim to capture more valuable information from high-order neighboring nodes while avoiding noise for better representation learning of the target node. To achieve this goal, we propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF). This model performs high-order graph convolution on cluster-specific graphs, which are constructed by capturing the multiple interests of users and identifying the common interests among them. Specifically, we design an unsupervised and optimizable soft node clustering approach to classify user and item nodes into multiple clusters. Based on the soft node clustering results and the topology of the user-item interaction graph, we assign the nodes with probabilities for different clusters to construct the cluster-specific graphs. To evaluate the effectiveness of ClusterGCF, we conducted extensive experiments on four publicly available datasets. Experimental results demonstrate that our model can significantly improve recommendation performance.

Contrastive optimized graph convolution network for traffic forecasting

Traffic forecasting is an increasingly important research topic in the field of Intelligent Transportation Systems (ITS). In this field, prediction models based on Graph Convolution Networks (GCN) have become very popular. Most GCN-based models focus on constructing various optimized or dynamic road network graphs to represent the spatio-temporal correlation hidden in traffic data. However, these methods currently only consider the construction of a single improved road network graph and ignore the relationship of these existing optimized road network graphs. Therefore, in this paper, we propose a Contrastive Optimized Graph Convolution Network (COGCN) to connect two kinds of optimized road network graphs and maintain their global–local feature consistency through contrastive learning. The proposed COGCN model is evaluated in detail using four real traffic datasets: two traffic speed datasets and two traffic flow datasets. Experimental results show that COGCN improves forecasting accuracy by at least 2% on the two speed datasets and 9% on the two flow datasets compared to the existing state-of-the-art GCN-based methods.

Tacking over-smoothing: Target-guide progressive dynamic graph learning for 3D skeleton-based human motion prediction

Graph Convolution Network-based (GCN-based) approaches show promising performance on 3D skeleton-based human motion prediction due to its natural graph representation and outstanding ability for spatial–temporal dependencies modeling for human motion. However, the existing GCN-based methods inherently have difficulties in designing deep GCN-based structures for human motion prediction due to the over-smoothing issue. Although the over-smoothing issue has been studied in many scenarios, few attempts focus on this problem in 3D human motion prediction tasks. Therefore, we propose a novel deep GCN architecture termed TPDGN (Target-guide Progressive Dynamic Graph Network) to solve this issue in a motion prediction context. The core of the proposed TPDGN is the progressive dynamic graph leaning block, which is developed to model the dynamic graph pattern. We claim that the key to solving the over-smoothing issue is to reduce the loss of motion features and boost graph representations. Accordingly, we further explore the progressive learning mode by the specific target guidance for the motion prediction task, which aims at learning rich motion dependencies to tackle over-smoothing. Empirical results show that our approach could improve the over-smoothing issue, achieving state-of-the-art results on three public datasets. The codes is available at https://github.com/1111szu/TPDGN.

Graph Convolutional Network for Image Restoration: A Survey

Image restoration technology is a crucial field in image processing and is extensively utilized across various domains. Recently, with advancements in graph convolutional network (GCN) technology, methods based on GCNs have increasingly been applied to image restoration, yielding impressive results. Despite these advancements, there is a gap in comprehensive research that consolidates various image denoising techniques. In this paper, we conduct a comparative study of image restoration techniques using GCNs. We begin by categorizing GCN methods into three primary application areas: image denoising, image super-resolution, and image deblurring. We then delve into the motivations and principles underlying various deep learning approaches. Subsequently, we provide both quantitative and qualitative comparisons of state-of-the-art methods using public denoising datasets. Finally, we discuss potential challenges and future directions, aiming to pave the way for further advancements in this domain. Our key findings include the identification of superior performance of GCN-based methods in capturing long-range dependencies and improving image quality across different restoration tasks, highlighting their potential for future research and applications.

Multiscale Feature Search-Based Graph Convolutional Network for Hyperspectral Image Classification

With the development of hyperspectral sensors, the availability of hyperspectral images (HSIs) has increased significantly, prompting advancements in deep learning-based hyperspectral image classification (HSIC) methods. Recently, graph convolutional networks (GCNs) have been proposed to process graph-structured data in non-Euclidean domains, and have been used for HSIC. The superpixel segmentation should be implemented first in the GCN-based methods, however, it is difficult to manually select the optimal superpixel segmentation sizes to obtain the useful information for classification. To solve this problem, we constructed a HSIC model based on a multiscale feature search-based graph convolutional network (MFSGCN) in this study. Firstly, pixel-level features of HSIs are extracted sequentially using 3D asymmetric decomposition convolution and 2D convolution. Then, superpixel-level features at different scales are extracted using multilayer GCNs. Finally, the neural architecture search (NAS) method is used to automatically assign different weights to different scales of superpixel features. Thus, a more discriminative feature map is obtained for classification. Compared with other GCN-based networks, the MFSGCN network can automatically capture features and obtain higher classification accuracy. The proposed MFSGCN model was implemented on three commonly used HSI datasets and compared to some state-of-the-art methods. The results confirm that MFSGCN effectively improves accuracy.

PGCNMDA: Learning node representations along paths with graph convolutional network for predicting miRNA-disease associations

Identifying miRNA-disease associations (MDAs) is crucial for improving the diagnosis and treatment of various diseases. However, biological experiments can be time-consuming and expensive. To overcome these challenges, computational approaches have been developed, with Graph Convolutional Network (GCN) showing promising results in MDA prediction. The success of GCN-based methods relies on learning a meaningful spatial operator to extract effective node feature representations. To enhance the inference of MDAs, we propose a novel method called PGCNMDA, which employs graph convolutional networks with a learning graph spatial operator from paths. This approach enables the generation of meaningful spatial convolutions from paths in GCN, leading to improved prediction performance. On HMDD v2.0, PGCNMDA obtains a mean AUC of 0.9229 and an AUPRC of 0.9206 under 5-fold cross-validation (5-CV), and a mean AUC of 0.9235 and an AUPRC of 0.9212 under 10-fold cross-validation (10-CV), respectively. Additionally, the AUC of PGCNMDA also reaches 0.9238 under global leave-one-out cross-validation (GLOOCV). On HMDD v3.2, PGCNMDA obtains a mean AUC of 0.9413 and an AUPRC of 0.9417 under 5-CV, and a mean AUC of 0.9419 and an AUPRC of 0.9425 under 10-CV, respectively. Furthermore, the AUC of PGCNMDA also reaches 0.9415 under GLOOCV. The results show that PGCNMDA is superior to other compared methods. In addition, the case studies on pancreatic neoplasms, thyroid neoplasms and leukemia show that 50, 50 and 48 of the top 50 predicted miRNAs linked to these diseases are confirmed, respectively. It further validates the effectiveness and feasibility of PGCNMDA in practical applications.

ARFGCN: Adaptive Receptive Field Graph Convolutional Network for Urban Crowd Flow Prediction

Urban crowd flow prediction is an important task for transportation systems and public safety. While graph convolutional networks (GCNs) have been widely adopted for this task, existing GCN-based methods still face challenges. Firstly, they employ fixed receptive fields, failing to account for urban region heterogeneity where different functional zones interact distinctly with their surroundings. Secondly, they lack mechanisms to adaptively adjust spatial receptive fields based on temporal dynamics, which limits prediction performance. To address these limitations, we propose an Adaptive Receptive Field Graph Convolutional Network (ARFGCN) for urban crowd flow prediction. ARFGCN allows each region to independently determine its receptive field size, adaptively adjusted and learned in an end-to-end manner during training, enhancing model prediction performance. It comprises a time-aware adaptive receptive field (TARF) gating mechanism, a stacked 3DGCN, and a prediction layer. The TARF aims to leverage gating in neural networks to adapt receptive fields based on temporal dynamics, enabling the predictive network to adapt to urban regional heterogeneity. The TARF can be easily integrated into the stacked 3DGCN, enhancing the prediction. Experimental results demonstrate ARFGCN’s effectiveness compared to other methods.

DualGCN: Exploring Syntactic and Semantic Information for Aspect-Based Sentiment Analysis.

The task of aspect-based sentiment analysis aims to identify sentiment polarities of given aspects in a sentence. Recent advances have demonstrated the advantage of incorporating the syntactic dependency structure with graph convolutional networks (GCNs). However, their performance of these GCN-based methods largely depends on the dependency parsers, which would produce diverse parsing results for a sentence. In this article, we propose a dual GCN (DualGCN) that jointly considers the syntax structures and semantic correlations. Our DualGCN model mainly comprises four modules: 1) SynGCN: instead of explicitly encoding syntactic structure, the SynGCN module uses the dependency probability matrix as a graph structure to implicitly integrate the syntactic information; 2) SemGCN: we design the SemGCN module with multihead attention to enhance the performance of the syntactic structure with the semantic information; 3) Regularizers: we propose orthogonal and differential regularizers to precisely capture semantic correlations between words by constraining attention scores in the SemGCN module; and 4) Mutual BiAffine: we use the BiAffine module to bridge relevant information between the SynGCN and SemGCN modules. Extensive experiments are conducted compared with up-to-date pretrained language encoders on two groups of datasets, one including Restaurant14, Laptop14, and Twitter and the other including Restaurant15 and Restaurant16. The experimental results demonstrate that the parsing results of various dependency parsers affect their performance of the GCN-based models. Our DualGCN model achieves superior performance compared with the state-of-the-art approaches. The source code and preprocessed datasets are provided and publicly available on GitHub (see https://github.com/CCChenhao997/DualGCN-ABSA).

DyGCN: Efficient Dynamic Graph Embedding With Graph Convolutional Network.

Graph embedding, aiming to learn low-dimensional representations (aka. embeddings) of nodes in graphs, has received significant attention. In recent years, there has been a surge of efforts, among which graph convolutional networks (GCNs) have emerged as an effective class of models. However, these methods mainly focus on the static graph embedding. In the present work, an efficient dynamic graph embedding approach is proposed, called dynamic GCN (DyGCN), which is an extension of the GCN-based methods. The embedding propagation scheme of GCN is naturally generalized to a dynamic setting in an efficient manner, which propagates the change in topological structure and neighborhood embeddings along the graph to update the node embeddings. The most affected nodes are updated first, and then their changes are propagated to further nodes, which in turn are updated. Extensive experiments on various dynamic graphs showed that the proposed model can update the node embeddings in a time-saving and performance-preserving way.

Multi-Modal Enhancement Transformer Network for Skeleton-Based Human Interaction Recognition.

Skeleton-based human interaction recognition is a challenging task in the field of vision and image processing. Graph Convolutional Networks (GCNs) achieved remarkable performance by modeling the human skeleton as a topology. However, existing GCN-based methods have two problems: (1) Existing frameworks cannot effectively take advantage of the complementary features of different skeletal modalities. There is no information transfer channel between various specific modalities. (2) Limited by the structure of the skeleton topology, it is hard to capture and learn the information about two-person interactions. To solve these problems, inspired by the human visual neural network, we propose a multi-modal enhancement transformer (ME-Former) network for skeleton-based human interaction recognition. ME-Former includes a multi-modal enhancement module (ME) and a context progressive fusion block (CPF). More specifically, each ME module consists of a multi-head cross-modal attention block (MH-CA) and a two-person hypergraph self-attention block (TH-SA), which are responsible for enhancing the skeleton features of a specific modality from other skeletal modalities and modeling spatial dependencies between joints using the specific modality, respectively. In addition, we propose a two-person skeleton topology and a two-person hypergraph representation. The TH-SA block can embed their structural information into the self-attention to better learn two-person interaction. The CPF block is capable of progressively transforming the features of different skeletal modalities from low-level features to higher-order global contexts, making the enhancement process more efficient. Extensive experiments on benchmark NTU-RGB+D 60 and NTU-RGB+D 120 datasets consistently verify the effectiveness of our proposed ME-Former by outperforming state-of-the-art methods.

Multi-scale feature learning via residual dynamic graph convolutional network for hyperspectral image classification

ABSTRACT Thanks to the relevant spectral-spatial information, hyperspectral images (HSIs) have been widely exploited in Earth observation. Recently, graph convolutional networks (GCNs) have attracted increasing attention in HSI classification due to their advantages in processing non-Euclidean structure data. Unlike convolutional neural networks (CNNs), which perform convolution operations on regular square regions, GCNs can directly work on graph structure data to extract the relationships among adjacent land covers. However, extracting meaningful and deep discriminative spectral-spatial features from HSIs is still a challenging task. In this article, a novel multi-scale feature learning via residual dynamic graph convolutional network is designed for HSI classification, which can extract large-scale contextual spatial structures at superpixel-level graph and local spectral-spatial information at pixel-level, significantly improving the performance of HSI classification. Unlike from the existing GCN-based methods that operate on a graph with a fixed neighbourhood size, multiple graphs with diverse neighbourhood scales are built to comprehensively leverage spectral-spatial information and relationship at multiple scales, and these graphs are dynamically updated to generate more discriminative features (via dynamic GCN) during the convolution process. Moreover, to fully use the multi-scale features extracted from HSIs, a multi-scale feature fusion module is developed to emphasize important features and suppress irrelevant ones. Extensive experiments carried on three benchmark data sets demonstrate the superiority of the proposed approach over other state-of-the-art methods.

Less is More: Removing Redundancy of Graph Convolutional Networks for Recommendation

While Graph Convolutional Networks (GCNs) have shown great potential in recommender systems and collaborative filtering (CF), they suffer from expensive computational complexity and poor scalability. On top of that, recent works mostly combine GCNs with other advanced algorithms which further sacrifice model efficiency and scalability. In this work, we unveil the redundancy of existing GCN-based methods in three aspects: (1) Feature redundancy . By reviewing GCNs from a spectral perspective, we show that most spectral graph features are noisy for recommendation, while stacking graph convolution layers can suppress but cannot completely remove the noisy features, which we mostly summarize from our previous work; (2) Structure redundancy . By providing a deep insight into how user/item representations are generated, we show that what makes them distinctive lies in the spectral graph features, while the core idea of GCNs (i.e., neighborhood aggregation) is not the reason making GCNs effective; and (3) Distribution redundancy . Following observations from (1), we further show that the number of required spectral features is closely related to the spectral distribution, where important information tends to be concentrated in more (fewer) spectral features on a flatter (sharper) distribution. To make important information be concentrated in as few features as possible, we sharpen the spectral distribution by increasing the node similarity without changing the original data, thereby reducing the computational cost. To remove these three kinds of redundancies, we propose a Simplified Graph Denoising Encoder (SGDE) only exploiting the top- K singular vectors without explicitly aggregating neighborhood, which significantly reduces the complexity of GCN-based methods. We further propose a scalable contrastive learning framework to alleviate data sparsity and to boost model robustness and generalization, leading to significant improvement. Extensive experiments on three real-world datasets show that our proposed SGDE not only achieves state-of-the-art but also shows higher scalability and efficiency than our previously proposed GDE as well as traditional and GCN-based CF methods.

An attention-based adaptive spatial–temporal graph convolutional network for long-video ergonomic risk assessment

Ergonomic risk assessment (ERA) is commonly used to identify and analyze postures that are detrimental to the health of workers in industrial workplaces, which is vital to prevent work-related musculoskeletal disorders (WMSDs). Among the automatic approaches, algorithms based on graph convolutional networks (GCNs) have shown promising results in ERA using skeleton sequence as input. However, previous GCN-based methods still have certain limitations. First, the separated modeling of spatial and temporal information and the manually pre-defined topology of graph may restrict the representation diversity of the networks. Additionally, RNN-based temporal modeling often incurs high computational costs and fails to capture long-range temporal dependencies, thereby reducing flexibility in describing long videos. To overcome these challenges, in this study, we propose an attention-based adaptive spatial–temporal graph convolutional network (AAST-GCN), aiming to achieve effective and efficient action representation for ERA in long video. First, we employ an alternate modeling strategy to effectively capture the spatial–temporal information, and propose an improved adaptive adjacency matrix scheme to learn various coordination and relations of body-joints, thus enhancing the flexibility to model diverse postures. Furthermore, we introduce an efficient multi-scale temporal convolutional network as a replacement for RNN-based algorithms, enabling the network to extract various granularities of temporal features. Moreover, to make the network focuses on more valuable information, we employ a spatial–temporal interaction attention (STIA) module. Finally, the aforementioned modules are aggregated within a multi-task learning framework, with the action segmentation serving as the auxiliary task to further improve the accuracy of ERA. We conducted the ergonomic risk assessment on the UW-IOM and TUM Kitchen datasets using our network. Extensive experiments conducted on the most popular datasets UW-IOM and TUM Kitchen demonstrated that our proposed AAST-GCN outperforms other GCN-based methods. Ablation studies and visualization also prove the effectiveness of the individual sub-modules.

Learnable Graph Convolutional Network With Semisupervised Graph Information Bottleneck.

Graph convolutional network (GCN) has gained widespread attention in semisupervised classification tasks. Recent studies show that GCN-based methods have achieved decent performance in numerous fields. However, most of the existing methods generally adopted a fixed graph that cannot dynamically capture both local and global relationships. This is because the hidden and important relationships may not be directed exhibited in the fixed structure, causing the degraded performance of semisupervised classification tasks. Moreover, the missing and noisy data yielded by the fixed graph may result in wrong connections, thereby disturbing the representation learning process. To cope with these issues, this article proposes a learnable GCN-based framework, aiming to obtain the optimal graph structures by jointly integrating graph learning and feature propagation in a unified network. Besides, to capture the optimal graph representations, this article designs dual-GCN-based meta-channels to simultaneously explore local and global relations during the training process. To minimize the interference of the noisy data, a semisupervised graph information bottleneck (SGIB) is introduced to conduct the graph structural learning (GSL) for acquiring the minimal sufficient representations. Concretely, SGIB aims to maximize the mutual information of both the same and different meta-channels by designing the constraints between them, thereby improving the node classification performance in the downstream tasks. Extensive experimental results on real-world datasets demonstrate the robustness of the proposed model, which outperforms state-of-the-art methods with fixed-structure graphs.

Dynamic Dense Graph Convolutional Network for Skeleton-Based Human Motion Prediction.

Graph Convolutional Networks (GCN) which typically follows a neural message passing framework to model dependencies among skeletal joints has achieved high success in skeleton-based human motion prediction task. Nevertheless, how to construct a graph from a skeleton sequence and how to perform message passing on the graph are still open problems, which severely affect the performance of GCN. To solve both problems, this paper presents a Dynamic Dense Graph Convolutional Network (DD-GCN), which constructs a dense graph and implements an integrated dynamic message passing. More specifically, we construct a dense graph with 4D adjacency modeling as a comprehensive representation of motion sequence at different levels of abstraction. Based on the dense graph, we propose a dynamic message passing framework that learns dynamically from data to generate distinctive messages reflecting sample-specific relevance among nodes in the graph. Extensive experiments on benchmark Human 3.6M and CMU Mocap datasets verify the effectiveness of our DD-GCN which obviously outperforms state-of-the-art GCN-based methods, especially when using long-term and our proposed extremely long-term protocol.

Hierarchical Graph Convolutional Networks With Latent Structure Learning for Mechanical Fault Diagnosis

Industrial sensor signals are essentially non-Euclidean graph structures due to the interplay between process variables; thus, graph convolutional networks (GCNs) have been widely studied and applied. However, most of the existing GCN-based methods may suffer from two drawbacks: 1) it is difficult to characterize multiple interactions among nodes and 2) the input graph constructed from the original data may contain errors and missing edges, which will degenerate the fault diagnosis performance. To address the abovementioned issues, this article designs a hierarchical GCN with latent structure learning for industrial fault diagnosis, which can organize hierarchical networks to collaboratively improve the quality of latent graph structure, and enhanced diagnostic performance can be guaranteed. First, a high-quality updated graph is formed by incorporating the original graph with the new graph in the graph constructing layer, which can not only eliminate the adverse effects of noise and outliers but also characterize the multiple interactions among nodes. Then, the updated graph is fed into the multilayer GCN layer for better feature learning and enhances the node representation through intra- and inter-layer convolutional operations simultaneously. After that, the produced node embeddings are used to guide the latent structure learning process for optimal graph. Finally, the proposed method is verified in both the simulated and real industrial processes. The experimental results demonstrate that the new approach has better fault diagnosis accuracy and practicability than state-of-the-art methods.

Metro Station functional clustering and dual-view recurrent graph convolutional network for metro passenger flow prediction

The metro system is indispensable for alleviating traffic congestion in the urban transportation system. Precise metro passenger flow (MPF) prediction is crucial in ensuring smooth operations of the metro system. Recently, the graph convolutional network (GCN), which is effective in the spatial feature extraction, has been applied in traffic prediction. However, most existing GCN-based methods construct the empirical graphs based on distance and adjacency, which cannot fully express the correlations of metro stations. This paper proposes a novel MPF prediction method consisting of three parts: K-means-based metro station functional clustering (KMSFC), external feature fusion, and dual-view recurrent GCN (DVRGCN). The KMSFC identifies the metro stations both having similar MPF changing tendencies and being located in similar urban functional areas. Furthermore, the DVRGCN is designed to simultaneously capture the spatiotemporal and external features. The dual-view GCN module in the DVRGCN captures both explicit and implicit spatial features of the metro traffic network. To demonstrate the capability for making accurate MPF predictions, the experiments using a real-world metro traffic dataset are conducted. The ablation experiments are also performed to prove the contribution of each module in the proposed method. The experimental results show that the proposed method outperforms other state-of-the-art traffic prediction methods.