arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.05157cs.IR
收藏

一种重寻的排序算法

A Ranking Algorithm for Re-finding

Gangli Liu

摘要:

从个人计算机中重新查找文件是用户的一个常见需求。当遇到困难的重新查找任务时,人们可能无法回忆起传统重新查找方法所使用的属性,例如文件的路径、文件名、关键字等,重新查找将失败。我们提出了一种方法来支持困难的重新查找任务。通过向用户询问一系列关于目标的问题,如文档的页码、作者编号、累计阅读时间、最后阅读位置等,然后使用用户的答案筛选出目标。在用户回答了一系列关于目标文件的问题后,我们根据答案来评估用户对目标文件的熟悉程度。我们设计了一个排序算法,通过比较用户对目标和候选人的熟悉程度对候选人进行排序。我们还提出了一种方法来生成重新查找任务的基础上,用户自己的文档语料库人工。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑