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

skip to main content
research-article

Parallel Split-Join Networks for Shared Account Cross-Domain Sequential Recommendations

Published: 01 April 2023 Publication History

Abstract

Sequential recommendation is a task in which one models and uses sequential information about user behavior for recommendation purposes. We study sequential recommendation in a context in which multiple individual users share a single account (i.e., they have a shared account) and in which user behavior is available in multiple domains (i.e., recommendations are cross-domain). These two characteristics bring new challenges on top of those of the traditional sequential recommendation task. First, we need to identify the behavior associated with different users and different user roles under the same account in order to recommend the right item to the right user role at the right time. Second, we need to identify behavior in one domain that might be helpful to improve recommendations in other domains. We study <italic>shared account cross-domain sequential recommendation</italic> and propose a <bold>p</bold>arallel <bold>s</bold>plit-<bold>j</bold>oin <bold>Net</bold>work (Parallel Split-Join Network (PSJNet)), a parallel modeling network to address the two challenges above. We use &#x201C;split&#x201D; to address the challenge raised by shared accounts; PSJNet learns role-specific representations and uses a gating mechanism to filter out, from mixed user behavior, information of user roles that might be useful for another domain. In addition, &#x201C;join&#x201D; is used to address the challenge raised by the cross-domain setting; PSJNet learns cross-domain representations by combining the information from &#x201C;split&#x201D; and then transforms it to another domain. We present two variants of PSJNet: PSJNet-I and PSJNet-II. PSJNet-I is a &#x201C;split-by-join&#x201D; framework that splits the mixed representations to get role-specific representations and joins them to obtain cross-domain representations at each timestamp simultaneously. PSJNet-II is a &#x201C;split-and-join&#x201D; framework that first splits role-specific representations at each timestamp, and then the representations from all timestamps and all roles are joined to obtain cross-domain representations. We concatenate the in-domain and cross-domain representations to compute a recommendation score for each item. Both PSJNet-I and PSJNet-II can simultaneously generate recommendations for two domains where user behavior in two domains is synchronously shared at each timestamp. We use two datasets to assess the effectiveness of PSJNet. The first dataset is a simulated shared account cross-domain sequential recommendation dataset obtained by randomly merging the Amazon logs from different users in the movie and book domains. The second dataset is a real-world shared account cross-domain sequential recommendation dataset built from smart TV watching logs of a commercial organization. Our experimental results demonstrate that PSJNet outperforms state-of-the-art sequential recommendation baselines in terms of MRR and Recall.

References

[1]
M. Ma, P. Ren, Y. Lin, Z. Chen, J. Ma, and M. de Rijke, “π-Net: A parallel information-sharing network for cross-domain shared-account sequential recommendations,” in Proc. 42st Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2019, pp. 685–694.
[2]
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in Proc. 10th Int. Conf. World Wide Web, 2001, pp. 285–295.
[3]
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer, vol. 42, no. 8, pp. 30–37, 2009.
[4]
Y. Yan, M. Tan, I. W. Tsang, Y. Yang, Q. Shi, and C. Zhang, “Fast and low memory cost matrix factorization: Algorithm, analysis, and case study,” IEEE Trans. Knowl. Data Eng., vol. 32, no. 2, pp. 288–301, Feb. 2020.
[5]
B. Hidasi, A. Karatzoglou, L. Baltrunas, and D. Tikk, “Session-based recommendations with recurrent neural networks,” in Proc. Int. Conf. Learn. Representations, 2016.
[6]
R. He and J. McAuley, “Fusing similarity models with Markov chains for sparse sequential recommendation,” in Proc. IEEE 16th Int. Conf. Data Mining, 2016, pp. 191–200.
[7]
Z. Cheng, J. Shen, L. Zhu, M. S. Kankanhalli, and L. Nie, “Exploiting music play sequence for music recommendation,” in Proc. 26th Int. Joint Conf. Artif. Intell., 2017, pp. 3654–3660.
[8]
G. Shani, D. Heckerman, and R. I. Brafman, “An MDP-based recommender system,” J. Mach. Learn. Res., vol. 6, pp. 1265–1295, 2005.
[9]
M. Quadrana, A. Karatzoglou, B. Hidasi, and P. Cremonesi, “Personalizing session-based recommendations with hierarchical recurrent neural networks,” in Proc. 11th ACM Conf. Recommender Syst., 2017, pp. 130–137.
[10]
A. Zimdars, D. M. Chickering, and C. Meek, “Using temporal data for making recommendations,” in Proc. 17th Conf. Uncertainty Artif. Intell., 2001, pp. 580–588.
[11]
M. Quadrana, P. Cremonesi, and D. Jannach, “Sequence-aware recommender systems,” ACM Comput. Surv., vol. 51, no. 4, pp. 66:1–66:36, 2018.
[12]
M. Maet al., “Improving transformer-based sequential recommenders through preference editing,” 2021, arXiv:2106.12120.
[13]
W. Chen, P. Ren, F. Cai, F. Sun, and M. de Rijke, “Multi-interest diversification for end-to-end sequential recommendation,” ACM Trans. Inf. Syst., vol. 40, no. 1, Sep. 2021. [Online]. Available: https://doi.org/10.1145/3475768
[14]
Q. Liu, S. Wu, D. Wang, Z. Li, and L. Wang, “Context-aware sequential recommendation,” in Proc. IEEE 16th Int. Conf. Data Mining, 2016, pp. 1053–1058.
[15]
P. Ren, Z. Chen, J. Li, Z. Ren, J. Ma, and M. de Rijke, “RepeatNet: A repeat aware neural recommendation machine for session-based recommendation,” in Proc. 33rd AAAI Conf. Artif. Intell., 2019, pp. 4806–4813.
[16]
X. Wang, X. He, L. Nie, and T.-S. Chua, “Item silk road: Recommending items from information domains to social users,” in Proc. 40th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2017, pp. 185–194.
[17]
L. Hu, J. Cao, G. Xu, L. Cao, Z. Gu, and C. Zhu, “Personalized recommendation via cross-domain triadic factorization,” in Proc. 22nd Int. Conf. World Wide Web, 2013, pp. 595–606.
[18]
K. Verstrepen and B. Goethals, “Top-N recommendation for shared accounts,” in Proc. 9th ACM Conf. Recommender Syst., 2015, pp. 59–66.
[19]
Y. Zhao, J. Cao, and Y. Tan, “Passenger prediction in shared accounts for flight service recommendation,” in Proc. 10th Int. Conf. Asia-Pacific Serv. Comput., 2016, pp. 159–172.
[20]
X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua, “Neural collaborative filtering,” in Proc. 26th Int. Conf. World Wide Web, 2017, pp. 173–182.
[21]
G. Hu, Y. Zhang, and Q. Yang, “CoNet: Collaborative cross networks for cross-domain recommendation,” in Proc. 27th ACM Int. Conf. Inf. Knowl. Manage., 2018, pp. 667–676.
[22]
F. Zhuang, Y. Zhou, F. Zhang, X. Ao, X. Xie, and Q. He, “Sequential transfer learning: Cross-domain novelty seeking trait mining for recommendation,” in Proc. 26th Int. Conf. World Wide Web Companion, 2017, pp. 881–882.
[23]
P. Wang, J. Guo, Y. Lan, J. Xu, S. Wan, and X. Cheng, “Learning hierarchical representation model for next basket recommendation,” in Proc. 38th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2015, pp. 403–412.
[24]
S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme, “Factorizing personalized Markov chains for next-basket recommendation,” in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 811–820.
[25]
S. Chen, J. L. Moore, D. Turnbull, and T. Joachims, “Playlist prediction via metric embedding,” in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2012, pp. 714–722.
[26]
Z. Lu, E. Zhong, L. Zhao, E. W. Xiang, W. Pan, and Q. Yang, “Selective transfer learning for cross domain recommendation,” in Proc. SIAM Int. Conf. Data Mining, 2013, pp. 641–649.
[27]
F. Yu, Q. Liu, S. Wu, L. Wang, and T. Tan, “A dynamic recurrent model for next basket recommendation,” in Proc. 39th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2016, pp. 729–732.
[28]
H. Fang, D. Zhang, Y. Shu, and G. Guo, “Deep learning for sequential recommendation: Algorithms, influential factors, and evaluations,” ACM Trans. Inf. Syst., vol. 39, no. 1, Nov. 2020, Art. no.
[29]
M. Wang, W. Fu, X. He, S. Hao, and X. Wu, “A survey on large-scale machine learning,” IEEE Trans. Knowl. Data Eng., 2020.
[30]
P. Sun, L. Wu, and M. Wang, Attentive Recurrent Social Recommendation. New York, NY, USA: Association for Computing Machinery, 2018, pp. 185–194. [Online]. Available: https://doi.org/10.1145/3209978.3210023
[31]
C. Chen, D. Li, J. Yan, and X. Yang, “Modeling dynamic user preference via dictionary learning for sequential recommendation,” IEEE Trans. Knowl. Data Eng., 2021.
[32]
J. Wu, R. Cai, and H. Wang, “Déjà vu: A contextualized temporal attention mechanism for sequential recommendation,” in Proc. Web Conf., 2020, pp. 2199–2209.
[33]
Z. Wanget al., “Counterfactual data-augmented sequential recommendation,” in Proc. 44th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2021, pp. 347–356.
[34]
Y. K. Tan, X. Xu, and Y. Liu, “Improved recurrent neural networks for session-based recommendations,” in Proc. 1st Workshop Deep Learn. Recommender Syst., 2016, pp. 17–22.
[35]
Q. Cui, S. Wu, Q. Liu, W. Zhong, and L. Wang, “MV-RNN: A multi-view recurrent neural network for sequential recommendation,” IEEE Trans. Knowl. Data Eng., vol. 32, no. 2, pp. 317–331, Feb. 2020.
[36]
J. Tang and K. Wang, “Personalized top-N sequential recommendation via convolutional sequence embedding,” in Proc. 11th ACM Int. Conf. Web Search Data Mining, 2018, pp. 565–573.
[37]
W.-C. Kang and J. Mcauley, “Self-attentive sequential recommendation,” in Proc. IEEE Int. Conf. Data Mining, 2018, pp. 197–206.
[38]
J. Li, Y. Wang, and J. McAuley, “Time interval aware self-attention for sequential recommendation,” in Proc. 13th Int. Conf. Web Search Data Mining, 2020, pp. 322–330.
[39]
A. Luoet al., “Collaborative self-attention network for session-based recommendation,” in Proc. 29th Int. Joint Conf. Artif. Intell., 2020, pp. 2591–2597.
[40]
J. Wang, K. Ding, L. Hong, H. Liu, and J. Caverlee, Next-Item Recommendation with Sequential Hypergraphs. New York, NY, USA: Assoc. Comput. Machinery, 2020, pp. 1101–1110.
[41]
H. Li, X. Wang, Z. Zhang, J. Ma, P. Cui, and W. Zhu, “Intention-aware sequential recommendation with structured intent transition,” IEEE Trans. Know. Data Eng., 2021.
[42]
X. Wang, H. Jin, A. Zhang, X. He, T. Xu, and T.-S. Chua, “Disentangled graph collaborative filtering,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2020. [Online]. Available: https://doi.org/10.1145/3397271.3401137
[43]
Y. Zhanget al., “How to retrain recommender system?,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2020. [Online]. Available: https://doi.org/10.1145/3397271.3401167
[44]
J. Wuet al., “Self-supervised graph learning for recommendation,” in Proc. 44th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2021. [Online]. Available: https://doi.org/10.1145/3404835.3462862
[45]
X. Wanget al., Learning Intents behind Interactions With Knowledge Graph for Recommendation. New York, NY, USA: Association for Computing Machinery, 2021, pp. 878–887.
[46]
X. Chenet al., “Sequential recommendation with user memory networks,” in Proc. 11th ACM Int. Conf. Web Search Data Mining, 2018, pp. 108–116.
[47]
M. Wang, P. Ren, L. Mei, Z. Chen, M. Jun, and M. de Rijke, “A collaborative session-based recommendation approach with parallel memory modules,” in Proc. 42st Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2019, pp. 345–354.
[48]
D. Jannach and M. Ludewig, “When recurrent neural networks meet the neighborhood for session-based recommendation,” in Proc. 11th ACM Conf. Recommender Syst., 2017, pp. 306–310.
[49]
A. Zhang, N. Fawaz, S. Ioannidis, and A. Montanari, “Guess who rated this movie: Identifying users through subspace clustering,” in Proc. 28th Conf. Uncertainty Artif. Intell., 2012, pp. 944–953.
[50]
P. Bajaj and S. Shekhar, “Experience individualization on online tv platforms through persona-based account decomposition,” in Proc. 24th ACM Int. Conf. Multimedia, 2016, pp. 252–256.
[51]
Z. Wang, Y. Yang, L. He, and J. Gu, “User identification within a shared account: Improving IP-TV recommender performance,” in Proc. 18th East Eur. Conf. Advances Databases Inf. Syst., 2014, pp. 219–233.
[52]
J.-Y. Jiang, C.-T. Li, Y. Chen, and W. Wang, “Identifying users behind shared accounts in online streaming services,” in Proc. 41st Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2018, pp. 65–74.
[53]
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “BPR: Bayesian personalized ranking from implicit feedback,” in Proc. 25th Conf. Uncertainty Artif. Intell., 2009, pp. 452–461.
[54]
F. Abel, E. Herder, G.-J. Houben, N. Henze, and D. Krause, “Cross-system user modeling and personalization on the social web,” User Model. User-Adapted Interact., vol. 23, no. 2, pp. 169–209, 2013.
[55]
S. Berkovsky, T. Kuflik, and F. Ricci, “Mediation of user models for enhanced personalization in recommender systems,” User Model. User-Adapted Interact., vol. 18, no. 3, pp. 245–286, 2008.
[56]
B. Li, Q. Yang, and X. Xue, “Can movies and books collaborate? Cross-domain collaborative filtering for sparsity reduction,” in Proc. 17th Int. Joint Conf. Artif. Intell., 2009, pp. 2052–2057.
[57]
W. Pan, E. W. Xiang, N. N. Liu, and Q. Yang, “Transfer learning in collaborative filtering for sparsity reduction,” in Proc. 24th AAAI Conf. Artif. Intell., 2010, pp. 230–235.
[58]
A. Farseev, I. Samborskii, A. Filchenkov, and T.-S. Chua, “Cross-domain recommendation via clustering on multi-layer graphs,” in Proc. 40th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2017, pp. 195–204.
[59]
I. Fern ández-Tobías, I. Cantador, M. Kaminskas, and F. Ricci, “Cross-domain recommender systems: A survey of the state of the art,” in Proc. Spanish Conf. Inf. Retrieval, 2012, pp. 1–12.
[60]
J. Tang, S. Wu, J. Sun, and H. Su, “Cross-domain collaboration recommendation,” in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2012, pp. 1285–1293.
[61]
Q. Do, W. Liu, J. Fan, and D. Tao, “Unveiling hidden implicit similarities for cross-domain recommendation,” IEEE Trans. Knowl. Data Eng., vol. 33, no. 1, pp. 302–315, Jan. 2021.
[62]
L. Chen, J. Zheng, M. Gao, A. Zhou, W. Zeng, and H. Chen, “TLRec: Transfer learning for cross-domain recommendation,” in Proc. IEEE Int. Conf. Big Knowl., 2017, pp. 167–172.
[63]
Z. Liu, J. Tian, L. Zhao, and Y. Zhang, “Attentive-feature transfer based on mapping for cross-domain recommendation,” in Proc. Int. Conf. Data Mining Workshops, 2020, pp. 151–158.
[64]
T.-N. Doan and S. Sahebi, “TransCrossCF: Transition-based cross-domain collaborative filtering,” in Proc. 19th IEEE Int. Conf. Mach. Learn. Appl., 2020, pp. 320–327.
[65]
H. Zhang, X. Kong, and Y. Zhang, “Selective knowledge transfer for cross-domain collaborative recommendation,” IEEE Access, vol. 9, pp. 48039–48051, 2021.
[66]
K. D. Onalet al., “Neural information retrieval: At the end of the early years,” Inf. Retrieval J., vol. 21, no. 2/3, pp. 111–182, Jun. 2018.
[67]
C. Gaoet al., “Cross-domain recommendation without sharing user-relevant data,” in Proc. World Wide Web Conf., 2019, pp. 491–502.
[68]
M. Maet al., “Mixed information flow for cross-domain sequential recommendations,” 2020, arXiv:2012.00485.
[69]
I. Misra, A. Shrivastava, A. Gupta, and M. Hebert, “Cross-stitch networks for multi-task learning,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2016, pp. 3994–4003.
[70]
H. Chen, H. Yin, X. Sun, T. Chen, B. Gabrys, and K. Musial, Multi-Level Graph Convolutional Networks for Cross-Platform Anchor Link Prediction. New York, NY, USA: Association for Computing Machinery, 2020, pp. 1503–1511.
[71]
X. Xia, H. Yin, J. Yu, Q. Wang, L. Cui, and X. Zhang, “Self-supervised hypergraph convolutional networks for session-based recommendation,” 2020, arXiv:2012.06852.
[72]
L. Guo, L. Tang, T. Chen, L. Zhu, Q. V. H. Nguyen, and H. Yin, “DA-GCN: A domain-aware attentive graph convolution network for shared-account cross-domain sequential recommendation,” 2021, arXiv:2105.03300.
[73]
R. He and J. McAuley, “Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering,” in Proc. 25th Int. Conf. World Wide Web, 2016, pp. 507–517.
[74]
W. Wanget al., “Group-aware long- and short-term graph representation learning for sequential group recommendation,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Devel. Inform. Retrieval, 2020, pp. 1449–1458.
[75]
Z. Shuai, T. Yi, L. Yao, and A. Sun, “Next item recommendation with self-attention,” 2018, arXiv:1808.06414.
[76]
G. Linden, B. Smith, and J. York, “Amazon.com recommendations: Item-to-item collaborative filtering,” IEEE Internet Comput., vol. 7, no. 1, pp. 76–80, Jan./Feb. 2003.
[77]
Z. Cheng, Y. Ding, L. Zhu, and M. Kankanhalli, “Aspect-aware latent factor model: Rating prediction with ratings and reviews,” in Proc. World Wide Web Conf., 2018, pp. 639–648.
[78]
X. He, Z. He, X. Du, and T.-S. Chua, “Adversarial personalized ranking for recommendation,” in Proc. 41st Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2018, pp. 355–364.
[79]
L. Mei, P. Ren, Z. Chen, L. Nie, J. Ma, and J.-Y. Nie, “An attentive interaction network for context-aware recommendations,” in Proc. 27th ACM Int. Conf. Inf. Knowl. Manage., 2018, pp. 157–166.
[80]
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: A simple way to prevent neural networks from overfitting,” J. Mach. Learn. Res., vol. 15, no. 1, pp. 1929–1958, 2014.
[81]
X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” in Proc. Int. Conf. Artif. Intell. Statist. Soc. Artif. Intell. Statist., 2010, pp. 249–256.
[82]
R. Pascanu, T. Mikolov, and Y. Bengio, “On the difficulty of training recurrent neural networks,” in Proc. 30th Int. Conf. Int. Conf. Mach. Learn., 2013, pp. III-1310–III-1318.
[83]
J. Tan, S. Xu, Y. Ge, Y. Li, X. Chen, and Y. Zhang, “Counterfactual explainable recommendation,” in Proc. 30th ACM Int. Conf. Inf. Knowl. Manage., 2021, pp. 1784–1793.
[84]
P. Sun, L. Wu, K. Zhang, Y. Fu, R. Hong, and M. Wang, “Dual learning for explainable recommendation: Towards unifying user preference prediction and review generation,” in Proc. Web Conf., 2020, pp. 837–847.
[85]
A. Lucicet al., “A multistakeholder approach towards evaluating AI transparency mechanisms,” in Proc. ACM CHI Workshop Operationalizing Hum.-Centered Perspectives Explainable AI, 2021.

Cited By

View all
  • (2024)City Matters! A Dual-Target Cross-City Sequential POI Recommendation ModelACM Transactions on Information Systems10.1145/366428442:6(1-27)Online publication date: 19-Aug-2024
  • (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)ECRT: Flexible Sequence Enhancement Framework for Cross-Domain Information Reuse in RecommendationProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3680038(5094-5101)Online publication date: 21-Oct-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering  Volume 35, Issue 4
April 2023
1091 pages

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 April 2023

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 27 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)City Matters! A Dual-Target Cross-City Sequential POI Recommendation ModelACM Transactions on Information Systems10.1145/366428442:6(1-27)Online publication date: 19-Aug-2024
  • (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)ECRT: Flexible Sequence Enhancement Framework for Cross-Domain Information Reuse in RecommendationProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3680038(5094-5101)Online publication date: 21-Oct-2024
  • (2023)Reinforcement Learning-Enhanced Shared-Account Cross-Domain Sequential RecommendationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.318510135:7(7397-7411)Online publication date: 1-Jul-2023
  • (2022)Contrastive Cross-Domain Sequential RecommendationProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557262(138-147)Online publication date: 17-Oct-2022

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media