Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
6-2014
Abstract
As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show the advantages of PGP.
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing
Research Areas
Data Science and Engineering
Publication
Proceedings of the 31st International Conference on Machine Learning, Beijing, China, 21-26 June 2014
First Page
1
Last Page
9
Publisher
JMLR
City or Country
Cambridge, MA
Citation
FANG, Yuan; CHANG, Kevin Chen-Chuan; and LAUW, Hady W..
Graph-based Semi-supervised Learning: Realizing Pointwise Smoothness Probabilistically. (2014). Proceedings of the 31st International Conference on Machine Learning, Beijing, China, 21-26 June 2014. 1-9.
Available at: https://ink.library.smu.edu.sg/sis_research/2249
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://jmlr.org/proceedings/papers/v32/fang14.pdf
Included in
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons