arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.08426cs.LGcs.AI
收藏

最优引导森林中的非迭代标签传播

Non-iterative Label Propagation in Optimal Leading Forest

Guizhou University of Engineering Science(贵州工程应用技术学院);Chongqing University of Posts and Telecommunications(重庆邮电大学)

Ji Xu, Guoyin Wang

摘要:

基于图的半监督学习(GSSL)具有直观的表示形式,并可通过矩阵计算加以改进。然而,它必须执行迭代优化,以实现一个预设的目标,这通常会导致低效率。GSSL的另一个不便之处在于,当新数据到来时,必须重新进行图的构建和优化。我们提出了一个合理的假设,认为:相邻的数据点不是对等的关系,但在局部密度和数据之间的距离诱导偏序关系;和中心的标签可以被视为其追随者的贡献。从这个假设出发,我们开发了一个高效的非迭代标签传播算法的基础上命名为最佳领先森林(LaPOLeaF)的新的数据结构。传统的GSSL的主要弱点是解决这项研究。我们进一步扩展LaPOLeaF,以适应大数据,利用块距离矩阵技术,并行计算,和局部敏感哈希(LSH)。在大数据集上的实验表明,所提出的方法具有良好的效果。

英文摘要:

Graph based semi-supervised learning (GSSL) has intuitive representation and can be improved by exploiting the matrix calculation. However, it has to perform iterative optimization to achieve a preset objective, which usually leads to low efficiency. Another inconvenience lying in GSSL is that when new data come, the graph construction and the optimization have to be conducted all over again. We propose a sound assumption, arguing that: the neighboring data points are not in peer-to-peer relation, but in a partial-ordered relation induced by the local density and distance between the data; and the label of a center can be regarded as the contribution of its followers. Starting from the assumption, we develop a highly efficient non-iterative label propagation algorithm based on a novel data structure named as optimal leading forest (LaPOLeaF). The major weaknesses of the traditional GSSL are addressed by this study. We further scale LaPOLeaF to accommodate big data by utilizing block distance matrix technique, parallel computing, and Locality-Sensitive Hashing (LSH). Experiments on large datasets have shown the promising results of the proposed methods.

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

↑