arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.02817cs.IRcs.AIcs.LG
收藏

基于图的关系特征的集合分类

Graph Based Relational Features for Collective Classification

Google Inc.(谷歌公司);University of Konstanz(康斯坦茨大学)

Immanuel Bayer, Uwe Nagel, Steffen Rendle

摘要:

统计关系学习(SRL)方法已经表明,通过整合样本之间的关系可以提高分类精度。迭代分类或松弛标记等技术通过在推理过程中在相关样本之间传播信息来实现这一点。当只有少数样本被标记并且样本之间的连接稀疏时,集体推理方法比标准的基于特征的ML方法有很大的改进。然而,与基于特征的ML相比,集体推理方法需要复杂的推理过程,并且通常依赖于相关样本之间标签一致性的强假设。在本文中,我们通过从直接和间接关系中提取信息,为标准ML方法引入了新的关系特征。我们在三个标准基准数据集上的经验表明,我们的关系特征产生的结果与集体推理方法相当。最后,我们表明,我们的建议优于这些方法时,额外的信息。

英文摘要:

Statistical Relational Learning (SRL) methods have shown that classification accuracy can be improved by integrating relations between samples. Techniques such as iterative classification or relaxation labeling achieve this by propagating information between related samples during the inference process. When only a few samples are labeled and connections between samples are sparse, collective inference methods have shown large improvements over standard feature-based ML methods. However, in contrast to feature based ML, collective inference methods require complex inference procedures and often depend on the strong assumption of label consistency among related samples. In this paper, we introduce new relational features for standard ML methods by extracting information from direct and indirect relations. We show empirically on three standard benchmark datasets that our relational features yield results comparable to collective inference methods. Finally we show that our proposal outperforms these methods when additional information is available.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑