Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3460231.3473899acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
extended-abstract

Leveraging Multi-Faceted User Preferences for Improving Click-Through Rate Predictions

Published: 13 September 2021 Publication History

Abstract

Recommender systems have been widely adopted by many firms across various industries over the past decade, as they could provide numerous economic benefits to the industry, such as influencing consumer choices, generating the lift in sales, and enhancing consumer trust. Many currently-deployed recommender systems primiarily optimize the similarity measure following the Collaborative Filtering paradigm during the recommendation performance, which focuses on the matching between targeted users and items of their interests. Although effective and useful in many cases, these still face several important challenges to fully address consumers’ concerns. In particular, they usually provide recommendations of the most similar items related to the consumption records, without taking into account the multi-faceted consumer preferences. For example, some consumers would be satisfied to receive recommendations that are novel and unexpected to broaden their horizons, while others might be interested to receive recommendations from other product categories to expand their interests. Falling to do so would lead to the filter bubble and exploration-exploitation trade-off phenomenon, which is undesirable because it would significantly reduce sales diversity and deteriorate user satisfaction with recommender systems.
In my thesis proposal, I will describe new methods to design recommender systems following two research streams to tackle the aforementioned challenges, namely unexpected recommender system and cross-domain system. In particular, unexpected recommender systems address consumers’ desire for variety, and aim at providing novel and useful recommendations simultaneously, while cross-domain recommender systems learn consumer preferences from their behaviors in other domains to better predict their behaviors in the target domain. The proposed models are capable of significantly improving recommendation performance and user satisfaction, as demonstrated through extensive offline and online experiments discussed in this proposal.

Supplementary Material

MP4 File (zoom_0.mp4)
Presentation Video

References

[1]
Panagiotis Adamopoulos. 2014. On discovering non-obvious recommendations: Using unexpectedness and neighborhood selection methods in collaborative filtering systems. In Proceedings of the 7th ACM international conference on Web search and data mining. ACM, 655–660.
[2]
Panagiotis Adamopoulos and Alexander Tuzhilin. 2014. On over-specialization and concentration bias of recommendations: Probabilistic neighborhood selection in collaborative filtering systems. In Proceedings of the 8th ACM Conference on Recommender systems. ACM, 153–160.
[3]
Panagiotis Adamopoulos and Alexander Tuzhilin. 2015. On unexpectedness in recommender systems: Or how to better expect the unexpected. ACM Transactions on Intelligent Systems and Technology (TIST) 5, 4(2015), 54.
[4]
Gediminas Adomavicius and YoungOk Kwon. [n.d.]. Overcoming accuracy-diversity tradeoff in recommender systems: a variance-based approach. Citeseer.
[5]
Gediminas Adomavicius and Alexander Tuzhilin. 2005. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge & Data Engineering6 (2005), 734–749.
[6]
Iván Cantador, Ignacio Fernández-Tobías, Shlomo Berkovsky, and Paolo Cremonesi. 2015. Cross-domain recommender systems. In Recommender systems handbook. Springer, 919–959.
[7]
Li Chen, Yonghua Yang, Ningxia Wang, Keping Yang, and Quan Yuan. 2019. How Serendipity Improves User Satisfaction with Recommendations? A Large-Scale User Evaluation. In The World Wide Web Conference. ACM, 240–250.
[8]
Laming Chen, Guoxin Zhang, and Eric Zhou. 2018. Fast greedy MAP inference for Determinantal Point Process to improve recommendation diversity. In Advances in Neural Information Processing Systems. 5622–5633.
[9]
Kyunghyun Cho, Bart Van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using RNN encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078(2014).
[10]
Ignacio Fernández-Tobías, Iván Cantador, Marius Kaminskas, and Francesco Ricci. 2012. Cross-domain recommender systems: A survey of the state of the art.
[11]
Mike Gartrell, Ulrich Paquet, and Noam Koenigstein. 2017. Low-rank factorization of determinantal point processes. In Thirty-First AAAI Conference on Artificial Intelligence.
[12]
Jonathan L Herlocker, Joseph A Konstan, Loren G Terveen, and John T Riedl. 2004. Evaluating collaborative filtering recommender systems. ACM Transactions on Information Systems (TOIS) 22, 1 (2004), 5–53.
[13]
Guangneng Hu, Yu Zhang, and Qiang Yang. 2018. CoNet: Collaborative Cross Networks for Cross-Domain Recommendation. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management.
[14]
Leo Iaquinta, Marco de Gemmis, Pasquale Lops, Giovanni Semeraro, and Piero Molino. 2010. Can a recommender system induce serendipitous encounters?In E-commerce. InTech.
[15]
Komal Kapoor, Vikas Kumar, Loren Terveen, Joseph A Konstan, and Paul Schrater. 2015. I like to explore sometimes: Adapting to dynamic user novelty preferences. In Proceedings of the 9th ACM Conference on Recommender Systems. ACM, 19–26.
[16]
Komal Kapoor, Karthik Subbian, Jaideep Srivastava, and Paul Schrater. 2015. Just in time recommendations: Modeling the dynamics of boredom in activity streams. In Proceedings of the Eighth ACM International Conference on Web Search and Data Mining. ACM, 233–242.
[17]
Pan Li, Maofei Que, Zhichao Jiang, Yao Hu, and Alexander Tuzhilin. 2020. PURS: Personalized Unexpected Recommender System for Improving User Satisfaction. In Fourteenth ACM Conference on Recommender Systems. 279–288.
[18]
Pan Li and Alexander Tuzhilin. 2019. Latent Modeling of Unexpectedness for Recommendations. (2019).
[19]
Pan Li and Alexander Tuzhilin. 2020. DDTCDR: Deep Dual Transfer Cross Domain Recommendation. In Proceedings of the 13th International Conference on Web Search and Data Mining. 331–339.
[20]
Jianxun Lian, Fuzheng Zhang, Xing Xie, and Guangzhong Sun. 2017. CCCFNet: a content-boosted collaborative filtering neural network for cross domain recommender systems. In Proceedings of the 26th international conference on World Wide Web companion. 817–818.
[21]
Qiuxia Lu, Tianqi Chen, Weinan Zhang, Diyi Yang, and Yong Yu. 2012. Serendipitous personalized ranking for top-n recommendation. In Web Intelligence and Intelligent Agent Technology (WI-IAT), 2012 IEEE/WIC/ACM International Conferences on, Vol. 1. IEEE, 258–265.
[22]
Tomoko Murakami, Koichiro Mori, and Ryohei Orihara. 2007. Metrics for evaluating the serendipity of recommendation lists. In Annual conference of the Japanese society for artificial intelligence. Springer, 40–46.
[23]
Tien T Nguyen, Pik-Mai Hui, F Maxwell Harper, Loren Terveen, and Joseph A Konstan. 2014. Exploring the filter bubble: the effect of using recommender systems on content diversity. In Proceedings of the 23rd international conference on World wide web. ACM, 677–686.
[24]
Sinno Jialin Pan and Qiang Yang. 2010. A survey on transfer learning. IEEE Transactions on knowledge and data engineering (2010).
[25]
Eli Pariser. 2011. The filter bubble: How the new personalized web is changing what we read and how we think. Penguin.
[26]
Andrew I Schein, Alexandrin Popescul, Lyle H Ungar, and David M Pennock. 2002. Methods and metrics for cold-start recommendations. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 253–260.
[27]
Peter Shaw, Jakob Uszkoreit, and Ashish Vaswani. 2018. Self-attention with relative position representations. arXiv preprint arXiv:1803.02155(2018).
[28]
Yuan Cao Zhang, Diarmuid Ó Séaghdha, Daniele Quercia, and Tamas Jambor. 2012. Auralist: introducing serendipity into music recommendation. In Proceedings of the fifth ACM international conference on Web search and data mining. ACM, 13–22.
[29]
Qianru Zheng, Chi-Kong Chan, and Horace HS Ip. 2015. An unexpectedness-augmented utility model for making serendipitous recommendation. In Industrial Conference on Data Mining. Springer, 216–230.
[30]
Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018. Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1059–1068.
[31]
Tao Zhou, Zoltán Kuscsik, Jian-Guo Liu, Matúš Medo, Joseph Rushton Wakeling, and Yi-Cheng Zhang. 2010. Solving the apparent diversity-accuracy dilemma of recommender systems. Proceedings of the National Academy of Sciences 107, 10(2010), 4511–4515.

Cited By

View all
  • (2024)Analyzing the Impact of Domain Similarity: A New Perspective in Cross-Domain Recommendation2024 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN60899.2024.10651297(1-8)Online publication date: 30-Jun-2024
  • (2023)How Well do Offline Metrics Predict Online Performance of Product Ranking Models?Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3591865(3415-3420)Online publication date: 19-Jul-2023
  • (2022)AMinerGNN: Heterogeneous Graph Neural Network for Paper Click-through Rate Prediction with Fusion QueryProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557544(4039-4043)Online publication date: 17-Oct-2022

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
RecSys '21: Proceedings of the 15th ACM Conference on Recommender Systems
September 2021
883 pages
ISBN:9781450384582
DOI:10.1145/3460231
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 September 2021

Check for updates

Author Tags

  1. Cross-Domain Recommendation
  2. Multi-Faceted User Preferences
  3. Reinforcement Learning
  4. Unexpected Recommendation

Qualifiers

  • Extended-abstract
  • Research
  • Refereed limited

Conference

RecSys '21: Fifteenth ACM Conference on Recommender Systems
September 27 - October 1, 2021
Amsterdam, Netherlands

Acceptance Rates

Overall Acceptance Rate 254 of 1,295 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)36
  • Downloads (Last 6 weeks)6
Reflects downloads up to 20 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Analyzing the Impact of Domain Similarity: A New Perspective in Cross-Domain Recommendation2024 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN60899.2024.10651297(1-8)Online publication date: 30-Jun-2024
  • (2023)How Well do Offline Metrics Predict Online Performance of Product Ranking Models?Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3591865(3415-3420)Online publication date: 19-Jul-2023
  • (2022)AMinerGNN: Heterogeneous Graph Neural Network for Paper Click-through Rate Prediction with Fusion QueryProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557544(4039-4043)Online publication date: 17-Oct-2022

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media