Ranking Rich Mobile Verticals based on Clicks and Abandonment

Mami Kawasaki, Inho Kang, T. Sakai
{"title":"Ranking Rich Mobile Verticals based on Clicks and Abandonment","authors":"Mami Kawasaki, Inho Kang, T. Sakai","doi":"10.1145/3132847.3133059","DOIUrl":null,"url":null,"abstract":"We consider the problem of ranking rich verticals, which we call \"cards,\" for a given mobile search query. Examples of card types include \"SHOP\" (showing access and contact information of a shop), \"WEATHER\" (showing a weather forecast for a particular location), and \"TV\" (showing information about a TV programme). These cards can be highly visual and/or concise, and may often satisfy the user's information need without making her click on them. While this \"good abandonment\" of the search engine result page is ideal especially for mobile environments where the interaction between the user and the search engine should be minimal, it poses a challenge for search engine companies whose ranking algorithms rely heavily on click data. In order to provide the right card types to the user for a given query, we propose a graph-based approach which extends a click-based automatic relevance estimation algorithm of Agrawal et al., by incorporating an abandonment-based preference rule. Using a real mobile query log from a commercial search engine, we constructed a data set containing 2,472 pairwise card type preferences covering 992 distinct queries, by hiring three independent assessors. Our proposed method outperforms a click-only baseline by 53-68% in terms of card type preference accuracy. The improvement is also statistically highly significant, with p ≈ 0.0000 according to the paired randomisation test.","PeriodicalId":20449,"journal":{"name":"Proceedings of the 2017 ACM on Conference on Information and Knowledge Management","volume":"85 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM on Conference on Information and Knowledge Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3132847.3133059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We consider the problem of ranking rich verticals, which we call "cards," for a given mobile search query. Examples of card types include "SHOP" (showing access and contact information of a shop), "WEATHER" (showing a weather forecast for a particular location), and "TV" (showing information about a TV programme). These cards can be highly visual and/or concise, and may often satisfy the user's information need without making her click on them. While this "good abandonment" of the search engine result page is ideal especially for mobile environments where the interaction between the user and the search engine should be minimal, it poses a challenge for search engine companies whose ranking algorithms rely heavily on click data. In order to provide the right card types to the user for a given query, we propose a graph-based approach which extends a click-based automatic relevance estimation algorithm of Agrawal et al., by incorporating an abandonment-based preference rule. Using a real mobile query log from a commercial search engine, we constructed a data set containing 2,472 pairwise card type preferences covering 992 distinct queries, by hiring three independent assessors. Our proposed method outperforms a click-only baseline by 53-68% in terms of card type preference accuracy. The improvement is also statistically highly significant, with p ≈ 0.0000 according to the paired randomisation test.
基于点击和放弃对富手机垂直市场进行排名
我们考虑对一个给定的移动搜索查询进行丰富垂直排名的问题,我们称之为“卡片”。卡片类型的例子包括“SHOP”(显示商店的访问权限和联系信息)、“WEATHER”(显示特定位置的天气预报)和“TV”(显示有关电视节目的信息)。这些卡片可以是高度可视化和/或简洁的,并且通常可以满足用户的信息需求,而无需让她点击它们。虽然这种“良好的放弃”搜索引擎结果页面是理想的,特别是在移动环境中,用户和搜索引擎之间的交互应该是最小的,但它对搜索引擎公司的排名算法构成了挑战,搜索引擎公司的排名算法严重依赖于点击数据。为了在给定查询中为用户提供正确的卡片类型,我们提出了一种基于图的方法,该方法通过合并基于放弃的偏好规则,扩展了Agrawal等人的基于点击的自动相关性估计算法。使用来自商业搜索引擎的真实移动查询日志,我们通过雇用三个独立的评估人员构建了一个包含2,472对卡片类型偏好的数据集,涵盖992个不同的查询。我们提出的方法在卡片类型偏好准确性方面优于仅点击基线53-68%。根据配对随机化检验,这种改善在统计学上也非常显著,p≈0.0000。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信