71 search results - page 10 / 15 » Relative Entropy Policy Search |
108
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
129
click to vote
SIGKDD
2010
14 years 10 months ago
2010
This paper suggests a framework for mining subjectively interesting pattern sets that is based on two components: (1) the encoding of prior information in a model for the data min...
131
click to vote
ADC
2004
Springer
15 years 9 months ago
2004
Springer
Recently the concept of a clarity score was introduced in order to measure the ambiguity of a query in relation to the collection in which the query issuer is seeking information ...
144
click to vote
CPC
1999
15 years 3 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
156
click to vote
CHI
2004
ACM
15 years 9 months ago
2004
ACM
Do different design and information content factors influence trust and mistrust of online health sites? Fifteen women faced with a risky health decision were observed while searc...