Bits-over-Random shows that retrieval systems reporting over 99% success on datasets like 20 Newsgroups often match random performance once chance is accounted for via hypergeometric baseline.
ACM Transactions on Information Systems , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The 99% Success Paradox: When Near-Perfect Retrieval Equals Random Selection
Bits-over-Random shows that retrieval systems reporting over 99% success on datasets like 20 Newsgroups often match random performance once chance is accounted for via hypergeometric baseline.