Active Learning on Attributed Graphs via Graph Cognizant Logistic Regression and Preemptive Query Generation
Node classification in attributed graphs is an important task in multiple practical settings, but it can often be difficult or expensive to obtain labels. Active learning can improve the achieved classification performance for a given budget on the number of queried labels. The best existing methods are based on graph neural networks, but they often perform poorly unless a sizeable validation set of labelled nodes is available in order to choose good hyperparameters. We propose a novel graph-based active learning algorithm for the task of node classification in attributed graphs; our algorithm uses graph cognizant logistic regression, equivalent to a linearized graph convolutional neural network (GCN), for the prediction phase and maximizes the expected error reduction in the query phase. To reduce the delay experienced by a labeller interacting with the system, we derive a preemptive querying system that calculates a new query during the labelling process, and to address the setting where learning starts with almost no labelled data, we also develop a hybrid algorithm that performs adaptive model averaging of label propagation and linearized GCN inference. We conduct experiments on five public benchmark datasets, demonstrating a significant improvement over state-of-the-art approaches and illustrate the practical value of the method by applying it to a private microwave link network dataset.
Code (0)
등록된 구현이 없습니다.
Tasks
Active LearningClassificationGeneral ClassificationNode ClassificationregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
SEAL: Semi-supervised Adversarial Active Learning on Attributed Graphs
Active learning (AL) on attributed graphs has received increasing attention with the prevalence of graph-structured data. Although AL has been widely studied for alleviating label sparsity issues with the conventional no…
Active LearningGraph EmbeddingInformativenessQuery Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed
Given one or more query vertices, Community Search (CS) aims to find densely intra-connected and loosely inter-connected structures containing query vertices. Attributed Community Search (ACS), a related problem, is more…
AttributeCommunity SearchGraph ClusteringGraph Embedding+1Generalization, Expressivity, and Universality of Graph Neural Networks on Attributed Graphs
We analyze the universality and generalization of graph neural networks (GNNs) on attributed graphs, i.e., with node attributes. To this end, we propose pseudometrics over the space of all attributed graphs that describe…
Generalization BoundsFrom Mice to Trains: Amortized Bayesian Inference on Graph Data
Graphs arise across diverse domains, from biology and chemistry to social and information networks, as well as in transportation and logistics. Inference on graph-structured data requires methods that are permutation-inv…
Bayesian InferenceA Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation
Attributed networks containing entity-specific information in node attributes are ubiquitous in modeling social networks, e-commerce, bioinformatics, etc. Their inherent network topology ranges from simple graphs to hype…
AttributeClusteringGPUGraph Clustering+2