Personalization and Recommendations in Search

被引：1

作者：

Lamkhede, Sudarshan ^{[1
]}

Dong, Anlei ^{[2
]}

Bhattacharya, Moumita ^{[1
]}

Wang, Hongning ^{[3
]}

机构：

[1] Netfix Res, Los Gatos, CA 95032 USA

[2] Microsoft Bing, Ronkonkoma, NY USA

[3] Univ Virginia, Dept Comp Sci, Charlottesville, VA 22903 USA

来源：

COMPANION OF THE WORLD WIDE WEB CONFERENCE, WWW 2023 | 2023年

关键词：

D O I：

10.1145/3543873.3589749

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The utility of a search system for its users can be further enhanced by providing personalized results and recommendations within the search context. However, the research discussions around these aspects of search remain fragmented across different conferences and workshops. Hence, this workshop aims to bring together researchers and practitioners from industry and academia to engage in the discussions of algorithmic and system challenges in search personalization and effectively recommending within search context.

引用

页码：746 / 750

页数：5

共 11 条

[1] A Zero Attention Model for Personalized Product Search [J].

Ai, Qingyao ;

Hill, Daniel N. ;

Vishwanathan, S. V. N. ;

Croft, W. Bruce .

PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, :379-388

[2]

akjournals, Improved regret bounds for the stochastic multi-armedbandit problem

[3]

[Anonymous], 2019, Learning to Diversify for E-commerce Search with Multi-ArmedBandit,

[4]

Hyndman RJ, 2008, SPRINGER SER STAT, P1, DOI 10.1007/978-3-540-71918-2

[5]

ku, The borda count method

[6]

omniture, Site Analytics tracking

[7]

stanford, Generalized distances between rankings

[8]

stanford, The anatomy of a large-scale hypertextual Websearch engine

[9]

umbertostraccia, Rank vs score-based rank aggregation methods

[10]

Williamson David P., Rank Aggregation Problem

← 1 2 →