{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:48:13Z","timestamp":1742932093985,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306716"},{"type":"electronic","value":"9783031306723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30672-3_3","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:10:49Z","timestamp":1681384249000},"page":"38-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Disentangling User Intention for\u00a0Sequential Recommendation with\u00a0Dual Intention Decoupling Network"],"prefix":"10.1007","author":[{"given":"Liangliang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Guang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"3_CR1","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008 (2017)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Rendle, S., Freudenthaler, C., Schmidt-Thieme, L.: Factorizing personalized markov chains for next-basket recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 811\u2013820 (2010)","DOI":"10.1145\/1772690.1772773"},{"key":"3_CR3","unstructured":"Gidaris, S., Singh, P., Komodakis, N.: Unsupervised representation learning by predicting image rotations. arXiv preprint arXiv:1803.07728 (2018)"},{"key":"3_CR4","unstructured":"Higgins, I., et al.: beta-VAE: learning basic visual concepts with a constrained variational framework (2016)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ye, W., Wang, S., Chen, X., Wang, X., Qin, Z., Yin, D.: Time matters: sequential recommendation with complex temporal information. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1459\u20131468 (2020)","DOI":"10.1145\/3397271.3401154"},{"issue":"04","key":"3_CR6","first-page":"5045","volume":"34","author":"C Ma","year":"2020","unstructured":"Ma, C., Ma, L., Zhang, Y., Sun, J., Liu, X., Coates, M.: Memory augmented graph neural networks for sequential recommendation. Proc. AAAI Conf. Artif. Intell. 34(04), 5045\u20135052 (2020)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"3_CR7","unstructured":"Ma, J., Zhou, C., Cui, P., Yang, H., Zhu, W.: Learning disentangled representations for recommendation. arXiv preprint arXiv:1910.14238 (2019)"},{"key":"3_CR8","unstructured":"Ma, J., Cui, P., Kuang, K., Wang, X., Zhu, W.: Disentangled graph convolutional networks. In: International Conference on Machine Learning (PMLR), pp. 4212\u20134221 (2019)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Wang, X., Jin, H., Zhang, A., He, X., Xu, T., Chua, T.-S.: Disentangled graph collaborative filtering. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1001\u20131010 (2020)","DOI":"10.1145\/3397271.3401137"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Gao, C., Li, X., He, X., Jin, D., Li, Y.: Disentangling user interest and conformity for recommendation with causal embedding. arXiv preprint arXiv:2006.11011 (2020)","DOI":"10.1145\/3442381.3449788"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Hidasi, B., Karatzoglou, A.: Recurrent neural networks with top-k gains for session-based recommendations. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 843\u2013852 (2018)","DOI":"10.1145\/3269206.3271761"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Wang, S., Hu, L., Wang, Y., Sheng, Q.Z., Orgun, M., Cao, L.: Modeling multi-purpose sessions for next-item recommendations via mixture-channel purpose routing networks. In: International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence (2019)","DOI":"10.24963\/ijcai.2019\/523"},{"key":"3_CR13","unstructured":"Hidasi, B., Karatzoglou, A., Baltrunas, L., Tikk, D.: Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939 (2015)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Pi, Q., Bian, W., Zhou, G., Zhu, X., Gai, K.: Practice on long sequential user behavior modeling for click-through rate prediction. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2671\u20132679 (2019)","DOI":"10.1145\/3292500.3330666"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Y., McAuley, J.: Time interval aware self-attention for sequential recommendation. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 322\u2013330 (2020)","DOI":"10.1145\/3336191.3371786"},{"issue":"01","key":"3_CR16","first-page":"5941","volume":"33","author":"G Zhou","year":"2019","unstructured":"Zhou, G., et al.: Deep interest evolution network for click-through rate prediction. Proc. AAAI Conf. Artif. Intell. 33(01), 5941\u20135948 (2019)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Chen, S., Moore, J.L., Turnbull, D., Joachims, T.: Playlist prediction via metric embedding. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 714\u2013722 (2012)","DOI":"10.1145\/2339530.2339643"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"McAuley, J., Targett, C., Shi, Q., Van Den Hengel, A.: Image-based recommendations on styles and substitutes. In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 43\u201352 (2015)","DOI":"10.1145\/2766462.2767755"},{"key":"3_CR19","unstructured":"Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618 (2012)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Cen, Y., Zhang, J., Zou, X., Zhou, C., Yang, H., Tang, J.: Controllable multi-interest framework for recommendation. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2942\u20132951 (2020)","DOI":"10.1145\/3394486.3403344"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Tan, Q., et al.: Sparse-interest network for sequential recommendation. In: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pp. 598\u2013606 (2021)","DOI":"10.1145\/3437963.3441811"},{"issue":"1","key":"3_CR22","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929\u20131958 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"3_CR24","unstructured":"Ba, J.L., Kiros, J.R., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"He, R., Kang, W.-C., McAuley, J.: Translation-based recommendation. In: Proceedings of the Eleventh ACM Conference on Recommender Systems, pp. 161\u2013169 (2017)","DOI":"10.1145\/3109859.3109882"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, W., Chen, T., Wang, J., Yu, Y.: Optimizing top-n collaborative filtering via dynamic negative item sampling. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 785\u2013788 (2013)","DOI":"10.1145\/2484028.2484126"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Kang, W.-C., McAuley, J.: Self-attentive sequential recommendation. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 197\u2013206. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00035"},{"issue":"8","key":"3_CR28","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1109\/TPAMI.2013.50","volume":"35","author":"Y Bengio","year":"2013","unstructured":"Bengio, Y., Courville, A., Vincent, P.: Representation learning: a review and new perspectives. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1798\u20131828 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5(4), 1\u201319 (2015)","DOI":"10.1145\/2827872"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Yang, M., Liu, F., Chen, Z., Shen, X., Hao, J., Wang, J.: CausalVAE: disentangled representation learning via neural structural causal models. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 9593\u20139602 (2021)","DOI":"10.1109\/CVPR46437.2021.00947"},{"key":"3_CR31","unstructured":"Lian, J., et al.: Multi-interest-aware user modeling for large-scale sequential recommendations. arXiv preprint arXiv:2102.09211 (2021)"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1007\/978-3-030-75765-6_58","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Liu","year":"2021","unstructured":"Liu, H., Lin, H., Chen, G.: TANTP: conversational emotion recognition using tree-based attention networks with transformer pre-training. In: Karlapalem, K. (ed.) PAKDD 2021. LNCS (LNAI), vol. 12713, pp. 730\u2013742. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75765-6_58"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Shi, S., Ma, W., Zhang, M., Zhang, Y., Ma, S.: Beyond user embedding matrix: learning to hash for modeling large-scale users in recommendation. In: SIGIR 2020: The 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval (2020)","DOI":"10.1145\/3397271.3401119"},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-018-9654-y","volume":"52","author":"Z Batmaz","year":"2019","unstructured":"Batmaz, Z., Yurekli, A., Bilge, A., Kaleli, C.: A review on deep learning for recommender systems: challenges and remedies. Artif. Intell. Rev. 52(1), 1\u201337 (2019)","journal-title":"Artif. Intell. Rev."},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"He, R., McAuley, J.: Fusing similarity models with markov chains for sparse sequential recommendation. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 191\u2013200. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0030"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Cho, K., van Merri\u00ebnboer, B., Bahdanau, D., Bengio, Y.: On the properties of neural machine translation: Encoder-decoder approaches. In: Proceedings of SSST-8, Eighth Workshop on Syntax, Semantics and Structure in Statistical Translation, pp. 103\u2013111 (2014)","DOI":"10.3115\/v1\/W14-4012"},{"key":"3_CR37","unstructured":"Pascanu, R., Mikolov, T., Bengio, Y.: On the difficulty of training recurrent neural networks. In: International conference on machine learning (PMLR), pp. 1310\u20131318 (2013)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30672-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:19:58Z","timestamp":1710263998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30672-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306716","9783031306723"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30672-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}