检索结果-南通市图书馆

Research on node classification Based on Joint Weighted node Vectors

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Applied Mathematics and Physics 2024年第1期12卷 210-225页

作者： Li Dai School of Mathematics and Statistics Hubei Minzu University Enshi China

node of network has lots of information, such as topology, text and label information. Therefore, node classification is an open issue. Recently, one vector of node is directly connected at the end of another vector. However, this method actually obtains the performance by extending dimensions and considering that the text and structural information are one-to-one, which is obviously unreasonable. Regarding this issue, a method by weighting vectors is proposed in this paper. Three methods, negative logarithm, modulus and sigmoid function are used to weight-trained vectors, then recombine the weighted vectors and put them into the SVM classifier for evaluation output. By comparing three different weighting methods, the results showed that using negative logarithm weighting achieved better results than the other two using modulus and sigmoid function weighting, and was superior to directly concatenating vectors in the same dimension.

关键词： node classification Network Embedding Representation Learning Weighted Vectors Training

Few-shot node classification via local adaptive discriminant structure learning

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2023年第2期17卷 135-143页

作者： Zhe XUE Junping DU Xin XU Xiangbin LIU Junfu WANG Feifei KOU Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia School of Computer ScienceBeijing University of Posts and TelecommunicationsBeijing 100876China

node classification has a wide range of application scenarios such as citation analysis and social network analysis.In many real-world attributed networks,a large portion of classes only contain limited labeled nodes.Most of the existing node classification methods cannot be used for few-shot node classification.To train the model effectively and improve the robustness and reliability of the model with scarce labeled samples,in this paper,we propose a local adaptive discriminant structure learning(LADSL)method for few-shot node classification.LADSL aims to properly represent the nodes in the attributed graphs and learn a metric space with a strong discriminating power by reducing the intra-class variations and enlargingginter-classdifferences.Extensiveexperiments conducted on various attributed networks datasets demonstrate that LADSL is superior to the other methods on few-shot node classification task.

关键词： few-shot learning node classification graph neural network adaptive structure learning attention strategy

Variational Gridded Graph Convolution Network for node classification

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第10期8卷 1697-1708页

作者： Xiaobin Hong Tong Zhang Zhen Cui Jian Yang Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and EngineeringNanjing University of Science and TechnologyNanjing 210094China

The existing graph convolution methods usually suffer high computational burdens,large memory requirements,and intractable batch-processing.In this paper,we propose a high-efficient variational gridded graph convolution network(VG-GCN)to encode non-regular graph data,which overcomes all these aforementioned problems.To capture graph topology structures efficiently,in the proposed framework,we propose a hierarchically-coarsened random walk(hcr-walk)by taking advantage of the classic random walk and node/edge encapsulation.The hcr-walk greatly mitigates the problem of exponentially explosive sampling times which occur in the classic version,while preserving graph structures well.To efficiently encode local hcr-walk around one reference node,we project hcrwalk into an ordered space to form image-like grid data,which favors those conventional convolution networks.Instead of the direct 2-D convolution filtering,a variational convolution block(VCB)is designed to model the distribution of the randomsampling hcr-walk inspired by the well-formulated variational inference.We experimentally validate the efficiency and effectiveness of our proposed VG-GCN,which has high computation speed,and the comparable or even better performance when compared with baseline GCNs.

关键词： Graph coarsening gridding node classification random walk variational convolution

维普期刊数据库

Deepwalk-aware graph convolutional networks

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第5期65卷 81-95页

作者： Taisong JIN Huaqiang DAI Liujuan CAO Baochang ZHANG Feiyue HUANG Yue GAO Rongrong JI Media Analytics and Computing Lab Department of Computer Science and Technology School of InformaticsXiamen University Media Analytics and Computing Lab Department of Artificial Intelligence School of InformaticsXiamen University School of Automation Science and Electrical Engineering Beihang University Tencent Youtu Lab School of Software Tsinghua University

Graph convolutional networks(GCNs) provide a promising way to extract the useful information from graph-structured data. Most of the existing GCNs methods usually focus on local neighborhood information based on specific convolution operations, and ignore the global structure of the input data. To extract the latent representation for the graph-structured data more effectively, we introduce a deepwalk strategy into GCNs to efficiently explore the global graph information. This strategy can complement the local neighborhood information of a graph, resulting in the more robust representation for the graph data.The fusion of the local neighboring and global structured information of a graph can further facilitate deep feature learning at the output layer of GCNs for node classification. Experimental results show that the proposed model has achieved state-of-the-art results on three benchmark datasets including Cora, Citeseer,and Pubmed citation networks.

关键词： graph convolutional networks global information fusion node classification

NGAT:attention in breadth and depth exploration for semi-supervised graph representation learning

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2022年第3期23卷 409-421页

作者： Jianke HU Yin ZHANG College of Computer Science and Technology Zhejiang UniversityHangzhou 310027China

Recently,graph neural networks(GNNs)have achieved remarkable performance in representation learning on graph-structured data.However,as the number of network layers increases,GNNs based on the neighborhood aggregation strategy deteriorate due to the problem of oversmoothing,which is the major bottleneck for applying GNNs to real-world graphs.Many efforts have been made to improve the process of feature information aggregation from directly connected nodes,i.e.,breadth exploration.However,these models perform the best only in the case of three or fewer layers,and the performance drops rapidly for deep layers.To alleviate oversmoothing,we propose a nested graph attention network(NGAT),which can work in a semi-supervised manner.In addition to breadth exploration,a k-layer NGAT uses a layer-wise aggregation strategy guided by the attention mechanism to selectively leverage feature information from the k;-order neighborhood,i.e.,depth exploration.Even with a 10-layer or deeper architecture,NGAT can balance the need for preserving the locality(including root node features and the local structure)and aggregating the information from a large neighborhood.In a number of experiments on standard node classification tasks,NGAT outperforms other novel models and achieves state-of-the-art performance.

关键词： Graph learning Semi-supervised learning node classification Attention

维普期刊数据库