Definition
D-measure is a family of evaluation measures for diversified search, where we have a set of known intents (a.k.a. subtopics) {i} for a given topic q and the intent probabilities Pr(i|q), such that ∑iPr(i|q) = 1. It is assumed that per-intent graded relevance assessments are also available for the topic and that the gain value for each document of relevance l with respect to a particular intent is given by gainl. For example, let the per-intent gain be 3 for a highly relevant document, 2 for a relevant document, and 1 for a partially relevant document. Given a ranked list, let gi(r) = gainl if the document at rank r is l-relevant to intent i, and gi(r) = 0 otherwise. The global gain at r is defined as GG(r) =∑iPr(i|q)gi(r). An ideal list for diversified search is defined by sorting all known relevant documents by the global gain; the global gain at rank r in the ideal list is denoted by GG∗(r). Then, any graded relevance evaluation measure computed based on GG(r) and GG∗(r)...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Sakai, T. (2018). D-Measure. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80620
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80620
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering