Data-Adaptive Active Sampling for Efficient Graph-Cognizant Classification

• Published in: IEEE transactions on signal processing Vol. 66; no. 19; pp. 5167 - 5179
• Main Authors: Berberidis, Dimitris, Giannakis, Georgios B.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Active learning; Adaptive sampling; Classification; Combinatorial analysis; Confidence; Correlation; Covariance matrices; expected change; graph-based; Graphical representations; Labels; Laplace equations; Markov chains; Minimization; Nodes; Numerical models; Optimality criteria; Optimization; Predictive models; Retraining; Sampling methods; Training
• DOI: 10.1109/TSP.2018.2866812
• ISSN: 1053-587X

This paper deals with 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 across 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 change on the GMRF, and in this sense it is the most informative on average. Connections are established to other sampling methods including uncertainty sampling, variance minimization, and sampling based on the Σ-optimality criterion. A simple yet effective heuristic is also introduced for increasing the exploration capabilities of the sampler, and reducing bias of the resultant classifier, by adjusting the confidence on the model label predictions. The novel sampling strategies are based on quantities that are readily available without the need for model retraining, rendering them computationally efficient and 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.