skip to main content
research-article

Neighborhood graph construction for semi-supervised learning

Published:21 June 2016Publication History
Skip Abstract Section

Abstract

Semi-supervised learning (SSL) is useful when few labeled and plenty of unlabeled examples are available. This occurs in most of the cases due to labeled instances be difficult, expensive and time consuming to be obtained since human experts are required for the labeling task (Chapelle, Schlkopf, & Zien, 2010). The training set contain labeled data represented by XL = {(x1, y1) ... (x1, y1)}, and unlabelled data represented as XU = {xl+1 ... xl+u}. The total amount of training data is X = l ∪ u. The set of labeled examples is associated with the labels LY = {y1, ..., yl} where yi ε {1,..., c} and c is the number of classes. The purpose of SSL is to infer the missing labels YU = {yl+1,..., yn} corresponding to the unlabelled set XU.

References

  1. Berton, L., & de Andrade Lopes, A. (2014). Graph construction based on labeled instances for semi-supervised learning. In 22nd international conference on pattern recognition (pp. 2477--2482). doi: 10.1109/ICPR.2014.428 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Berton, L., Valverde-Rebaza, J., & de Andrade Lopes, A. (2015). Link prediction in graph construction for supervised and semi-supervised learning. In International joint conference on neural networks (pp. 1--8).Google ScholarGoogle Scholar
  3. Chapelle, O., Schlkopf, B., & Zien, A. (2010). Semi-supervised learning (1st ed.). The MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Jebara, T., Wang, J., & Chang, S.-F. (2009). Graph construction and b-matching for semi-supervised learning. In 26th annual international conference on machine learning (pp. 441--448). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Vega-Oliveros, D. A., Berton, L., Eberle, A., Lopes, A. d. A., & Zhao, L. (2014). Regular graph construction for semi-supervised learning. In Journal of physics: Conference series (Vol. 490, pp. 012022-1-012022-4).Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image AI Matters
    AI Matters  Volume 2, Issue 3
    Spring 2016
    30 pages
    EISSN:2372-3483
    DOI:10.1145/2911172
    Issue’s Table of Contents

    Copyright © 2016 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 21 June 2016

    Check for updates

    Qualifiers

    • research-article
  • Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)1

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader