You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Let's create a score that rewards articles in which there are few candidate articles retreived and penalizes cases in which a lot of articles are retrieved. This is consistent with Bayesian insights about probability.
To do this for each article, we need three values.
countArticlesRetrieved - count of the articles retrieved; this is only for the articles actually retrieved; note that if we're using the strict name lookup strategy, you need not say, for example, that yiwang has 120,000 pubs
articleCountThresholdScore - this is stored in application.properties
articleCountWeight - this is also stored in application.properties
Count the number of candidate articles retrieved. If retrieval was in strict mode, use the value from searchStrategy-leninent-threshold. Store as countArticlesRetrieved.
Retrieve articleCountThresholdScore and articleCountWeight from application.properties.
Let's create a score that rewards articles in which there are few candidate articles retreived and penalizes cases in which a lot of articles are retrieved. This is consistent with Bayesian insights about probability.
To do this for each article, we need three values.
Count the number of candidate articles retrieved. If retrieval was in strict mode, use the value from
searchStrategy-leninent-threshold
. Store as countArticlesRetrieved.Retrieve articleCountThresholdScore and articleCountWeight from application.properties.
Set articleCount for each article equal to:
The text was updated successfully, but these errors were encountered: