When experts agree using non-affiliated experts to rank popular topics.
In response to a query, a search engine returns a ranked list of documents. If the query is about a popular topic (i.e., it matches many documents), then the returned list is usually too long to view fully. Studies show that users usually look at only the top 10 to 20 results. However, we can exploi...
| הוצא לאור ב: | ACM transactions on information systems. 20, 1 (2002). |
|---|---|
| מחבר ראשי: | |
| מחברים אחרים: | |
| פורמט: | Article |
| שפה: | English |
| נושאים: |