How deeply does Outlier Detection in Python cover retrieval ranking?

Uses ranks for score correlation, high-score filtering, and identifier conversion without defining a general ranking algorithm.

Retrieval ranking

As explained in Outlier Detection in Python

An ordering of observations from lowest to highest or highest to lowest according to their values.

Ranking assigns observations positions according to their values. It helps compare detector outputs when their score scales differ and can turn naturally ordered identifiers into positions for processing. section 8.4 section 9.2.4

Ranking supports two practical tasks:

Compare outlier detectors with Spearman correlation, which measures the Pearson correlation between score ranks rather than raw scores. section 8.4
Focus comparison on likely outliers: one approach keeps records in at least one detector’s top 5%; another ranks each score column and zeros ranks at or below the 95th percentile. section 8.4
Convert sequential employee IDs, even when numbering starts somewhere other than 1, into rank order for processing. section 9.2.4

How Outlier Detection in Python covers it

liveBook manning.com

Read Outlier Detection in Python on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

AI-Powered SearchSearch ranking is the process of ordering retrieved items according to their estimated usefulness or relevance to a query.
liveBook manning.com

Data Without LabelsRank is an ordered position assigned to an observation or value relative to others.
liveBook manning.com

Just Use Postgres!Relevance ranking orders text-search results according to how closely their contents match a query.

Compare how 4 books explain retrieval ranking →

Related concepts

reciprocal rank fusionused by · Reciprocal rank fusion is a rank-aggregation technique that combines ranked lists by summing reciprocal-rank contributions for each item across the lists.
normalized discounted cumulative gainmeasured by · Normalized discounted cumulative gain is a ranking metric that discounts graded relevance by result position and normalizes the score against the ideal ranking’s discounted gain.
boostconfigured by · A boost is a scoring adjustment that changes the relevance contribution of selected search terms, fields, clauses, or documents.
two-stage systempart of · A system architecture that performs fast initial candidate selection followed by more sophisticated processing of the selected candidates.
algorithmused by · An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.

This explainer was generated by Manning's knowledge graph from the text of Outlier Detection in Python. The section links point to the parts of the book it draws on.