ML Anthology

Extended Performance Graphs for Cluster Retrieval

Dionysius P. Huijsmans, Nicu Sebe
CVPR 2001 pp. I:26-
doi:10.1109/CVPR.2001.990452 /cvpr/2001/huijsmans2001cvpr-extended/

Abstract

Performance evaluations in probabilistic information retrieval are often presented as precision-recall or precision-scope graphs avoiding the otherwise dominating effect of the embedding irrelevant fraction. However, precision and recall values as such offer an incomplete overview of the information retrieval system under study: information about system parameters like generality (the embedding of the relevant fraction), random performance, and the effect of varying the scope is missed In this paper two cluster performance graphs are presented In those cases where complete ground truth is available (both cluster size and database size) the cluster precision-recall (Cluster PR) graph and the generality-precision=recall graph are proposed.

CVPR Semantic Scholar

Cite

Text

Huijsmans and Sebe. "Extended Performance Graphs for Cluster Retrieval." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001. doi:10.1109/CVPR.2001.990452

Markdown

[Huijsmans and Sebe. "Extended Performance Graphs for Cluster Retrieval." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2001.](https://mlanthology.org/cvpr/2001/huijsmans2001cvpr-extended/) doi:10.1109/CVPR.2001.990452

BibTeX

@inproceedings{huijsmans2001cvpr-extended,
  title     = {{Extended Performance Graphs for Cluster Retrieval}},
  author    = {Huijsmans, Dionysius P. and Sebe, Nicu},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2001},
  pages     = {I:26-},
  doi       = {10.1109/CVPR.2001.990452},
  url       = {https://mlanthology.org/cvpr/2001/huijsmans2001cvpr-extended/}
}