0


优化二维搜索结果呈现

Optimizing Two-Dimensional Search Results Presentation
课程网址: http://videolectures.net/wsdm2011_chierichetti_otd/  
主讲教师: Flavio Chierichetti
开课单位: 罗马大学
开课时间: 信息不详。欢迎您在右侧留言补充。
课程语种: 英语
中文简介:
经典的搜索引擎结果以文档的有序列表的形式呈现,而呈现的问题则被简化为按分数排序文档。这是因为用户从上到下扫描列表表示。这导致了自然的列表优化措施,如折现累积增益(DCG)和排名偏差精度(RBP)。搜索引擎越来越多地使用二维结果表示;图片和购物搜索结果是长期存在的例子。在实际应用中使用的简单启发式是在矩阵表示中按行排列图像。然而,各种证据表明,用户对页面的扫描并不是按照这种矩阵顺序进行的。本文(1)将用户对结果页面的扫描视为马尔可夫链,将DCG和RBP作为线性列表的特例;(2)从点击日志中推断马尔科夫链问题的制定、研究和解决方案;(3)从这些推论的马尔科夫链中,实证验证了民俗现象(如“金三角”)。);(4)开发并实验比较了矩阵表示中优化用户效用的算法。该理论和算法自然地超越了矩阵表示。
课程简介: Classic search engine results are presented as an ordered list of documents and the problem of presentation trivially reduces to ordering documents by their scores. This is because users scan a list presentation from top to bottom. This leads to natural list optimization measures such as the discounted cumulative gain (DCG) and the rank-biased precision (RBP). Increasingly, search engines are using two-dimensional results presentations; image and shopping search results are long-standing examples. The simplistic heuristic used in practice is to place images by row-major order in the matrix presentation. However, a variety of evidence suggests that users' scan of pages is not in this matrix order. In this paper we (1) view users' scan of a results page as a Markov chain, which yields DCG and RBP as special cases for linear lists; (2) formulate, study, and develop solutions for the problem of inferring the Markov chain from click logs; (3) from these inferred Markov chains, empirically validate folklore phenomena (e.g., the "golden triangle" of user scans in two dimensions); and (4) develop and experimentally compare algorithms for optimizing user utility in matrix presentations. The theory and algorithms extend naturally beyond matrix presentations.
关 键 词: 计算机科学; 网页搜索; 搜索引擎
课程来源: 视频讲座网
最后编审: 2019-10-30:cwx
阅读次数: 37