Active sampling for graph-aware classification

• Published in: 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP) pp. 648 - 652
• Main Authors: Berberidis, Dimitris, Giannakis, Georgios B.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2017
• Subjects: Active learning; Adaptation models; classification; Complexity theory; Correlation; expected change; graphs; Indexes; Laplace equations; Numerical models; Predictive models
• DOI: 10.1109/GlobalSIP.2017.8309039

The present work deals with data-adaptive active sampling of graph nodes representing training data for binary classification. The graph may be given or constructed using similarity measures among nodal features. Leveraging the graph for classification builds on the premise that labels over neighboring nodes are correlated according to a categorical Markov random field (MRF). This model is further relaxed to a Gaussian (G)MRF with labels taking continuous values, an approximation that not only mitigates the combinatorial complexity of the categorical model, but also offers optimal unbiased soft predictors of the unlabeled nodes. The proposed sampling strategy is based on querying the node whose label disclosure is expected to inflict the largest expected mean-square deviation on the GMRF, a strategy which subsumes the existing variance-minimization-based sampling method. A simple yet effective heuristic is also introduced for increasing the exploration capabilities, and reducing bias of the resultant estimator, by taking into account the confidence on the model label predictions. The novel sampling strategy is based on quantities that are readily available without the need for model retraining, rendering it scalable to large graphs. Numerical tests using synthetic and real data demonstrate that the proposed methods achieve accuracy that is comparable or superior to the state-of-the-art even at reduced runtime.