diff options
author | Luuk Arts | 2017-10-06 12:23:34 +0200 |
---|---|---|
committer | GitHub | 2017-10-06 12:23:34 +0200 |
commit | c5cf18c671401efafbef34bbc18e3328be499f8c (patch) | |
tree | 970cbaeadd89e2b15c56dc4757d9f283f7940e55 /Plan.md | |
parent | Update Plan.md (diff) |
Update Plan.md
Diffstat (limited to 'Plan.md')
-rw-r--r-- | Plan.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -48,7 +48,7 @@ Our hypothesis is that not all of the fields are of similar importance. As such, our idea is to use some kind of Hill-Climbing algorithm to determine just what combination of fields (or possible weights) produces the best ranking. The quality of the ranking is determined by measuring effectiveness in terms of Normalized Discounted Cumulative Gain (NDCG). -We calculate the NDCG@10, NDCG@100 for (each of) the ranking function(s) (BM25, PRMS, MLM, LM), so the hill climbing algorithm can compare the output for the various combinations of fields and so we can analyze if the effectiveness of our output is an improvement over the base rankings described in the DBpedia-Entity repo. +We calculate the NDCG@10, NDCG@100 for (each of) the ranking function(s) (BM25, PRMS, MLM, LM), so the hill climbing algorithm can compare the output for the various combinations of fields and so we can analyze if the effectiveness of our ranking is an improvement over the base rankings described in the DBpedia-Entity repo. ## Nordlys Nordlyss is a toolkit for entity-oriented and semantic search. It currently supports four entity-oriented tasks, which could be useful for our project. These entity-oriented tasks are: |