๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The relationship between Recall and Precision

โœ Scribed by Buckland, Michael ;Gey, Fredric


Book ID
102654317
Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
982 KB
Volume
45
Category
Article
ISSN
0002-8231

No coin nor oath required. For personal study only.

โœฆ Synopsis


Empirical studies of retrieval performance have shown a tendency for Precision to decline as Recall increases. This article examines the nature of the relationship between Precision and Recall. The relationships between Recall and the number of documents retrieved, between Precision and the number of documents retrieved, and between Precision and Recall are described in the context of different assumptions about retrieval performance.

It is demonstrated that a tradeoff between Recall and Precision is unavoidable whenever retrieval performance is consistently better than retrieval at random. More generally, for the Precision-Recall trade-off to be avoided as the total number of documents retrieved increases, retrieval performance must be equal to or better than overall retrieval performance up to that point.

Examination of the mathematical relationship between Precision and Recall shows that a quadratic Recall curve can resemble empirical Recall-Precision

behavior if transformed into a tangent parabola. With very large databases and/or systems with limited retrieval capabilities there can be advantages to retrieval in two stages: initial retrieval emphasizing high Recall, followed by more detailed searching of the initially retrieved set, can be used to improve both Recall and Precision simultaneously.

Even so, a tradeoff between Precision and Recall remains.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 23rd international confer
โœ Davis, Jesse; Goadrich, Mark ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› ACM Press โš– 170 KB

Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning.However, when dealing with highly skewed datasets, Precision-Recall (PR) curves give a more informative picture of an algorithm's performance. We show that a deep conne