%0 Conference Paper %1 davis06 %A Davis, Jesse %A Goadrich, Mark %B ICML '06: Proceedings of the 23rd international conference on Machine learning %C New York, NY, USA %D 2006 %I ACM %K thesis %P 233--240 %R http://doi.acm.org/10.1145/1143844.1143874 %T The Relationship Between Precision-Recall and ROC Curves %U http://portal.acm.org/citation.cfm?id=1143874 %X 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 connection exists between ROC space and PR space, such that a curve dominates in ROC space if and only if it dominates in PR space. A corollary is the notion of an achievable PR curve, which has properties much like the convex hull in ROC space; we show an efficient algorithm for computing this curve. Finally, we also note differences in the two types of curves are significant for algorithm design. For example, in PR space it is incorrect to linearly interpolate between points. Furthermore, algorithms that optimize the area under the ROC curve are not guaranteed to optimize the area under the PR curve. %@ 1-59593-383-2

@inproceedings{davis06, abstract = {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 connection exists between ROC space and PR space, such that a curve dominates in ROC space if and only if it dominates in PR space. A corollary is the notion of an achievable PR curve, which has properties much like the convex hull in ROC space; we show an efficient algorithm for computing this curve. Finally, we also note differences in the two types of curves are significant for algorithm design. For example, in PR space it is incorrect to linearly interpolate between points. Furthermore, algorithms that optimize the area under the ROC curve are not guaranteed to optimize the area under the PR curve.}, added-at = {2011-12-07T11:15:34.000+0100}, address = {New York, NY, USA}, author = {Davis, Jesse and Goadrich, Mark}, biburl = {https://www.bibsonomy.org/bibtex/2576166847a9527bdf0a0279a3e82b849/sangarbl}, booktitle = {ICML '06: Proceedings of the 23rd international conference on Machine learning}, description = {The relationship between Precision-Recall and ROC curves}, doi = {http://doi.acm.org/10.1145/1143844.1143874}, interhash = {e4ea92aea3ff8bbb3eb04c64867505f2}, intrahash = {576166847a9527bdf0a0279a3e82b849}, isbn = {1-59593-383-2}, keywords = {thesis}, location = {Pittsburgh, Pennsylvania}, pages = {233--240}, publisher = {ACM}, timestamp = {2011-12-07T11:15:34.000+0100}, title = {{The Relationship Between Precision-Recall and ROC Curves}}, url = {http://portal.acm.org/citation.cfm?id=1143874}, year = 2006 }