We presented a top-k algorithm to retrieve tuples according to the order provided by a non-necessarily monotone ranking funtion that belongs to a novel family of functions. The conditions imposed on the ranking functions are related to the values where the maximum score is achieved.
On Top-k Retrieval for a Family of Non-monotonic Ranking Functions
Straccia U
2013
Abstract
We presented a top-k algorithm to retrieve tuples according to the order provided by a non-necessarily monotone ranking funtion that belongs to a novel family of functions. The conditions imposed on the ranking functions are related to the values where the maximum score is achieved.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_254913-doc_68907.pdf
solo utenti autorizzati
Descrizione: fqas13
Tipologia:
Versione Editoriale (PDF)
Dimensione
233.75 kB
Formato
Adobe PDF
|
233.75 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
prod_254913-doc_78257.pdf
solo utenti autorizzati
Descrizione: On Top-k Retrieval for a Family of Non-monotonic Ranking Functions
Tipologia:
Versione Editoriale (PDF)
Dimensione
233.75 kB
Formato
Adobe PDF
|
233.75 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
