A Ranking Algorithm for Re-finding
Re-finding files from a personal computer is a frequent demand to users. When encountered a difficult re-finding task, people may not recall the attributes used by conventional re-finding methods, such as a file's path, file name, keywords etc., the re-finding would fail. We proposed a method to support difficult re-finding tasks. By asking the user a list of questions about the target, such as a document's pages, author numbers, accumulated reading time, last reading location etc. Then use the user's answers to filter out the target. After the user answered a list of questions about the target file, we evaluate the user's familiar degree about the target file based on the answers. We devise a ranking algorithm which sorts the candidates by comparing the user's familiarity degree about the target and the candidates. We also propose a method to generate re-finding tasks artificially based on the user's own document corpus.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Approximate Ranking from Pairwise Comparisons
A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes ide…
Fairness of Exposure in Rankings
Rankings are ubiquitous in the online world today. As we have transitioned from finding books in libraries to ranking products, jobs, job applicants, opinions and potential romantic partners, there is a substantial prece…
FairnessThe long-term impact of ranking algorithms in growing networks
When we search online for content, we are constantly exposed to rankings. For example, web search results are presented as a ranking, and online bookstores often show us lists of best-selling books. While popularity-base…
DiversityA Survey on E-Commerce Learning to Rank
In e-commerce, ranking the search results based on users' preference is the most important task. Commercial e-commerce platforms, such as, Amazon, Alibaba, eBay, Walmart, etc. perform extensive and relentless research to…
Learning-To-RankSurveyRanking and synchronization from pairwise measurements via SVD
Given a measurement graph $G= (V,E)$ and an unknown signal $r \in \mathbb{R}^n$, we investigate algorithms for recovering $r$ from pairwise measurements of the form $r_i - r_j$; $\{i,j\} \in E$. This problem arises in a …