Label Contrastive Coding Based Graph Neural Network for Graph Classification
نویسندگان
چکیده
Graph classification is a critical research problem in many applications from different domains. In order to learn graph model, the most widely used supervision component an output layer together with loss (e.g., cross-entropy softmax or margin loss). fact, discriminative information among instances are more fine-grained, which can benefit tasks. this paper, we propose novel Label Contrastive Coding based Neural Network (LCGNN) utilize label effectively and comprehensively. LCGNN still uses ensure discriminability of classes. Meanwhile, leverages proposed Loss derived self-supervised learning encourage instance-level intra-class compactness inter-class separability. To power contrastive learning, introduces dynamic memory bank momentum updated encoder. Our extensive evaluations eight benchmark datasets demonstrate that outperform state-of-the-art models. Experimental results also verify achieve competitive performance less training data because exploits
منابع مشابه
Graph Based Convolutional Neural Network
In this paper we present a method for the application of Convolutional Neural Network (CNN) operators for use in domains which exhibit irregular spatial geometry by use of the spectral domain of a graph Laplacian, Figure 1. This allows learning of localized features in irregular domains by defining neighborhood relationships as edge weights between vertices in graph G. By formulating the domain...
متن کاملProximity-based Graph Embeddings for Multi-label Classification
In many real applications of text mining, information retrieval and natural language processing, large-scale features are frequently used, which often make the employed machine learning algorithms intractable, leading to the well-known problem “curse of dimensionality”. Aiming at not only removing the redundant information from the original features but also improving their discriminating abili...
متن کاملGraph Connectivity and Network Coding
Graph Connectivity and Network Coding LEUNG, Kai Man Master of Philosophy Department of Computer Science and Engineering The Chinese University of Hong Kong 2011 In this thesis we present a new algebraic formulation to compute edge connectivities in a directed graph, using the ideas developed in network coding. This reduces the problem of computing edge connectivities to solving systems of line...
متن کاملEffective graph classification based on topological and label attributes
Graph classification is an important data mining task, and various graph kernel methods have been proposed recently for this task. These methods have proven to be effective, but they tend to have high computational overhead. In this paper, we propose an alternative approach to graph classification that is based on feature vectors constructed from different global topological attributes, as well...
متن کاملGraph Classification via Topological and Label Attributes
Graph classification is an important data mining task, and various graph kernel methods have been proposed recently for this task. These methods have proven to be effective, but they tend to have high computational overhead. In this paper, we propose an alternative approach to graph classification that is based on feature-vectors constructed from different global topological attributes, as well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-73194-6_10