Features Of Nodes Research Articles

Radiology-Pathology Concordance and Prognostication of Nodal Features in pN+ Oral Cavity Cancer.

The aims of our study are to evaluate the diagnostic performance and prognostic value of radiological lymph node (LN) characteristics in pN+ oral cavity squamous carcinoma (OSCC). pN+ OSCC treated between 2012 and 2020 were included. Preoperative imaging was reviewed by a single radiologist blinded to pathologic findings for the following nodal features: imaging-positive LN (iN+), laterality and total number, and image-identified extranodal extension (iENE). The sensitivity of iN+ for pN+ was calculated. The diagnostic performance of other nodal features was evaluated in the iN+ subgroup. The association of radiologic nodal features with overall survival (OS) was evaluated. Inter-rater kappa for radiologic nodal features was assessed in 100 randomly selected cases. Of 406 pN+ OSCC, 288 were iN+. The sensitivity of iN+ for pN+ was 71% overall, and improved to 89% for pN+ LN >1.5 cm. Within iN+, sensitivity/specificity for LN size (>3 cm), total LN number (>4), and ENE were 0.44/0.95, 0.57/0.84, and 0.27/0.96, respectively. Sensitivity of iENE was higher in the subset, with major (>2 mm) versus minor (≤2 mm) pENE (43% vs. 13%, p = 0.001). Reduced OS was observed in iN+ versus iN- (p = 0.006), iENE+ versus iENE- (p = 0.004), LN size >3 versus ≤3 cm (p < 0.001), and higher LN number (p < 0.001). Inter-rater kappa for iN+, laterality, total LN number, and presence of iENE were 0.71, 0.57, 0.78, and 0.69, respectively. Our study shows that despite modest sensitivity of most radiological nodal features, the specificity of image-identified nodal features is high and their prognostic values are retained in pN+ OSCC. 3 (retrospective review comparing cases and controls) Laryngoscope, 134:4947-4955, 2024.

ACGRHA-Net: Accelerated Multi-Contrast MR Imaging with Adjacency Complementary Graph assisted Residual Hybrid Attention Network

Multi-contrast magnetic resonance (MR) imaging is an advanced technology used in medical diagnosis, but the long acquisition process can lead to patient discomfort and limit its broader application. Shortening acquisition time by undersampling k-space data introduces noticeable aliasing artifacts. To address this, we propose a method that reconstructs multi-contrast MR images from zero-filled data by utilizing a fully-sampled auxiliary contrast MR image as a prior to learn an adjacency complementary graph. This graph is then combined with a residual hybrid attention network, forming the adjacency complementary graph assisted residual hybrid attention network (ACGRHA-Net) for multi-contrast MR image reconstruction. Specifically, the optimal structural similarity is represented by a graph learned from the fully sampled auxiliary image, where the node features and adjacency matrices are designed to precisely capture structural information among different contrast images. This structural similarity enables effective fusion with the target image, improving the detail reconstruction. Additionally, a residual hybrid attention module is designed in parallel with the graph convolution network, allowing it to effectively capture key features and adaptively emphasize these important features in target contrast MR images. This strategy prioritizes crucial information while preserving shallow features, thereby achieving comprehensive feature fusion at deeper levels to enhance multi-contrast MR image reconstruction. Extensive experiments on the different datasets, using various sampling patterns and accelerated factors demonstrate that the proposed method outperforms the current state-of-the-art reconstruction methods.

Graph Multi-Convolution and Attention Pooling for Graph Classification.

Many studies have achieved excellent performance in analyzing graph-structured data. However, learning graph-level representations for graph classification is still a challenging task. Existing graph classification methods usually pay less attention to the fusion of node features and ignore the effects of different-hop neighborhoods on nodes in the graph convolution process. Moreover, they discard some nodes directly during the graph pooling process, resulting in the loss of graph information. To tackle these issues, we propose a new Graph Multi-Convolution and Attention Pooling based graph classification method (GMCAP). Specifically, the designed Graph Multi-Convolution (GMConv) layer explicitly fuses node features learned from different perspectives. The proposed weight-based aggregation module combines the outputs of all GMConv layers, for adaptively exploiting the information over different-hop neighborhoods to generate informative node representations. Furthermore, the designed Local information and Global Attention based Pooling (LGAPool) utilizes the local information of a graph to select several important nodes and aggregates the information of unselected nodes to the selected ones by a global attention mechanism when reconstructing a pooled graph, thus effectively reducing the loss of graph information. Extensive experiments show that GMCAP outperforms the state-of-the-art methods on graph classification tasks, demonstrating that GMCAP can learn graph-level representations effectively.

Graph Regulation Network for Point Cloud Segmentation.

In point cloud, some regions typically exist nodes from multiple categories, i.e., these regions have both homophilic and heterophilic nodes. However, most existing methods ignore the heterophily of edges during the aggregation of the neighborhood node features, which inevitably mixes unnecessary information of heterophilic nodes and leads to blurred boundaries of segmentation. To address this problem, we model the point cloud as a homophilic-heterophilic graph and propose a graph regulation network (GRN) to produce finer segmentation boundaries. The proposed method can adaptively adjust the propagation mechanism with the degree of neighborhood homophily. Moreover, we build a prototype feature extraction module, which is utilised to mine the homophily features of nodes from the global prototype space. Theoretically, we prove that our convolution operation can constrain the similarity of representations between nodes based on their degree of homophily. Extensive experiments on fully and weakly supervised point cloud semantic segmentation tasks demonstrate that our method achieves satisfactory performance. Especially in the case of weak supervision, that is, each sample has only 1%-10% labeled points, the proposed method has a significant improvement in segmentation performance.

Features of Lateral Pelvic Lymph Nodes Associated With Pathological Involvement After Total Neoadjuvant Therapy in Patients Undergoing Lateral Pelvic Lymph Node Dissection

BACKGROUND: There is a lack of consensus regarding treating involved lateral pelvic lymph nodes in rectal cancer. OBJECTIVE: This study aimed to evaluate the clinical and magnetic resonance imaging-based factors associated with pathological lateral pelvic lymph node metastasis in patients undergoing total neoadjuvant therapy and lateral pelvic lymph node dissection. DESIGN: This is a retrospective study. SETTINGS: This study was conducted at a single comprehensive cancer center. PATIENTS: A total of 107 patients with advanced low rectal cancer with pretreatment enlarged lateral pelvic lymph nodes (≥7 mm in long-axis) undergoing total neoadjuvant therapy with long-course chemoradiotherapy, followed by total mesorectal excision and lateral pelvic lymph node dissection, were enrolled. MAIN OUTCOME MEASURES: Pathological lateral pelvic lymph node metastasis and survival. RESULTS: Among 107 patients, 48 had a short-axis lateral node diameter &lt;7 mm at baseline, while 59 had ≥7 mm. The ≥7 mm group showed significantly higher rates of pathological lateral pelvic lymph node metastasis (44.1% vs. 2.1%; p &lt; 0.0001). In this group, pathological lateral pelvic lymph node metastasis was independently associated with pre-treatment malignant features and post-treatment short-axis diameter ≥4 mm. Five-year relapse-free survival was significantly lower in patients with post-treatment lateral node diameter ≥ 4 mm than those with &lt;4 mm (71.1% vs. 86.2%, p = 0.0364). Patients with pathological lateral pelvic lymph node metastasis had significantly lower overall survival, relapse-free survival, and local recurrence-free survival rates. LIMITATIONS: Selection bias exists in a retrospective analysis. CONCLUSIONS: Pathological lateral pelvic lymph node metastasis is rare in patients with pre-treatment short-axis diameter &lt;7 mm. In patients with pre-treatment short-axis diameter ≥7 mm, pre-treatment malignant features and post-treatment short-axis diameter are both associated with pathological lateral pelvic lymph node metastasis. These factors should be considered when deciding whether to proceed with lateral pelvic lymph node dissection after total neoadjuvant therapy. See Video Abstract.

A Research Approach to Port Information Security Link Prediction Based on HWA Algorithm

For the protection of information security, link prediction, as a basic problem of network science, has important application significance. However, most of the existing link prediction algorithms rely on the node information of the graph structure, which is not applicable in some graph structure data involving privacy. At the same time, most of the algorithms only consider the general graph structure and do not fully consider the high-order information in the graph. Because of this, this paper proposes an algorithm called hypergraph-based link prediction with self-attention (HWA) to solve the above problems. The algorithm can obtain hypergraphs without knowing the attribute information of hypergraph nodes and combines the graph convolutional network (GCN) framework to capture node feature information for link prediction. Experiments show that the HWA algorithm proposed in this paper, combined with the GCN framework, shows better link prediction performance than other graph-based neural network benchmark algorithms on eight real networks. This further verifies the validity and reliability of the model in this paper and provides new protection ideas and technical means for information security.

Masked Graph Autoencoder for Self‐Supervised Transportation Mode Recognition

ABSTRACTTransportation mode recognition reveals the traveling patterns of urban residents and plays an important role in travel analysis and city planning. Research has been done to identify transportation modes using deep learning methods. However, large‐scale and far‐ranging labeled trajectory data are hard to acquire, which hinders the training and application of supervised models. In this study, we propose a self‐supervised method for trajectory transportation modes recognition. First, we construct sequence and dependency graph for trajectory points. Next, we apply mask and remask strategy to graph node features to enhance its learning ability in semantic information. Notably, in order to learn features without labeled data, we introduce graph autoencoder into the framework. This method is able to learn the sequence and dependency feature reconstruction of the travel paths. It can obtain underlying semantic information with the mask and remask strategy. We applied our model to GPS trajectory dataset from the Microsoft GeoLife Project, achieving an average accuracy of 68.26% in identifying the transportation modes among seven categories. The result indicates that the proposed method offers a solution to identifying transportation modes without abundant labeled data. This method can also help to extract space–time features at different scales from trajectory data, which could be applied to various downstream tasks.

Graph neural link predictor based on cycle structure

AbstractCurrently, the link prediction algorithms primarily focus on studying the interaction between nodes based on chain structure and star structure, which predominantly rely on low‐order structural information and do not explore the multivariate interactions between nodes from the perspective of higher‐order structural information present in the network. The cycle structure is a higher‐order structure that lies between the star and clique structures, where all nodes within the same cycle can interact with each other, even in the absence of direct edges. If a node is encompassed by multiple cycles, it indicates that the node interacts and associates with a greater number of nodes in the network, and it means the node is more important in the network to some extent. Furthermore, if two nodes are included in multiple cycles, it signifies the two nodes are more likely to be connected. Therefore, firstly, a multi‐information fusion node importance algorithm based on the cycle structure information is proposed, which integrates both high‐order and low‐order structural information. Secondly, the obtained integrated structure information and node feature information is regarded as the input features, a two‐channel graph neural network model is designed to learn the cycle structure information. Then, the cycle structure information is utilised for the task of link prediction, and a graph neural link predictor with multi‐information interactions based on the cycle structure is developed. Finally, extensive experimental validation and analysis show that the node ranking result of the proposed node importance index is more consistent with the actual situation, the proposed graph neural network model can effectively learn the cycle structure information, and using higher‐order structural information—cycle information proves to significantly enhance the overall link prediction performance.

Diagnostic accuracy of radiomics and artificial intelligence models in diagnosing lymph node metastasis in head and neck cancers: a systematic review and meta-analysis.

Head and neck cancers are the seventh most common globally, with lymph node metastasis (LNM) being a critical prognostic factor, significantly reducing survival rates. Traditional imaging methods have limitations in accurately diagnosing LNM. This meta-analysis aims to estimate the diagnostic accuracy of Artificial Intelligence (AI) models in detecting LNM in head and neck cancers. A systematic search was performed on four databases, looking for studies reporting the diagnostic accuracy of AI models in detecting LNM in head and neck cancers. Methodological quality was assessed using the METRICS tool and meta-analysis was performed using bivariate model in R environment. 23 articles met the inclusion criteria. Due to the absence of external validation in most studies, all analyses were confined to internal validation sets. The meta-analysis revealed a pooled AUC of 91% for CT-based radiomics, 84% for MRI-based radiomics, and 92% for PET/CT-based radiomics. Sensitivity and specificity were highest for PET/CT-based models. The pooled AUC was 92% for deep learning models and 91% for hand-crafted radiomics models. Models based on lymph node features had a pooled AUC of 92%, while those based on primary tumor features had an AUC of 89%. No significant differences were found between deep learning and hand-crafted radiomics models or between lymph node and primary tumor feature-based models. Radiomics and deep learning models exhibit promising accuracy in diagnosing LNM in head and neck cancers, particularly with PET/CT. Future research should prioritize multicenter studies with external validation to confirm these results and enhance clinical applicability.

A Model-Agnostic Graph Neural Network for Integrating Local and Global Information

Graph Neural Networks (GNNs) have achieved promising performance in a variety of graph-focused tasks. Despite their success, however, existing GNNs suffer from two significant limitations: a lack of interpretability in their results due to their black-box nature, and an inability to learn representations of varying orders. To tackle these issues, we propose a novel Model-agnostic Graph Neural Network (MaGNet) framework, which is able to effectively integrate information of various orders, extract knowledge from high-order neighbors, and provide meaningful and interpretable results by identifying influential compact graph structures. In particular, MaGNet consists of two components: an estimation model for the latent representation of complex relationships under graph topology, and an interpretation model that identifies influential nodes, edges, and node features. Theoretically, we establish the generalization error bound for MaGNet via empirical Rademacher complexity, and demonstrate its power to represent layer-wise neighborhood mixing. We conduct comprehensive numerical studies using simulated data to demonstrate the superior performance of MaGNet in comparison to several state-of-the-art alternatives. Furthermore, we apply MaGNet to a real-world case study aimed at extracting task-critical information from brain activity data, thereby highlighting its effectiveness in advancing scientific research. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

Travel route recommendation with a trajectory learning model

This study addresses a critical issue in location-based services: travel route recommendation. It leverages historical trajectory data to predict the actual route on a road network from a starting point to a destination, given a specific departure time. However, capturing the latent patterns in complex trajectory data for accurate route planning presents a significant challenge. Existing route recommendation methods commonly face two major problems: first, inadequate integration of multi-source data, which fails to fully consider the potential factors affecting route choice; and second, limited capability to capture road network characteristics, which restricts the effective application of node features and negatively impacts recommendation accuracy. To address these issues, this research introduces a Trajectory Learning Model for Route Recommendation (TLMR) based on deep learning techniques. TLMR enhances the understanding of user route choice behavior in complex environments by integrating multi-source data. Moreover, by incorporating road network features, TLMR more effectively captures and utilizes the structural and dynamic information of the road network. Specifically, TLMR first employs a Position-aware Graph Neural Network to learn features of intersections from the road network, incorporating context features like weather and traffic conditions. Then, it integrates this information through neural networks to predict the next intersection. Finally, a beam search algorithm is applied to generate and recommend multiple candidate routes. Extensive experiments on four large real-world datasets demonstrate that TLMR outperforms existing methods in four key performance metrics. These results prove the effectiveness and superiority of TLMR in route recommendation.

LGS-PPIS: A Local-Global Structural Information Aggregation Framework for Predicting Protein-Protein Interaction Sites.

Exploring protein-protein interaction sites (PPIS) is of significance to elucidating the intrinsic mechanisms of diverse biological processes. On this basis, recent studies have applied deep learning-based technologies to overcome the high cost of wet experiments for PPIS determination. However, the existing methods still suffer from two limitations that remain to be solved. Firstly, the process of feature aggregation in most methods only took into account node features, but ignored the complex edge features of the target residue to its neighbor residues, resulting in insufficient local feature extraction. Secondly, such feature aggregation was limited to aggregating spatially adjacent residues, and could not capture the "remote" residues that played a critical role in determining PPIS, which can be summed up as the lack of global feature at the residue level. To break the above limitations, a local-global structural information aggregation framework, LGS-PPIS, was proposed in this study, including two modules of edge-aware graph convolutional network (EA-GCN) and self-attention integrated with initial residual and identity mapping (SA-RIM), which achieved the aggregation of local and global information for PPIS prediction. Evaluation results of LGS-PPIS showed that the proposed method outperformed state-of-the-art deep learning methods on three widely used PPIS prediction benchmarks. Besides, the results of ablation experiments demonstrated that the local features from spatially adjacent residues and global features from "remote" residues separately captured by EA-GCN and SA-RIM could benefit the model performance. Among them, the former was shown to have a more significant role in the PPIS prediction.

Dynamic graph spatial-temporal dependence information extraction for remaining useful life prediction of rolling bearings

As a powerful tool for learning high-dimensional data representation, graph neural networks (GNN) have been applied to predict the remaining useful life (RUL) of rolling bearings. Existing GNN-based RUL prediction methods predominantly rely on constant pre-constructed graphs. However, the degradation of bearings is a dynamic process, and the dependence information between features may change at different moments of degradation. This article introduces a method for RUL prediction based on dynamic graph spatial-temporal dependence information extraction. The raw signal is segmented into multiple periods, and multiple features of each period data are extracted. Then, the correlation coefficient analysis is conducted, and the feature connection graph of each period is constructed based on different analytical results, thereby dynamically mapping the degradation process. The graph data is fed into graph convolutional networks (GCN) to extract spatial dependence between the graph node features in different periods. To make up for the shortcomings of GCN in temporal dependence extraction, the TimesNet module is introduced. TimesNet considers the two-dimensional changes of time series data and can extract the temporal dependence of graph data within and between different time cycles. Experimental results based on the PHM2012 dataset show that the average RUL prediction error of the proposed method is 17.4%, outperforming other comparative methods.

Combining multi-level feature extraction algorithm with residual graph convolutional neural network for partial discharge detection

Partial discharge (PD) identification is critical for the insulation diagnosis of cable conductors; however, there is still scope for enhancement in the existing adaptive extraction capabilities and feature utilization for PD signals. In this context, this paper introduces a method that integrates a one-dimensional convolutional neural network (1D-CNN) with a residual graph convolutional neural network (ResGCN) to recognize PD signals. Noise analysis is performed using various combinations of mother wavelets, and Bayesian optimization is employed to mitigate background noise. Key features of PD signals are progressively abstracted through a 1D-CNN-based multilevel automatic feature learning method, while signal timing attributes are maintained to minimize manual intervention. The graph data is constructed using the signal feature matrix and the signal timing feature similarity matrix. This is followed by the development of a ResGCN utilizing a graph attention mechanism to integrate node feature information and the topology of the PD graph data. This approach aims to fully exploit the correlation between local regions of the feature space and the temporal numerical properties of the signals. Additionally, it jointly optimizes feature extraction and model classification to facilitate adaptive diagnosis. The method is validated with extensive real experimental data obtained from medium voltage overhead power lines. It demonstrates exceptional performance and practicality, achieving an accuracy rate of 97.3% and a recognition rate of 96.1% for PD samples, thus offering reliable theoretical support for effective PD detection.

GKE-TUNet: Geometry-Knowledge Embedded TransUNet Model for Retinal Vessel Segmentation Considering Anatomical Topology.

Automated retinal vessel segmentation is crucial for computer-aided clinical diagnosis and retinopathy screening. However, deep learning faces challenges in extracting complex intertwined structures and subtle small vessels from densely vascularized regions. To address these issues, we propose a novel segmentation model, called Geometry-Knowledge Embedded TransUNet (GKE-TUNet), which incorporates explicit embedding of topological features of retinal vessel anatomy. In the proposed GKE-TUNet model, a skeleton extraction network is pre-trained to extract the anatomical topology of retinal vessels from refined segmentation labels. During vessel segmentation, the dense skeleton graph is sampled as a graph of key-points and connections and is incorporated into the skip connection layer of TransUNet. The graph vertices are used as node features and correspond to positions in the low-level feature maps. The graph attention network (GAT) is used as the graph convolution backbone network to capture the shape semantics of vessels and the interaction of key locations along the topological direction. Finally, the node features obtained by graph convolution are read out as a sparse feature map based on their corresponding spatial coordinates. To address the problem of sparse feature maps, we employ convolution operators to fuse sparse feature maps with low-level dense feature maps. This fusion is weighted and connected to deep feature maps. Experimental results on the DRIVE, CHASE-DB1, and STARE datasets demonstrate the competitiveness of our proposed method compared to existing ones.

A graph convolutional neural network model based on fused multi-subgraph as input and fused feature information as output

The graph convolution neural network (GCN)-based node classification model tackles the challenge of classifying nodes in graph data through learned feature representations. However, most existing graph neural networks primarily focus on the same type of edges, which might not accurately reflect the intricate real-world graph structure. This paper introduces a novel graph neural network model, MF-GCN, which integrates subgraphs with various edge types as input and combines feature information from each graph convolutional neural network layer to produce the final output. This model learns node feature representations by separately feeding subgraphs with different edge types into the graph convolutional layer. It then computes the weight vectors for fusing various edge type subgraphs based on the learned node features. Additionally, to efficiently extract feature information, the outputs of each graph convolution layer, without an activation function, are weighted and summed to obtain the final node features. This approach resolves the challenges of determining fusion weights and effectively extracting feature information during subgraph fusion. Experimental results show that the proposed model significantly improves performance on all three datasets, highlighting its effectiveness in node representation learning tasks.

Academic collaboration recommendation based on graph neural network and multi-attribute embedding

Academic collaboration recommendation (ACR) can help researchers find potential partners for research and thus promote academic innovation. Recent works mostly use graph learning-based methods to explore various ways of combining node information with topology, which consists of multiple steps, including network construction, node feature extraction, network representation learning and link prediction. One limitation is that they only conduct research on co-authorship networks and ignore citation relationship between publications. Besides, they tend to use attributes from a single dimension of researchers and do not take attributes of researchers from multiple dimensions into consideration at the same time. To address the above issues, we present the multi-dimensional attributes enhanced heterogeneous (MAH) network representation learning method, which constructs heterogeneous networks with both co-authorship and citation information and makes use of multi-dimensional attributes. Three research questions are addressed in this work: (RQ1) Is our proposed method effective on academic collaboration recommendation compared with existing state-of-the-art methods? (RQ2) Does incorporating citation information into co-authorship network help improve the performance of academic collaboration recommendation? (RQ3) How does fusing multi-dimensional attributes affect the performance of academic collaboration recommendation? A publicly available real-world data set is used in our experiments. The superior performance of MAH compared with baseline methods demonstrates that the proposed multi-dimensional feature-based researcher profile can enrich node information in academic network and effective researcher representations can be learned by applying graph representation learning methods on the network.

A Study of Recommendation Methods Based on Graph Hybrid Neural Networks and Deep Crossing

In the face of complex user behavior patterns and massive data, improving the performance of recommender system models is an urgent challenge. Traditional methods often struggle to effectively handle feature interactions and complex user-item relationships. Combining the advantages of graph neural networks and the Deep Crossing network, this paper proposes a recommendation method based on hybrid neural networks with Deep Crossing (Deep Crossing with Graph Convolution and GRU, DCGCN-GRU). First, by constructing the graph structure of users and items, higher-order feature representations are extracted, and node features are updated using a multilayer graph convolution operation. Then, the higher-order features learned by the graph convolution network are spliced and weighted with the original features to form new feature inputs. Next, a Gated Recurrent Unit (GRU) is introduced to capture the inter-feature temporal dynamic relationships and sequence information. Finally, the Deep Crossing model is utilized to learn the interactions between the fused features at multiple levels and enhance the interactions between the features. Comparative experiments on three public datasets, MovieLens-ml-25m, Book-Crossings, and Amazon Reviews’23, show that the model achieves significant improvements in accuracy, mean square error (MSE), and mean absolute error (MAE).

PASCL: supervised contrastive learning with perturbative augmentation for particle decay reconstruction

Abstract In high-energy physics, particles produced in collision events decay in a format of a hierarchical tree structure, where only the final decay products can be observed using detectors. However, the large combinatorial space of possible tree structures makes it challenging to recover the actual decay process given a set of final particles. To better analyse the hierarchical tree structure, we propose a graph-based deep learning model to infer the tree structure to reconstruct collision events. In particular, we use a compact matrix representation termed as lowest common ancestor generations matrix, to encode the particle decay tree structure. Then, we introduce a perturbative augmentation technique applied to node features, aiming to mimic experimental uncertainties and increase data diversity. We further propose a supervised graph contrastive learning algorithm to utilize the information of inter-particle relations from multiple decay processes. Extensive experiments show that our proposed supervised graph contrastive learning with perturbative augmentation method outperforms state-of-the-art baseline models on an existing physics-based dataset, significantly improving the reconstruction accuracy. This method provides a more effective training strategy for models with the same parameters and makes way for more accurate and efficient high-energy particle physics data analysis.

L-GraphSAGE: A Graph Neural Network-Based Approach for IoV Application Encrypted Traffic Identification

Recently, with a crucial role in developing smart transportation systems, the Internet of Vehicles (IoV), with all kinds of in-vehicle devices, has undergone significant advancement for autonomous driving, in-vehicle infotainment, etc. With the development of these IoV devices, the complexity and volume of in-vehicle data flows within information communication have increased dramatically. To adapt these changes to secure and smart transportation, encrypted communication realization, real-time decision-making, traffic management enhancement, and overall transportation efficiency improvement are essential. However, the security of a traffic system under encrypted communication is still inadequate, as attackers can identify in-vehicle devices through fingerprinting attacks, causing potential privacy breaches. Nevertheless, existing IoV traffic application models for encrypted traffic identification are weak and often exhibit poor generalization in some dynamic scenarios, where route switching and TCP congestion occur frequently. In this paper, we propose LineGraph-GraphSAGE (L-GraphSAGE), a graph neural network (GNN) model designed to improve the generalization ability of the IoV application of traffic identification in these dynamic scenarios. L-GraphSAGE utilizes node features, including text attributes, node context information, and node degree, to learn hyperparameters that can be transferred to unknown nodes. Our model demonstrates promising results in both UNSW Sydney public datasets and real-world environments. In public IoV datasets, we achieve an accuracy of 94.23%(↑0.23%). Furthermore, our model achieves an F1 change rate of 0.20%(↑96.92%) in α train, β infer, and 0.60%(↑75.00%) in β train, α infer when evaluated on a dataset consisting of five classes of data collected from real-world environments. These results highlight the effectiveness of our proposed approach in enhancing IoV application identification in dynamic network scenarios.