منابع مشابه
Order-theoretical ranking
Current best-match ranking (BMR) systems perform well but cannot handle word mismatch between a query and a document. The best known alternative ranking method, hierarchical clustering-based ranking (HCR), seems to be more robust than BMR with respect to this problem, but it is hampered by theoretical and practical limitations. We present an approach to document ranking that explicitly addresse...
متن کاملA Theoretical Analysis of NDCG Ranking Measures
A central problem in ranking is to design a measure for evaluation of ranking functions. In this paper we study, from a theoretical perspective, the Normalized Discounted Cumulative Gain (NDCG) which is a family of ranking measures widely used in practice. Although there are extensive empirical studies of the NDCG family, little is known about its theoretical properties. We first show that, wha...
متن کاملOrder Theoretical Semantic Recommendation
Mathematical concepts of order and ordering relations play multiple roles in semantic technologies. Discrete totally ordered data characterize both input streams and top-k rank-ordered recommendations and query output, while temporal attributes establish numerical total orders, either over time points or in the more complex case of startend temporal intervals. But also of note are the fully par...
متن کاملA Ranking Semantics for First-Order Conditionals
Usually, default rules in the form of conditional statements are built on propositional logic, representing classes of individuals by propositional variables, as in “Birds fly, but penguins don’t”. Only few approaches have addressed the problem of giving formal semantics to first-order conditionals that allow (nonmonotonic) inferences both for classes and for individuals. In this paper, we pres...
متن کاملRanking Asymmetric Auctions using the Dispersive Order
The revenue ranking of asymmetric auctions with two heterogenous bidders is examined. The main theorem identi es a general environment in which the rst-price auction is more pro table than the second-price auction. By using mechanism design techniques, the problem is simpli ed and several extensions are made possible. Roughly speaking, the rst-price auction is more pro table when the strong b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Society for Information Science
سال: 2000
ISSN: 0002-8231,1097-4571
DOI: 10.1002/(sici)1097-4571(2000)51:7<587::aid-asi2>3.0.co;2-l