Ranking Instance
(Redirected from ranking)
Jump to navigation
Jump to search
A Ranking Instance is a item relationship instance that ...
- Context:
- It can (often) be produced by a Ranking System (supporting a ranking task).
- ...
- Exmaple(s):
- ...
- Counter-Exmaple(s):
- a Rating Instance, such as a chess Elo ranking instance.
- See: Non-Parametric Statistics, Order Theory, Strict Weak Ordering, Total Preorder, Total Order, Hardness, Ordinal Numbers, Relevance.
References
2024
- (Wikipedia, 2024) ⇒ https://en.wikipedia.org/wiki/Ranking Retrieved:2024-4-7.
- A ranking is a relationship between a set of items such that, for any two items, the first is either "ranked higher than", "ranked lower than", or "ranked equal to" the second. In mathematics, this is known as a weak order or total preorder of objects. It is not necessarily a total order of objects because two different objects can have the same ranking. The rankings themselves are totally ordered. For example, materials are totally preordered by hardness, while degrees of hardness are totally ordered. If two items are the same in rank it is considered a tie. By reducing detailed measures to a sequence of ordinal numbers, rankings make it possible to evaluate complex information according to certain criteria. Thus, for example, an Internet search engine may rank the pages it finds according to an estimation of their relevance, making it possible for the user quickly to select the pages they are likely to want to see.
Analysis of data obtained by ranking commonly requires non-parametric statistics.
- A ranking is a relationship between a set of items such that, for any two items, the first is either "ranked higher than", "ranked lower than", or "ranked equal to" the second. In mathematics, this is known as a weak order or total preorder of objects. It is not necessarily a total order of objects because two different objects can have the same ranking. The rankings themselves are totally ordered. For example, materials are totally preordered by hardness, while degrees of hardness are totally ordered. If two items are the same in rank it is considered a tie. By reducing detailed measures to a sequence of ordinal numbers, rankings make it possible to evaluate complex information according to certain criteria. Thus, for example, an Internet search engine may rank the pages it finds according to an estimation of their relevance, making it possible for the user quickly to select the pages they are likely to want to see.