一种线性时间主动学习的链接分类算法
A Linear Time Active Learning Algorithm for Link Classification -- Full Version --
摘要:
我们提出了非常有效的主动学习算法,在签署网络的链接分类。我们的算法是由一个随机模型,其中边缘标签通过扰动的初始符号分配一致的两个集群的节点。我们在这个模型中提供了一个理论分析,表明我们可以通过查询O(|V| ^{3/2})个边标签来实现任何图G =(V,E)上的最佳错误数(在一个常数因子中),使得|E| = Ω(|V| ^{3/2})。更一般地,我们展示了一种算法,该算法通过查询最多阶的|V| +(|V| /k)^{3/2}边标签来实现O(k)内的最优性。该算法的运行时间至多为|E| + |V| \log |V|阶。
英文摘要:
We present very efficient active learning algorithms for link classification in signed networks. Our algorithms are motivated by a stochastic model in which edge labels are obtained through perturbations of a initial sign assignment consistent with a two-clustering of the nodes. We provide a theoretical analysis within this model, showing that we can achieve an optimal (to whithin a constant factor) number of mistakes on any graph G = (V,E) such that |E| = Ω(|V|^{3/2}) by querying O(|V|^{3/2}) edge labels. More generally, we show an algorithm that achieves optimality to within a factor of O(k) by querying at most order of |V| + (|V|/k)^{3/2} edge labels. The running time of this algorithm is at most of order |E| + |V|\log|V|.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。