arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.3100cs.LGcs.DB
收藏

具有异质性的半监督学习

Semi-Supervised Learning with Heterophily

Carnegie Mellon University(卡内基梅隆大学)

Wolfgang Gatterbauer

摘要:

我们推导出一个家庭的线性推理算法,推广现有的基于图形的标签传播算法,允许他们传播广义的假设之间的“吸引力”或“兼容性”类的相邻节点(特别是那些涉及异性之间的节点,其中“异性相吸”)。因此,我们称之为半监督学习与异质性(SSLH),并显示它是如何推广和改进最近提出的方法称为线性置信传播(LinBP)。重要的是,我们的框架使我们能够减少估计节点之间的相对兼容性的问题,从部分标记图到一个简单的优化问题。结果是一个非常快速的算法,尽管它很简单,但却令人惊讶地有效:我们可以在与LinBP相同的时间内对同一图中的未标记节点进行分类,但具有更高的准确性,尽管我们的算法不知道兼容性。

英文摘要:

We derive a family of linear inference algorithms that generalize existing graph-based label propagation algorithms by allowing them to propagate generalized assumptions about "attraction" or "compatibility" between classes of neighboring nodes (in particular those that involve heterophily between nodes where "opposites attract"). We thus call this formulation Semi-Supervised Learning with Heterophily (SSLH) and show how it generalizes and improves upon a recently proposed approach called Linearized Belief Propagation (LinBP). Importantly, our framework allows us to reduce the problem of estimating the relative compatibility between nodes from partially labeled graph to a simple optimization problem. The result is a very fast algorithm that -- despite its simplicity -- is surprisingly effective: we can classify unlabeled nodes within the same graph in the same time as LinBP but with a superior accuracy and despite our algorithm not knowing the compatibilities.

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

↑