Redirigiendo al acceso original de articulo en 19 segundos...
Inicio  /  Applied Sciences  /  Vol: 12 Par: 14 (2022)  /  Artículo
ARTÍCULO
TITULO

Geometry-V-Sub: An Efficient Graph Attention Network Struct Based Model for Node Classification

Zhengyu Lyu    
Wulamu Aziguli and Dezheng Zhang    

Resumen

With the development of deep learning and graph deep learning, the network structure is more and more complex, and the parameters in the network model and the computing resources and storage resources required are increasing. The lightweight design and optimization of the network structure is conducive to reducing the required computing resources and storage resources, reducing the requirements of the network model on the computing environment, increasing its scope of application, reducing the consumption of energy in computing, and is conducive to environmental protection. The contribution of this paper is that Geometry-V-Sub is a graph learning structure based on spatial geometry, which can greatly reduce the parameter requirements and only lose a little accuracy. The number of parameters is only 13.05?16.26% of baseline model, and the accuracy of Cora, Citeseer and PubMed is max to 80.4%, 68% and 81.8%, respectively. When the number of parameters is only 12.01% of baseline model, F1 score is max to 98.4.

 Artículos similares

       
 
Jing Liu and Yong Zhong    
As a structural indicator of dense subgraphs, k-core has been widely used in community search due to its concise and efficient calculation. Many community search algorithms have been expanded on the basis of k-core. However, relevant algorithms often set... ver más
Revista: Applied Sciences

 
Zilin Zhao, Zhi Cai, Mengmeng Chang and Zhiming Ding    
Unconventional events exacerbate the imbalance between regional transportation demand and limited road network resources. Scientific and efficient path planning serves as the foundation for rapidly restoring equilibrium to the road network. In real large... ver más
Revista: Applied Sciences

 
Chaim David and Haridimos Kondylakis    
Over time, the renowned Kyoto Encyclopedia of Genes and Genomes (KEGG) has grown to become one of the most comprehensive online databases for biological procedures. The majority of the data are stored in the form of pathways, which are graphs that depict... ver más
Revista: Information

 
Wenjun Li, Xueying Yang, Chao Xu and Yongjie Yang    
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions... ver más
Revista: Algorithms

 
Rui-Yu Li, Yu Guo and Bin Zhang    
Nonnegative matrix factorization (NMF) is an efficient method for feature learning in the field of machine learning and data mining. To investigate the nonlinear characteristics of datasets, kernel-method-based NMF (KNMF) and its graph-regularized extens... ver más
Revista: Information