How Graph Structure and Label Dependencies Contribute to Node Classification in a Large Network of Documents

• URL: http://arxiv.org/abs/2304.01235v2
• Date: Fri, 9 Feb 2024 15:22:23 GMT
• Title: How Graph Structure and Label Dependencies Contribute to Node Classification in a Large Network of Documents
• Abstract summary: We introduce a new dataset named WikiVitals which contains a large graph of 48k mutually referred Wikipedia articles. Our aim is to rigorously evaluate the contributions of three distinct sources of information to the label prediction in a semi-supervised node classification setting.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a new dataset named WikiVitals which contains a large graph of 48k mutually referred Wikipedia articles classified into 32 categories and connected by 2.3M edges. Our aim is to rigorously evaluate the contributions of three distinct sources of information to the label prediction in a semi-supervised node classification setting, namely the content of the articles, their connections with each other and the correlations among their labels. We perform this evaluation using a Graph Markov Neural Network which provides a theoretically principled model for this task and we conduct a detailed evaluation of the contributions of each sources of information using a clear separation of model selection and model assessment. One interesting observation is that including the effect of label dependencies is more relevant for sparse train sets than it is for dense train sets.

Related papers

• Multi-Label Node Classification with Label Influence Propagation [79.38415948442751]
  Tackling multi-label node classification (MLNC) on graphs has led to the development of various approaches.<n>Some methods leverage graph neural networks (GNNs) to exploit label co-occurrence correlations, while others incorporate label embeddings to capture label proximity.<n>We decompose the message passing process in GNNs into two operations: propagation and transformation.<n>We then conduct a comprehensive analysis and quantification of the influence correlations between labels in each operation.
  arXiv  Detail & Related papers  (2026-07-01T09:17:28Z)
• KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification [75.95647590619929]
  Zero-Shot Node Classification (ZNC) has been an emerging and crucial task in graph data analysis. We propose a Knowledge-Aware Multi-Faceted framework (KMF) that enhances the richness of label semantics. A novel geometric constraint is developed to alleviate the problem of prototype drift caused by node information aggregation.
  arXiv  Detail & Related papers  (2023-08-15T02:38:08Z)
• Contrastive Disentangled Learning on Graph for Node Classification [11.678287036601564]
  We propose a novel framework for contrastive disentangled learning on graphs, employing a disentangled graph encoder and two carefully crafted self-supervision signals. Specifically, we introduce a disentangled graph encoder to enforce the framework to distinguish various latent factors corresponding to underlying semantic information. To overcome the heavy reliance on labels, we design two self-supervision signals, namely node specificity and channel independence, which capture informative knowledge without the need for labeled data.
  arXiv  Detail & Related papers  (2023-06-20T07:25:14Z)
• TGNN: A Joint Semi-supervised Framework for Graph-level Classification [34.300070497510276]
  We propose a novel semi-supervised framework called Twin Graph Neural Network (TGNN) To explore graph structural information from complementary views, our TGNN has a message passing module and a graph kernel module. We evaluate our TGNN on various public datasets and show that it achieves strong performance.
  arXiv  Detail & Related papers  (2023-04-23T15:42:11Z)
• Dissimilar Nodes Improve Graph Active Learning [27.78519071553204]
  We introduce 3 dissimilarity-based information scores for active learning: feature dissimilarity score (FDS), structure dissimilarity score (SDS), and embedding dissimilarity score (EDS) Our newly proposed scores boost the classification accuracy by 2.1% on average and are capable of generalizing to different Graph Neural Network architectures.
  arXiv  Detail & Related papers  (2022-12-05T01:00:37Z)
• Association Graph Learning for Multi-Task Classification with Category Shifts [68.58829338426712]
  We focus on multi-task classification, where related classification tasks share the same label space and are learned simultaneously. We learn an association graph to transfer knowledge among tasks for missing classes. Our method consistently performs better than representative baselines.
  arXiv  Detail & Related papers  (2022-10-10T12:37:41Z)
• PointMatch: A Consistency Training Framework for Weakly Supervised Semantic Segmentation of 3D Point Clouds [117.77841399002666]
  We propose a novel framework, PointMatch, that stands on both data and label, by applying consistency regularization to sufficiently probe information from data itself. The proposed PointMatch achieves the state-of-the-art performance under various weakly-supervised schemes on both ScanNet-v2 and S3DIS datasets.
  arXiv  Detail & Related papers  (2022-02-22T07:26:31Z)
• Cross-Domain Few-Shot Graph Classification [7.23389716633927]
  We study the problem of few-shot graph classification across domains with nonequivalent feature spaces. We propose an attention-based graph encoder that uses three congruent views of graphs, one contextual and two topological views. We show that when coupled with metric-based meta-learning frameworks, the proposed encoder achieves the best average meta-test classification accuracy.
  arXiv  Detail & Related papers  (2022-01-20T16:16:30Z)
• SHGNN: Structure-Aware Heterogeneous Graph Neural Network [77.78459918119536]
  This paper proposes a novel Structure-Aware Heterogeneous Graph Neural Network (SHGNN) to address the above limitations. We first utilize a feature propagation module to capture the local structure information of intermediate nodes in the meta-path. Next, we use a tree-attention aggregator to incorporate the graph structure information into the aggregation module on the meta-path. Finally, we leverage a meta-path aggregator to fuse the information aggregated from different meta-paths.
  arXiv  Detail & Related papers  (2021-12-12T14:18:18Z)
• Knowledge-Guided Multi-Label Few-Shot Learning for General Image Recognition [75.44233392355711]
  KGGR framework exploits prior knowledge of statistical label correlations with deep neural networks. It first builds a structured knowledge graph to correlate different labels based on statistical label co-occurrence. Then, it introduces the label semantics to guide learning semantic-specific features. It exploits a graph propagation network to explore graph node interactions.
  arXiv  Detail & Related papers  (2020-09-20T15:05:29Z)
• Instance-Aware Graph Convolutional Network for Multi-Label Classification [55.131166957803345]
  Graph convolutional neural network (GCN) has effectively boosted the multi-label image recognition task. We propose an instance-aware graph convolutional neural network (IA-GCN) framework for multi-label classification.
  arXiv  Detail & Related papers  (2020-08-19T12:49:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.