Combining Counting Processes and Classification Improves a Stopping Rule for Technology Assisted Review
Technology Assisted Review (TAR) stopping rules aim to reduce the cost of manually assessing documents for relevance by minimising the number of documents that need to be examined to ensure a desired level of recall. This paper extends an effective stopping rule using information derived from a text classifier that can be trained without the need for any additional annotation. Experiments on multiple data sets (CLEF e-Health, TREC Total Recall, TREC Legal and RCV1) showed that the proposed approach consistently improves performance and outperforms several alternative methods.
Code (1)
Tasks
TARSimilar Papers 제목 키워드 기반
Deep Learning for the Multiple Optimal Stopping Problem
This paper presents a novel deep learning framework for solving multiple optimal stopping problems in high dimensions. While deep learning has recently shown promise for single stopping problems, the multiple exercise ca…
Second-order Confidence Network for Early Classification of Time Series
Time series data are ubiquitous in a variety of disciplines. Early classification of time series, which aims to predict the class label of a time series as early and accurately as possible, is a significant but challengi…
Early ClassificationTime SeriesImproving P300 Speller performance by means of optimization and machine learning
Brain-Computer Interfaces (BCIs) are systems allowing people to interact with the environment bypassing the natural neuromuscular and hormonal outputs of the peripheral nervous system (PNS). These interfaces record a use…
BIG-bench Machine LearningEEGElectroencephalogram (EEG)ERP+1Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
The best arm identification problem requires identifying the best alternative (i.e., arm) in active experimentation using the smallest number of experiments (i.e., arm pulls), which is crucial for cost-efficient and time…
Optimal Equilibria for Multi-dimensional Time-inconsistent Stopping Problems
We study an optimal stopping problem under non-exponential discounting, where the state process is a multi-dimensional continuous strong Markov process. The discount function is taken to be log sub-additive, capturing de…