.png){kind=icon}
Return
MTC: A Fast and Robust Graph-Based Transductive Learning Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2014.2363679.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Graph-based method
large-scale manifold learning
semisupervised learning (SSL)
transductive learning (TL)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.6K
Citations:
7.2W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveThe influence of polymer chain length on the fracture toughness of polymer-modified Portland cements
PREAI
ShareSaveShareSave
View more