Ranking under near decomposability
In this dissertation, we study the problem of Ranking in the presence of Sparsity focusing on two of the most important and generic ranking settings; namely Link Analysis and Top-N Recommendation. Building on the intuition behind Decomposability – the seminal work of the Nobel Laureate Economist...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10889/9576 |