【24h】

Recurrent Neural Collective Classification

机译:递归神经集体分类

获取原文
获取原文并翻译 | 示例
       

摘要

With the recent surge in availability of data sets containing not only individual attributes but also relationships, classification techniques that take advantage of predictive relationship information have gained in popularity. The most popular existing collective classification techniques have a number of limitations—some of them generate arbitrary and potentially lossy summaries of the relationship data, whereas others ignore directionality and strength of relationships. Popular existing techniques make use of only direct neighbor relationships when classifying a given entity, ignoring potentially useful information contained in expanded neighborhoods of radius greater than one. We present a new technique that we call recurrent neural collective classification (RNCC), which avoids arbitrary summarization, uses information about relationship directionality and strength, and through recursive encoding, learns to leverage larger relational neighborhoods around each entity. Experiments with synthetic data sets show that RNCC can make effective use of relationship data for both direct and expanded neighborhoods. Further experiments demonstrate that our technique outperforms previously published results of several collective classification methods on a number of real-world data sets.
机译:随着最近不仅包含单个属性而且还包含关系的数据集的可用性激增,利用预测性关系信息的分类技术日益普及。现有的最流行的集体分类技术有很多局限性-其中一些会生成关系数据的任意且可能有损的摘要,而另一些会忽略关系的方向性和强度。现有的流行技术在对给定实体进行分类时仅利用直接邻居关系,而忽略了半径大于1的扩展邻域中包含的潜在有用信息。我们提出了一种称为递归神经集体分类(RNCC)的新技术,该技术避免了任意汇总,使用了有关关系方向性和强度的信息,并通过递归编码学习了如何利用每个实体周围的较大关系邻域。使用综合数据集进行的实验表明,RNCC可以有效利用直接和扩展邻域的关系数据。进一步的实验表明,我们的技术在许多实际数据集上的性能优于先前发表的几种集体分类方法的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号