Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Heuristic Stopping Rules For Technology-Assisted Review (2106.09871v1)

Published 18 Jun 2021 in cs.IR and cs.LG

Abstract: Technology-assisted review (TAR) refers to human-in-the-loop active learning workflows for finding relevant documents in large collections. These workflows often must meet a target for the proportion of relevant documents found (i.e. recall) while also holding down costs. A variety of heuristic stopping rules have been suggested for striking this tradeoff in particular settings, but none have been tested against a range of recall targets and tasks. We propose two new heuristic stopping rules, Quant and QuantCI based on model-based estimation techniques from survey research. We compare them against a range of proposed heuristics and find they are accurate at hitting a range of recall targets while substantially reducing review costs.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Eugene Yang (38 papers)
  2. David D. Lewis (6 papers)
  3. Ophir Frieder (24 papers)
Citations (21)

Summary

We haven't generated a summary for this paper yet.