• DocumentCode
    1442374
  • Title

    Active Learning Based on Locally Linear Reconstruction

  • Author

    Zhang, Lijun ; Chen, Chun ; Bu, Jiajun ; Cai, Deng ; He, Xiaofei ; Huang, Thomas S.

  • Author_Institution
    Zhejiang Provincial Key Lab. of Service Robot, Zhejiang Univ., Hangzhou, China
  • Volume
    33
  • Issue
    10
  • fYear
    2011
  • Firstpage
    2026
  • Lastpage
    2038
  • Abstract
    We consider the active learning problem, which aims to select the most representative points. Out of many existing active learning techniques, optimum experimental design (OED) has received considerable attention recently. The typical OED criteria minimize the variance of the parameter estimates or predicted value. However, these methods see only global euclidean structure, while the local manifold structure is ignored. For example, I-optimal design selects those data points such that other data points can be best approximated by linear combinations of all the selected points. In this paper, we propose a novel active learning algorithm which takes into account the local structure of the data space. That is, each data point should be approximated by the linear combination of only its neighbors. Given the local reconstruction coefficients for every data point and the coordinates of the selected points, a transductive learning algorithm called Locally Linear Reconstruction (LLR) is proposed to reconstruct every other point. The most representative points are thus defined as those whose coordinates can be used to best reconstruct the whole data set. The sequential and convex optimization schemes are also introduced to solve the optimization problem. The experimental results have demonstrated the effectiveness of our proposed method.
  • Keywords
    convex programming; data structures; learning (artificial intelligence); I-optimal design; active learning algorithm; convex optimization; data points; data space local structure; global Euclidean structure; local manifold structure; local reconstruction coefficient; locally linear reconstruction; optimization problem; optimum experimental design; parameter estimate; representative point selection; sequential optimization; transductive learning algorithm; Algorithm design and analysis; Convex functions; Manifolds; Nearest neighbor searches; Optimization; Pattern analysis; Active learning; experimental design; local structure; reconstruction.;
  • fLanguage
    English
  • Journal_Title
    Pattern Analysis and Machine Intelligence, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0162-8828
  • Type

    jour

  • DOI
    10.1109/TPAMI.2011.20
  • Filename
    5708150