dorsal/arxiv
View SchemaSimple Network Graph Comparative Learning
| Authors | Qiang Yu, Xinran Cheng, Shiqiang Xu, Chuanyi Liu |
|---|---|
| Categories | |
| ArXiv ID | 2601.10150vv1 |
| URL | https://arxiv.org/abs/2601.10150 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
The effectiveness of contrastive learning methods has been widely recognized in the field of graph learning, especially in contexts where graph data often lack labels or are difficult to label. However, the application of these methods to node classification tasks still faces a number of challenges. First, existing data enhancement techniques may lead to significant differences from the original view when generating new views, which may weaken the relevance of the view and affect the efficiency of model training. Second, the vast majority of existing graph comparison learning algorithms rely on the use of a large number of negative samples. To address the above challenges, this study proposes a novel node classification contrast learning method called Simple Network Graph Comparative Learning (SNGCL). Specifically, SNGCL employs a superimposed multilayer Laplace smoothing filter as a step in processing the data to obtain global and local feature smoothing matrices, respectively, which are thus passed into the target and online networks of the siamese network, and finally employs an improved triple recombination loss function to bring the intra-class distance closer and the inter-class distance farther. We have compared SNGCL with state-of-the-art models in node classification tasks, and the experimental results show that SNGCL is strongly competitive in most tasks.
{
"annotation_id": "1b474081-9e8c-42fc-8d2d-fe9dcf12bb38",
"date_created": "2026-02-17T05:53:23.793000Z",
"date_modified": "2026-02-17T05:53:23.793000Z",
"file_hash": "2bc482b82854eb5e01088d28592ac22e8155ac3e46ced45fe5be51d38bcd3d54",
"private": false,
"record": {
"abstract": "The effectiveness of contrastive learning methods has been widely recognized in the field of graph learning, especially in contexts where graph data often lack labels or are difficult to label. However, the application of these methods to node classification tasks still faces a number of challenges. First, existing data enhancement techniques may lead to significant differences from the original view when generating new views, which may weaken the relevance of the view and affect the efficiency of model training. Second, the vast majority of existing graph comparison learning algorithms rely on the use of a large number of negative samples. To address the above challenges, this study proposes a novel node classification contrast learning method called Simple Network Graph Comparative Learning (SNGCL). Specifically, SNGCL employs a superimposed multilayer Laplace smoothing filter as a step in processing the data to obtain global and local feature smoothing matrices, respectively, which are thus passed into the target and online networks of the siamese network, and finally employs an improved triple recombination loss function to bring the intra-class distance closer and the inter-class distance farther. We have compared SNGCL with state-of-the-art models in node classification tasks, and the experimental results show that SNGCL is strongly competitive in most tasks.",
"arxiv_id": "2601.10150",
"authors": [
"Qiang Yu",
"Xinran Cheng",
"Shiqiang Xu",
"Chuanyi Liu"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Simple Network Graph Comparative Learning",
"url": "https://arxiv.org/abs/2601.10150",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "eea79853-fb63-4b88-af12-4c8a95248944",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}