Active Community Detection with Maximal Expected Model Change
We present a novel active learning algorithm for community detection on networks. Our proposed algorithm uses a Maximal Expected Model Change (MEMC) criterion for querying network nodes label assignments. MEMC detects nodes that maximally change the community assignment likelihood model following a query. Our method is inspired by detection in the benchmark Stochastic Block Model (SBM), where we provide sample complexity analysis and empirical study with SBM and real network data for binary as well as for the multi-class settings. The analysis also covers the most challenging case of sparse degree and below-detection-threshold SBMs, where we observe a super-linear error reduction. MEMC is shown to be superior to the random selection baseline and other state-of-the-art active learners.
Code (0)
등록된 구현이 없습니다.
Tasks
Active LearningCommunity DetectionmodelStochastic Block ModelSimilar Papers 제목 키워드 기반
Active Learning for Visual Question Answering: An Empirical Study
We present an empirical study of active learning for Visual Question Answering, where a deep VQA model selects informative question-image pairs from a pool and queries an oracle for answers to maximally improve its perfo…
Active LearningVisual Question AnsweringVisual Question Answering (VQA)Test Distribution-Aware Active Learning: A Principled Approach Against Distribution Shift and Outliers
Expanding on MacKay (1992), we argue that conventional model-based methods for active learning - like BALD - have a fundamental shortfall: they fail to directly account for the test-time distribution of the input variabl…
Active LearningCommunity Enforcement with Endogenous Records
I study repeated games with anonymous random matching where players endogenously decide whether to disclose signals about their past actions. I establish an-anti folk theorem, that when players are sufficiently long-live…
Spectral CUSUM for Online Network Structure Change Detection
Detecting abrupt changes in the community structure of a network from noisy observations is a fundamental problem in statistics and machine learning. This paper presents an online change detection algorithm called Spectr…
Change DetectionCommunity DetectionEvent DetectionOnline Community DetectionNetwork Filtering for Big Data: Triangulated Maximally Filtered Graph
We propose a network-filtering method, the Triangulated Maximally Filtered Graph (TMFG), that provides an approximate solution to the Weighted Maximal Planar Graph problem. The underlying idea of TMFG consists in buildin…
ClusteringCommunity Detection