返回
MTC: A Fast and Robust Graph-Based Transductive Learning Method
DOI:10.1109/TNNLS.2014.2363679.png)
摘要
En 中文
Despite the great success of graph-based transductive learning methods, most of them have serious problems in scalability and robustness. In this paper, we propose an efficient and robust graph-based transductive classification method, called minimum tree cut (MTC), which is suitable for large-scale data. Motivated from the sparse representation of graph, we approximate a graph by a spanning tree. Exploiting the simple structure, we develop a linear-time algorithm to label the tree such that the cut size of the tree is minimized This significantly improves graph-based methods, which typically have a polynomial time complexity. Moreover, we theoretically and empirically show that the performance of MTC is robust to the graph construction, overcoming another big problem of traditional graph-based methods. Extensive experiments on public data sets and applications on web-spam detection and interactive image segmentation demonstrate our method's advantages in aspect of accuracy, speed, and robustness.
Keyword:
Graph-based method
large-scale manifold learning
semisupervised learning (SSL)
transductive learning (TL)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Geochemistry and zircon U–Pb geochronology of mafic rocks in the Kaiyuan tectonic mélange of northern Liaoning Province, NE China: Constraints on the tectonic evolution of the Paleo‐Asian Ocean中国东北辽宁省北部开元构造m é lange中镁铁质岩的地球化学和锆石u-pb年代学: 古亚洲海洋构造演化的制约因素
The influence of polymer chain length on the fracture toughness of polymer-modified Portland cements

