Distributed Semi-Supervised Learning With Missing Data

Data classification is usually challenged by the difficulty and/or high cost in collecting sufficient labeled data, and unavoidability of data missing. Besides, most of the existing algorithms belong to centralized processing, in which all of the training data must be stored and processed at a fusion center. But in many real applications, data are distributed over multiple nodes, and cannot be centralized to one node for processing due to various reasons. Considering this, in this article, we focus on the problem of distributed classification of missing data with a small proportion of labeled data samples, and develop a distributed semi-supervised missing-data classification (dS(2)MDC) algorithm. The proposed algorithm is a distributed joint subspace/classifier learning, that is, a latent subspace representation for missing feature imputation is learned jointly with the training of nonlinear classifiers modeled by the chi(2) kernel using a semi-supervised learning strategy. Theoretical performance analysis and simulations on several datasets clearly validate the effectiveness of the proposed dS(2)MDC algorithm from different perspectives.