Sub-Graph Regularization for Scalable Semi-supervised Classification
M Zhao, Y Zhang, XS Tang - 2019 IEEE 17th International …, 2019 - ieeexplore.ieee.org
M Zhao, Y Zhang, XS Tang
2019 IEEE 17th International Conference on Industrial Informatics …, 2019•ieeexplore.ieee.orgDuring the past decade, graph-based semi-supervised learning has become one of the most
important research areas in machine learning and artificial intelligence community. In this
paper, we propose a sub-graph to construct the graph for semi-supervised learning (SSL).
The new graph is scalable so that it can be extended to large-scale data. Based on this
graph, we then propose a sub-graph regularization for scalable SSL. It can also project the
new-coming data to infer its label for handling out-of-sample problem. Simulation results …
important research areas in machine learning and artificial intelligence community. In this
paper, we propose a sub-graph to construct the graph for semi-supervised learning (SSL).
The new graph is scalable so that it can be extended to large-scale data. Based on this
graph, we then propose a sub-graph regularization for scalable SSL. It can also project the
new-coming data to infer its label for handling out-of-sample problem. Simulation results …
During the past decade, graph-based semi-supervised learning has become one of the most important research areas in machine learning and artificial intelligence community. In this paper, we propose a sub-graph to construct the graph for semi-supervised learning (SSL). The new graph is scalable so that it can be extended to large-scale data. Based on this graph, we then propose a sub-graph regularization for scalable SSL. It can also project the new-coming data to infer its label for handling out-of-sample problem. Simulation results show that the proposed method can achieve better performance compared with other state-of-the-art graph based SSL methods.
ieeexplore.ieee.org
Showing the best result for this search. See all results