Manifold coarse graining for online semi-supervised learning

  • Authors:
  • Mehrdad Farajtabar;Amirreza Shaban;Hamid Reza Rabiee;Mohammad Hossein Rohban

  • Affiliations:
  • AICTC Research Center, Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;AICTC Research Center, Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;AICTC Research Center, Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;AICTC Research Center, Department of Computer Engineering, Sharif University of Technology, Tehran, Iran

  • Venue:
  • ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

When the number of labeled data is not sufficient, Semi-Supervised Learning (SSL) methods utilize unlabeled data to enhance classification. Recently, many SSL methods have been developed based on the manifold assumption in a batch mode. However, when data arrive sequentially and in large quantities, both computation and storage limitations become a bottleneck. In this paper, we present a new semisupervised coarse graining (CG) algorithm to reduce the required number of data points for preserving the manifold structure. First, an equivalent formulation of Label Propagation (LP) is derived. Then a novel spectral view of the Harmonic Solution (HS) is proposed. Finally an algorithm to reduce the number of data points while preserving the manifold structure is provided and a theoretical analysis on preservation of the LP properties is presented. Experimental results on real world datasets show that the proposed method outperforms the state of the art coarse graining algorithm in different settings.