Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3292500.3330952acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Tensorized Determinantal Point Processes for Recommendation

Published: 25 July 2019 Publication History

Abstract

Interest in determinantal point processes (DPPs) is increasing in machine learning due to their ability to provide an elegant parametric model over combinatorial sets. In particular, the number of required parameters in a DPP grows only quadratically with the size of the ground set (e.g., item catalog), while the number of possible sets of items grows exponentially. Recent work has shown that DPPs can be effective models for product recommendation and basket completion tasks, since they are able to account for both the diversity and quality of items within a set. We present an enhanced DPP model that is specialized for the task of basket completion, the tensorized DPP. We leverage ideas from tensor factorization in order to customize the model for the next-item basket completion task, where the next item is captured in an extra dimension of the model. We evaluate our model on several real-world datasets, and find that the tensorized DPP provides significantly better predictive quality in several settings than a number of state-of-the art models.

References

[1]
Raja Hafiz Affandi, Emily B. Fox, Ryan P. Adams, and Benjamin Taskar. 2014. Learning the Parameters of Determinantal Point Process Kernels. In Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21--26 June 2014. 1224--1232. http://jmlr.org/proceedings/papers/v32/affandi14.html
[2]
Rakesh Agrawal, Tomasz Imieli'nski, and Arun Swami. 1993. Mining Association Rules Between Sets of Items in Large Databases. SIGMOD Rec., Vol. 22, 2 (June 1993), 207--216.
[3]
Tom Brijs, Gilbert Swinnen, Koen Vanhoof, and Geert Wets. 1999. Using Association Rules for Product Assortment Decisions: A Case Study. In Knowledge Discovery and Data Mining. 254--260.
[4]
Victor-Emmanuel Brunel. 2018. Learning Signed Determinantal Point Processes through the Principal Minor Assignment Problem. In Advances in Neural Information Processing Systems 31, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.). Curran Associates, Inc., 7376--7385. http://papers.nips.cc/paper/7966-learning-signed-determinantal-point-processes-through-the-principal-minor-assignment-problem.pdf
[5]
Daqing Chen, Sai Laing Sain, and Kun Guo. 2012. Data mining for the online retail industry: A case study of RFM model-based customer segmentation using data mining. Journal of Database Marketing & Customer Strategy Management, Vol. 19, 3 (01 Sep 2012), 197--208.
[6]
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 31, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.). Curran Associates, Inc., 5627--5638. http://papers.nips.cc/paper/7805-fast-greedy-map-inference-for-determinantal-point-process-to-improve-recommendation-diversity.pdf
[7]
Fabian Christoffel, Bibek Paudel, Chris Newell, and Abraham Bernstein. 2015. Blockbusters and Wallflowers: Accurate, Diverse, and Scalable Recommendations with Random Walks. In Proceedings of the 9th ACM Conference on Recommender Systems (RecSys '15). ACM, New York, NY, USA, 163--170.
[8]
F. Coenen. 2005. TLUCS KDD implementation of CBA (classification based on associations).
[9]
Mike Gartrell, Ulrich Paquet, and Noam Koenigstein. 2016. Bayesian Low-Rank Determinantal Point Processes. In Proceedings of the 10th ACM Conference on Recommender Systems, Boston, MA, USA, September 15--19, 2016. 349--356.
[10]
Mike Gartrell, Ulrich Paquet, and Noam Koenigstein. 2017. Low-Rank Factorization of Determinantal Point Processes. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4--9, 2017, San Francisco, California, USA. 1912--1918. http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14657
[11]
Jennifer Gillenwater, Alex Kulesza, and Ben Taskar. 2012. Discovering Diverse and Salient Threads in Document Collections. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL '12). Association for Computational Linguistics, Stroudsburg, PA, USA, 710--720. http://dl.acm.org/citation.cfm?id=2390948.2391026
[12]
Jennifer A Gillenwater, Alex Kulesza, Emily Fox, and Ben Taskar. 2014. Expectation-Maximization for Learning Determinantal Point Processes. In Advances in Neural Information Processing Systems 27, Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger (Eds.). Curran Associates, Inc., 3149--3157.
[13]
Jennifer A Gillenwater, Alex Kulesza, Sergei Vassilvitskii, and Zelda E. Mariet. 2018. Maximizing Induced Cardinality Under a Determinantal Point Process. In Advances in Neural Information Processing Systems 31, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.). Curran Associates, Inc., 6911--6920. http://papers.nips.cc/paper/7923-maximizing-induced-cardinality-under-a-determinantal-point-process.pdf
[14]
Prem Gopalan, Jake M. Hofman, and David M. Blei. 2013. Scalable Recommendation with Poisson Factorization., Vol. abs/1311.1704 (2013). arxiv: 1311.1704
[15]
Balá zs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk. 2015. Session-based Recommendations with Recurrent Neural Networks. CoRR, Vol. abs/1511.06939 (2015). arxiv: 1511.06939 http://arxiv.org/abs/1511.06939
[16]
Yifan Hu, Yehuda Koren, and Chris Volinsky. 2008. Collaborative Filtering for Implicit Feedback Datasets. In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (ICDM '08). IEEE Computer Society, Washington, DC, USA, 263--272.
[17]
Alex Kulesza and Ben Taskar. 2012. Determinantal Point Processes for Machine Learning .Now Publishers Inc., Hanover, MA, USA.
[18]
Jong-Seok Lee, Chi-Hyuck Jun, Jaewook Lee, and Sooyoung Kim. 2005. Classification-based Collaborative Filtering Using Market Basket Data. Expert Syst. Appl., Vol. 29, 3 (Oct. 2005), 700--704.
[19]
G. Linden, B. Smith, and J. York. 2003. Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Computing, Vol. 7, 1 (Jan 2003), 76--80.
[20]
Bing Liu, Wynne Hsu, and Yiming Ma. 1998. Integrating Classification and Association Rule Mining. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD'98). AAAI Press, 80--86. http://dl.acm.org/citation.cfm?id=3000292.3000305
[21]
Zelda Mariet and Suvrit Sra. 2015. Fixed-point algorithms for determinantal point processes. NIPS (2015). http://arxiv.org/abs/1508.00792
[22]
Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013. Distributed Representations of Words and Phrases and their Compositionality. In Advances in Neural Information Processing Systems 26, C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Q. Weinberger (Eds.). Curran Associates, Inc., 3111--3119. http://papers.nips.cc/paper/5021-distributed-representations-of-words-and-phrases-and-their-compositionality.pdf
[23]
Andreas Mild and Thomas Reutterer. 2003. An improved collaborative filtering approach for predicting cross-category purchases based on binary market basket data. Journal of Retailing and Consumer Services (2003).
[24]
Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel. 2011. A Three-Way Model for Collective Learning on Multi-Relational Data. In Proceedings of the 28th International Conference on Machine Learning (ICML-11) (ICML '11), Lise Getoor and Tobiasa Scheffer (Eds.). ACM, New York, NY, USA, 809--816.
[25]
Shameem A. Puthiya Parambath, Nicolas Usunier, and Yves Grandvalet. 2016. A Coverage-Based Approach to Recommendation Diversity On Similarity Graph. In Proceedings of the 10th ACM Conference on Recommender Systems (RecSys '16). ACM, New York, NY, USA, 15--22.
[26]
Steffen Rendle. 2010. Factorization Machines. In Proceedings of the 2010 IEEE International Conference on Data Mining (ICDM '10). IEEE Computer Society, Washington, DC, USA, 995--1000.
[27]
Songweiping. 2017. Github. https://github.com/Songweiping/GRU4Rec_TensorFlow .
[28]
Choon Hui Teo, Houssam Nassif, Daniel Hill, Sriram Srinivasan, Mitchell Goodman, Vijai Mohan, and S.V.N. Vishwanathan. 2016. Adaptive, Personalized Diversity for Visual Discovery. In Proceedings of the 10th ACM Conference on Recommender Systems (RecSys '16). ACM, New York, NY, USA, 35--38.
[29]
Saúl Vargas and Pablo Castells. 2014. Improving Sales Diversity by Recommending Users to Items. In Proceedings of the 8th ACM Conference on Recommender Systems (RecSys '14). ACM, New York, NY, USA, 145--152.
[30]
Anatoly M. Vershik and Yuri Yakubovichn. 2001. Asymptotic Combinatorics with Applications to Mathematical Physics .Springer-Verlag Berlin Heidelberg.
[31]
Romain Warlop. 2018. Github. https://github.com/RomainWarlop/logisticDPP .

Cited By

View all
  • (2024)Diversifying Sequential Recommendation with Retrospective and Prospective TransformersACM Transactions on Information Systems10.1145/365301642:5(1-37)Online publication date: 29-Apr-2024
  • (2024)Rethinking 'Complement' Recommendations at Scale with SIMDProceedings of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629526.3645041(25-36)Online publication date: 7-May-2024
  • (2024)Uncovering the Deep Filter Bubble: Narrow Exposure in Short-Video RecommendationProceedings of the ACM Web Conference 202410.1145/3589334.3648159(4727-4735)Online publication date: 13-May-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '19: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
July 2019
3305 pages
ISBN:9781450362016
DOI:10.1145/3292500
Permission to make digital or hard copies of all or part 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 components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. basket completion
  2. determinantal point process
  3. tensor

Qualifiers

  • Research-article

Conference

KDD '19
Sponsor:

Acceptance Rates

KDD '19 Paper Acceptance Rate 110 of 1,200 submissions, 9%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

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

Other Metrics

Citations

Cited By

View all
  • (2024)Diversifying Sequential Recommendation with Retrospective and Prospective TransformersACM Transactions on Information Systems10.1145/365301642:5(1-37)Online publication date: 29-Apr-2024
  • (2024)Rethinking 'Complement' Recommendations at Scale with SIMDProceedings of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629526.3645041(25-36)Online publication date: 7-May-2024
  • (2024)Uncovering the Deep Filter Bubble: Narrow Exposure in Short-Video RecommendationProceedings of the ACM Web Conference 202410.1145/3589334.3648159(4727-4735)Online publication date: 13-May-2024
  • (2024)PRDG: Personalized Recommendation with Diversity Based on Graph Neural Networks2024 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN60899.2024.10651479(1-8)Online publication date: 30-Jun-2024
  • (2024)Learning k-Determinantal Point Processes for Personalized Ranking2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00084(1036-1049)Online publication date: 13-May-2024
  • (2023)DTGCF: Diversified Tag-Aware Recommendation with Graph Collaborative FilteringApplied Sciences10.3390/app1305294513:5(2945)Online publication date: 24-Feb-2023
  • (2023)Curse of "Low" Dimensionality in Recommender SystemsProceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3539618.3591659(537-547)Online publication date: 19-Jul-2023
  • (2023)A Novel Parallel Algorithm for Sparse Tensor Matrix Chain Multiplication via TCU-AccelerationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.328852034:8(2419-2432)Online publication date: Aug-2023
  • (2023)AdapNet: Adaptability Decomposing Encoder–Decoder Network for Weakly Supervised Action Recognition and LocalizationIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2019.296281534:4(1852-1863)Online publication date: Apr-2023
  • (2023)CsdRec: Accuracy and Diversity-Awared Team Recommendation for Collaborative Software DevelopmentIEEE Access10.1109/ACCESS.2023.329216111(67613-67625)Online publication date: 2023
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media