Find link

language:

Find link is a tool written by Edward Betts.

searching for Precision and recall 9 found (59 total)

Query expansion (1,358 words) [view diff] no match in snippet view article find links to article

Query expansion (QE) is the process of reformulating a given query to improve retrieval performance in information retrieval operations, particularly in

Cyril Cleverdon (517 words) [view diff] exact match in snippet view article find links to article

measured in terms of two measures: precision and recall. Test collections and evaluation measures based on precision and recall are driving forces behind modern

Oversampling and undersampling in data analysis (2,512 words) [view diff] exact match in snippet view article find links to article

as precision and recall in each class). Finding the best multi-class classification performance or the best tradeoff between precision and recall is,

Cluster analysis (8,803 words) [view diff] exact match in snippet view article find links to article

recall through a parameter β ≥ 0 {\displaystyle \beta \geq 0} . Let precision and recall (both external evaluation measures in themselves) be defined as follows:

Information seeking (1,565 words) [view diff] exact match in snippet view article find links to article

be technology-oriented, focusing on algorithms and issues such as precision and recall. Information seeking may be understood as a more human-oriented and

Human–computer information retrieval (1,442 words) [view diff] exact match in snippet view article find links to article

automatic query reformulation, leverage the standard IR measures of precision and recall but apply them to the results of multiple iterations of user interaction

Hash function (7,839 words) [view diff] case mismatch in snippet view article find links to article

Fabio; Dell'Amico, Matteo; Balzarotti, Davide (2018-03-13). "Beyond Precision and Recall" (PDF). Proceedings of the Eighth ACM Conference on Data and Application

Shot transition detection (1,970 words) [view diff] exact match in snippet view article find links to article

combined measure that results in high value if, and only if, both precision and recall result in high values: F1=2∗P∗VP+V{\displaystyle F1={2*P*V \over

Fuzzy hashing (815 words) [view diff] case mismatch in snippet view article find links to article

Fabio; Dell'Amico, Matteo; Balzarotti, Davide (2018-03-13). "Beyond Precision and Recall" (PDF). Proceedings of the Eighth ACM Conference on Data and Application