Adaptive graph-based algorithms for conditional anomaly detection and semi-supervised learning
Michal Valko

TL;DR
This paper introduces efficient graph-based algorithms for semi-supervised learning and conditional anomaly detection, emphasizing online computation, stability, and application to clinical data.
Contribution
It proposes a fast approximate online algorithm for label propagation, regularization techniques for stability, and novel methods for detecting clinical anomalies using graph connectivity.
Findings
The online algorithm achieves good accuracy with reduced computation.
Regularization improves the stability of harmonic solutions.
Graph-based anomaly detection effectively identifies unusual clinical actions.
Abstract
We develop graph-based methods for semi-supervised learning based on label propagation on a data similarity graph. When data is abundant or arrive in a stream, the problems of computation and data storage arise for any graph-based method. We propose a fast approximate online algorithm that solves for the harmonic solution on an approximate graph. We show, both empirically and theoretically, that good behavior can be achieved by collapsing nearby points into a set of local representative points that minimize distortion. Moreover, we regularize the harmonic solution to achieve better stability properties. We also present graph-based methods for detecting conditional anomalies and apply them to the identification of unusual clinical actions in hospitals. Our hypothesis is that patient-management actions that are unusual with respect to the past patients may be due to errors and that it is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
