z-logo
open-access-imgOpen Access
Learning On-the-Job to Re-rank Anomalies from Top-1 Feedback
Author(s) -
Hemank Lamba,
Leman Akoglu
Publication year - 2019
Publication title -
society for industrial and applied mathematics ebooks
Language(s) - English
Resource type - Book series
DOI - 10.1137/1.9781611975673.69
Subject(s) - detector , anomaly detection , leverage (statistics) , rank (graph theory) , ranking (information retrieval) , computer science , learning to rank , anomaly (physics) , data mining , machine learning , artificial intelligence , information retrieval , mathematics , physics , telecommunications , combinatorics , condensed matter physics
In many anomaly mining scenarios, a human expert verifies the anomaly at-the-top (as ranked by an anomaly detector) before they move on to the next. This verification produces a label—true positive (TP) or false positive (FP). In this work, we show how to leverage this label feedback for the top-1 instance to quickly re-rank the anomalies in an online fashion. In contrast to a detector that ranks once and goes offline, we propose a detector called OJRANK that works alongside the human and continues to learn (how to rank) on-the-job, i.e., from every feedback. The benefits OJRANK provides are two-fold; it reduces (i) the false positive rate by ‘muting’ the anomalies similar to FP instances; as well as (ii) the expert effort by elevating to the top the anomalies similar to a TP instance. We show that OJRANK achieves statistically significant improvement on both detection precision and human effort over the offline detector as well as existing state-of-the-art ranking strategies, while keeping the per feedback response time (to re-rank) well below a second.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom