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

基于图的并行分布式半监督学习方法

Parallel and Distributed Approaches for Graph Based Semi-supervised Learning

Inria(法国国家信息与自动化研究所);IIT Bombay(印度理工学院孟买分校)

Konstantin Avrachenkov, Vivek Borkar, Krishnakant Saboo

摘要:

提出了两种基于图的半监督学习方法。第一种方法是基于仿射映射的迭代。仿射映射迭代的一个关键元素是稀疏矩阵向量乘法,它有几个非常有效的并行实现。第二种方法属于马尔可夫链蒙特卡罗(MCMC)算法。它是基于通过在图上执行随机行走来对节点进行采样。后一种方法本质上是分布式的,可以很容易地在多个处理器上或通过网络实现。同时给出了理论和实践的评价。结果表明,该算法能以很小的误差将节点分类到它们的类中.采样算法的能力,跟踪新的传入nodesand分类它们也被证明。

英文摘要:

Two approaches for graph based semi-supervised learning are proposed. The firstapproach is based on iteration of an affine map. A key element of the affine map iteration is sparsematrix-vector multiplication, which has several very efficient parallel implementations. The secondapproach belongs to the class of Markov Chain Monte Carlo (MCMC) algorithms. It is based onsampling of nodes by performing a random walk on the graph. The latter approach is distributedby its nature and can be easily implemented on several processors or over the network. Boththeoretical and practical evaluations are provided. It is found that the nodes are classified intotheir class with very small error. The sampling algorithm's ability to track new incoming nodesand to classify them is also demonstrated.

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

↑