{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:39:58Z","timestamp":1777696798853,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Intelligent Data Analysis: An International Journal"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p>Recommender systems that mine users\u2019 intentions to explore their potential interaction preferences have received increasing attention. However, the existing research on intent recommendation has some limitations. On one hand, the extant studies only consider users\u2019 historical interaction information and the sparse interactions cannot reflect users\u2019 potential interaction intention; on the other hand, they do not consider the changes in users\u2019 kinematic and static intentions over time and the importance of users\u2019 intention disentanglement representation, which makes it impossible for the general intention recommendation model to obtain a better representation of the intention. We propose a multitask recommendation model with dynamic and static intent integration and de-entanglement. The model mines users\u2019 dynamic and static intents and then combines them with regularization to model the independence of the intents, encouraging the differences between the intents. Meanwhile, to further alleviate the data sparsity problem, this study additionally constructs user\u2013user and item\u2013item graphs using four different similarity measures, such as cosine similarity and mutual information, applies graph convolutional networks to learn about the three graphs, and then captures the complementarity between different graphs using a graph-level cross-attention mechanism. Extensive comparative experiments and ablation studies on three public datasets demonstrate that DSI-ID consistently outperforms all baseline methods, achieving a 3.5%\u20137.4% improvement in recommendation performance over the best baseline.<\/jats:p>","DOI":"10.1177\/1088467x241301915","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T04:10:06Z","timestamp":1739419806000},"page":"1122-1141","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-task intent recommendation based on dynamic and static intent integration and disentanglement"],"prefix":"10.1177","volume":"29","author":[{"given":"Xiao","family":"Huang","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Statistics &amp; Actuarial Science, The University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Bigdata and Software Engineering, Chongqing University, Chognqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Statistics &amp; Actuarial Science, The University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6561-560X","authenticated-orcid":false,"given":"Junhao","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Bigdata and Software Engineering, Chongqing University, Chognqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158369"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"e_1_3_3_4_2","first-page":"1619","article-title":"A survey of recommender systems based on deep learning","volume":"41","author":"Liwei H","year":"2018","unstructured":"Liwei H, Bitao J, Shouye L, et al. A survey of recommender systems based on deep learning. Chin J Comput 2018; 41: 1619\u20131647.","journal-title":"Chin J Comput"},{"key":"e_1_3_3_5_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3402521","article-title":"A survey on heterogeneous one-class collaborative filtering","volume":"38","author":"Chen X","year":"2020","unstructured":"Chen X, Li L, Pan W, et al. A survey on heterogeneous one-class collaborative filtering. ACM Trans Inf Syst (TOIS) 2020; 38: 1\u201354.","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2688374"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_3_8_2","first-page":"3917","article-title":"Deep matrix factorization recommendation algorithm","volume":"32","author":"P. L TZ","year":"2021","unstructured":"P. L TZ, W. R YP. Deep matrix factorization recommendation algorithm. J Softw 2021; 32: 3917\u20133928.","journal-title":"J Softw"},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","unstructured":"Jin B Gao C He X et al. Multi-behavior recommendation with graph convolutional networks. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval 2020 pp.659\u2013668.","DOI":"10.1145\/3397271.3401072"},{"key":"e_1_3_3_10_2","doi-asserted-by":"crossref","unstructured":"Fan S Zhu J Han X et al. Metapath-guided heterogeneous graph neural network for intent recommendation. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining 2019 pp.2478\u20132486.","DOI":"10.1145\/3292500.3330673"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1177\/07356331231187285"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","unstructured":"Zhou K Ma Y Zhang J et al. S3-Rec: Self-supervised learning for sequential recommendation with mutual information maximization. In: Proceedings of the 29th ACM international conference on information & knowledge management 2020 pp.1893\u20131902.","DOI":"10.1145\/3340531.3411954"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Wu L Sun F Zhang WX et al. Dual graph attention networks for deep latent representation of multifaceted social effects in recommender systems. In: Proceedings of the 12th ACM international conference on web search and data mining 2019 pp.209\u2013217.","DOI":"10.1145\/3308558.3313442"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","unstructured":"Sun F Liu J Wu J et al. BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In: Proceedings of the 28th ACM international conference on information and knowledge management 2019 pp.1441\u20131450.","DOI":"10.1145\/3357384.3357895"},{"key":"e_1_3_3_15_2","first-page":"5711","article-title":"Learning disentangled representations for recommendation","author":"Ma J","year":"2019","unstructured":"Ma J, Zhou C, Cui P, et al. Learning disentangled representations for recommendation. In: Proceedings of the 33rd international conference on neural information processing systems. Curran Associates Inc., Red Hook, NY, USA, 2019, pp.5711\u20135722.","journal-title":"Proceedings of the 33rd international conference on neural information processing systems"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"Wang X He X Wang M et al. Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval 2019 pp.165\u2013174.","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","unstructured":"Li C Ma R Zhang H et al. Multi-interest network with dynamic routing for recommendation at Tmall. In: Proceedings of the 28th ACM international conference on information and knowledge management 2019 pp.2615\u20132623.","DOI":"10.1145\/3357384.3357814"},{"key":"e_1_3_3_18_2","unstructured":"Chung J Gulcehre C Cho K et al. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555 2014."},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","unstructured":"Li X Zhang M Wu S et al. Dynamic graph collaborative filtering. In: 2020 IEEE international conference on data mining (ICDM) 2020 pp.322\u2013331. IEEE.","DOI":"10.1109\/ICDM50108.2020.00041"},{"key":"e_1_3_3_20_2","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"Salakhutdinov R","unstructured":"Salakhutdinov R, Mnih A. Probabilistic matrix factorization. In: Proceedings of the 20th international conference on neural information processing systems (NIPS'07) Curran Associates Inc., Red Hook, NY, USA, pp.1257\u20131264.","journal-title":"Proceedings of the 20th international conference on neural information processing systems (NIPS'07)"},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"Sedhain S Menon AK Sanner S et al. Autorec: Autoencoders meet collaborative filtering. In: Proceedings of the 24th international conference on world wide web 2015 pp.111\u2013112.","DOI":"10.1145\/2740908.2742726"},{"key":"e_1_3_3_22_2","unstructured":"Berg Rv.d. Kipf TN Welling M. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 2017."},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"Ji S Feng Y Ji R et al. Dual channel hypergraph collaborative filtering. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining 2020 pp.2020\u20132029.","DOI":"10.1145\/3394486.3403253"},{"key":"e_1_3_3_24_2","doi-asserted-by":"crossref","unstructured":"Ying R He R Chen K et al. Graph convolutional neural networks for web-scale recommender systems. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining 2018 pp.974\u2013983.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","unstructured":"Sun J Zhang Y Ma C et al. Multi-graph convolution collaborative filtering. In: 2019 IEEE international conference on data mining (ICDM) 2019 pp.1306\u20131311. IEEE.","DOI":"10.1109\/ICDM.2019.00165"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","unstructured":"Wang Y Tang S Lei Y et al. Disenhan: Disentangled heterogeneous graph attention network for recommendation. In: Proceedings of the 29th ACM international conference on information & knowledge management 2020 pp.1605\u20131614.","DOI":"10.1145\/3340531.3411996"},{"key":"e_1_3_3_27_2","doi-asserted-by":"crossref","unstructured":"Zhu H Feng F He X et al. Bilinear graph neural network with neighbor interactions. arXiv preprint arXiv:2002.03575 2020.","DOI":"10.24963\/ijcai.2020\/202"},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","unstructured":"Sun J Zhang Y Guo W et al. Neighbor interaction aware graph convolution networks for recommendation. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval 2020 pp.1289\u20131298.","DOI":"10.1145\/3397271.3401123"},{"key":"e_1_3_3_29_2","first-page":"4954","article-title":"Knowledge enhanced graph neural networks for explainable recommendation","volume":"35","author":"Lyu Z","year":"2022","unstructured":"Lyu Z, Wu Y, Lai J, et al. Knowledge enhanced graph neural networks for explainable recommendation. IEEE Trans Knowl Data Eng 2022; 35: 4954\u20134968.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-022-01743-z"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","unstructured":"Jiang Y Yang Y Xia L et al. DiffKG: Knowledge graph diffusion model for recommendation. In: Proceedings of the 17th ACM international conference on web search and data mining 2024 pp.313\u2013321.","DOI":"10.1145\/3616855.3635850"},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"Zhang Q Xia L Cai X et al. Graph augmentation for recommendation. arXiv preprint arXiv:2403.16656 2024.","DOI":"10.1109\/ICDE60146.2024.00049"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","unstructured":"He X Deng K Wang X et al. Lightgcn: Simplifying and powering graph convolution network for recommendation. In: Proceedings of the 43rd International ACM SIGIR conference on research and development in information retrieval 2020 pp.639\u2013648.","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_3_34_2","unstructured":"Hidasi B Karatzoglou A Baltrunas L et al. Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939 2015."},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.102936"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","unstructured":"Chen Y Liu Z Li J et al. Intent contrastive learning for sequential recommendation. In: Proceedings of the ACM web conference 2022 2022 pp.2172\u20132182.","DOI":"10.1145\/3485447.3512090"},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","unstructured":"Wu H Zhang Y Ma C et al. Intent-aware multi-source contrastive alignment for tag-enhanced recommendation. In: 2023 IEEE 39th international conference on data engineering (ICDE) 2023 pp.1112\u20131125. IEEE.","DOI":"10.1109\/ICDE55515.2023.00090"},{"key":"e_1_3_3_38_2","doi-asserted-by":"crossref","unstructured":"Li J Sun P Wang Z et al. Intent-aware ranking ensemble for personalized recommendation. In: Proceedings of the 46th international ACM SIGIR conference on research and development in information retrieval 2023 pp.1004\u20131013.","DOI":"10.1145\/3539618.3591702"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3329175"},{"key":"e_1_3_3_40_2","doi-asserted-by":"crossref","unstructured":"Ren X Xia L Zhao J et al. Disentangled contrastive collaborative filtering. In: Proceedings of the 46th international ACM SIGIR conference on research and development in information retrieval 2023 pp.1137\u20131146.","DOI":"10.1145\/3539618.3591665"},{"key":"e_1_3_3_41_2","doi-asserted-by":"crossref","unstructured":"Wang Y Wang X Huang X et al. Intent-aware recommendation via disentangled graph contrastive learning. arXiv preprint arXiv:2403.03714 2024.","DOI":"10.24963\/ijcai.2023\/260"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","unstructured":"Qin X Yuan H Zhao P et al. Intent contrastive learning with cross subsequences for sequential recommendation. In: Proceedings of the 17th ACM international conference on web search and data mining 2024 pp.548\u2013556.","DOI":"10.1145\/3616855.3635773"},{"key":"e_1_3_3_43_2","unstructured":"Liu Y Zhu S Xia J et al. End-to-end learnable clustering for intent learning in recommendation. arXiv preprint arXiv:2401.05975 2024."},{"key":"e_1_3_3_44_2","doi-asserted-by":"crossref","unstructured":"Choi M Kim H-Y Cho H et al. Multi-intent-aware session-based recommendation. In: Proceedings of the 47th international ACM SIGIR conference on research and development in information retrieval 2024 pp.2532\u20132536.","DOI":"10.1145\/3626772.3657928"},{"key":"e_1_3_3_45_2","unstructured":"Veli\u010dkovi\u0107 P Cucurull G Casanova A et al. Graph attention networks. arXiv preprint arXiv:1710.10903 2018."},{"key":"e_1_3_3_46_2","first-page":"286","article-title":"Bi-graph mix-random walk based social recommendation model","volume":"51","author":"Cao Y","year":"2023","unstructured":"Cao Y, Gao M, Yu J-L, et al. Bi-graph mix-random walk based social recommendation model. Acta Electonica Sinica 2023; 51: 286.","journal-title":"Acta Electonica Sinica"},{"key":"e_1_3_3_47_2","unstructured":"Ma J Cui P Kuang K et al. Disentangled graph convolutional networks. In: International conference on machine learning 2019 pp.4212\u20134221. PMLR."},{"key":"e_1_3_3_48_2","first-page":"2773","article-title":"Personalized service recommendation method based on random walk and diversified graph ranking","volume":"46","author":"Fang C","year":"2018","unstructured":"Fang C, Zhang H-W, Wang N, et al. Personalized service recommendation method based on random walk and diversified graph ranking. Acta Electonica Sinica 2018; 46: 2773.","journal-title":"Acta Electonica Sinica"}],"container-title":["Intelligent Data Analysis: An International Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1088467X241301915","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1088467X241301915","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1088467X241301915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:00Z","timestamp":1777454460000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1088467X241301915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,13]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10.1177\/1088467X241301915"],"URL":"https:\/\/doi.org\/10.1177\/1088467x241301915","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,13]]}}}