thesis
oaioai:d-scholarship.pitt.edu:8173

Adaptive Graph-Based Algorithms for Conditional Anomaly Detection and Semi-Supervised Learning

Abstract

We develop graph-based methods for conditional anomaly detection and 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. Anomaly detection techniques are used to identify anomalous (unusual) patterns in data. In clinical settings, these may concern identifications of unusual patient--state outcomes or unusual patient-management decisions. Therefore, we also present graph-based methods for detecting conditional anomalies and apply it 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 worthwhile to raise an alert if such a condition is encountered. Conditional anomaly detection extends standard unconditional anomaly framework but also faces new problems known as fringe and isolated points. We devise novel nonparametric graph-based methods to tackle these problems. Our methods rely on graph connectivity analysis and soft harmonic solution. Finally, we conduct an extensive human evaluation study of our conditional anomaly methods by 15 experts in critical care

Similar works

Full text

thumbnail-image

D-Scholarship@Pitt

Provided a free PDF
oaioai:d-scholarship.pitt.edu:8173Last time updated on 7/19/2013View original full text link

This paper was published in D-Scholarship@Pitt.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.