Scholarlink

<p>Node classification on graph data is an important problem in many real-world applications. However, it requires labels for training, which can be difficult or expensive to obtain in practice. Consequently, typically only a small fraction of the accessible data is labeled. Recognizing this limitation, we consider the problem of spreading the labels from a small carefully chosen set of labeled data, also referred to as <i>seeds</i>, to a larger set of unlabeled data. Based on the common graph smoothness assumption, we cast this classification problem within the semi-supervised learning framework and propose a graph sampling design strategy for the seeds to improve the performance of the well-known label propagation algorithm. In particular, we show that more accurate predictions can be achieved if the seeds are “optimally” spread over the graph by means of a space-filling design, a sampling strategy particularly suited in cases in which no other attributes are available on the nodes. Both theoretical results and competitive experimental results on a variety of simulations and a real-world dataset demonstrate the effectiveness of the proposed methodology.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A space-filling sampling approach for collective classification of social media data

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月7日

查看全文
  • Emiliano del Gobbo,
  • Lara Fontanella,
  • Luigi Ippoliti,
  • Simone Di Zio,
  • Sara Fontanella,
  • Alex Cucco

摘要

Node classification on graph data is an important problem in many real-world applications. However, it requires labels for training, which can be difficult or expensive to obtain in practice. Consequently, typically only a small fraction of the accessible data is labeled. Recognizing this limitation, we consider the problem of spreading the labels from a small carefully chosen set of labeled data, also referred to as seeds, to a larger set of unlabeled data. Based on the common graph smoothness assumption, we cast this classification problem within the semi-supervised learning framework and propose a graph sampling design strategy for the seeds to improve the performance of the well-known label propagation algorithm. In particular, we show that more accurate predictions can be achieved if the seeds are “optimally” spread over the graph by means of a space-filling design, a sampling strategy particularly suited in cases in which no other attributes are available on the nodes. Both theoretical results and competitive experimental results on a variety of simulations and a real-world dataset demonstrate the effectiveness of the proposed methodology.