Talk:Ranking (information retrieval)

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Other Meaning(s)

Ranking functions also are a tool for proving termination of programs. Here the ranking function maps configurations to a well-founded ordering in such a way that any step of the program will make the value decrease. See Colón & Sipma, Proc. TACAS 2001. PhS (talk) 12:26, 14 July 2010 (UTC)[reply]

This is not about ranking functions

This page isn't about ranking functions at all; it's about weighting schemes. Cosine similarity is a ranking function. Qwertyus (talk) 09:33, 12 September 2012 (UTC)[reply]

Exactly what made you think that? Article is exteremely light on material, but I think it's in the right general direction. I don't get your "at all" remark. I've always thought of cosine similarity, as more of a distance metric between documents, better suited for things like clustering. Just summing up tf-idfs scores for each query term is as good (or, rather, as bad) a scoring functing as cosine similarity between tf-idf vectors of query and document IMHO. -- X7q (talk) 22:54, 12 September 2012 (UTC)[reply]

This is definitely about information retrieval ranking functions (aka relevance scoring algorithms.) See Manning's text in Information Retrieval "Scoring, term weighting and the vector space model" Elvenhack (talk) 13:46, 19 September 2012 (UTC)[reply]