JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2026, Vol. 61 ›› Issue (3): 54-65.doi: 10.6040/j.issn.1671-9352.1.2024.040

Previous Articles    

Attribute enhanced temporary group recommendation algorithm fusing long-and short-term interests

WANG Zhixuan1, PANG Jifang1,2*, WANG Zhiqiang1,2, SONG Peng3, LI Ru1,2   

  1. 1. School of Computer and Information Technology, Shanxi University, Taiyuan 030006, Shanxi, China;
    2. Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, Shanxi University, Taiyuan 030006, Shanxi, China;
    3. School of Economics and Management, Shanxi University, Taiyuan 030006, Shanxi, China
  • Published:2026-03-18

Abstract: Group recommendation aims to provide recommendation services for group users, with the ultimate goal of meeting the different preference needs of group members. Most existing group recommendation algorithms are designed for fixed groups, ignoring a large number of temporary groups with randomness and specificity. In order to further expand the application scenarios of group recommendation algorithms and effectively address the shortage of historical interaction information in temporary groups, attribute enhanced temporary group recommendation algorithm fusing long-and short-term interests(ALSTG)is proposed. Firstly, item attributes information are injected into the overall historical interactions between users and items and the users short-term interaction sequences, respectively. Then, users long-and short-term interests are learned by comprehensively using hypergraph networks, graph neural networks, and gated recurrent units. Furthermore, the long-term interests of members are aggregated into the long-term interests of group through attention mechanism. At the same time, a similarity measurement strategy between the short-term interests of members and the long-term interests of the group is designed to calculate the weights of members, and the short-term interests of the group are obtained through weighted fusion. On this basis, a long-and short-term interest contrastive learning approach is adopted to maximize the consistency between the two types of group interests. The model is jointly optimized through comparative loss and recommendation loss to obtain high-quality group comprehensive representation, thereby achieving accurate recommendation for temporary groups. Finally, the feasibility and effectiveness of the proposed model were verified through comparative analysis and ablation experiments on two real datasets. The experimental results show that item attribute information and user short-term interests can effectively enhance the quality of temporary group representation and significantly improve the recommendation performance of the model.

Key words: item attribute information, long-and short-term interests, hypergraph networks, contrastive learning, group recommendation

CLC Number: 

  • TP391
[1] SHYAM A, KUMAR V, KAGITA V R, et al. UniRecSys: a unified framework for personalized, group, package, and package-to-group recommendations[J]. Knowledge-Based Systems, 2024, 289:111552.
[2] FU Shengxi, REN Qianqian, LYU Xingfeng, et al. Multi-behavior recommendation with SVD graph neural networks[J]. Expert Systems with Applications, 2024, 249:123575.
[3] HU Zheng, CAI Shi-Min, WANG Jun, et al. Collaborative recommendation model based on multi-modal multi-view attention network: movie and literature cases[J]. Applied Soft Computing, 2023, 144:110518.
[4] MENG Lingqiang, LIU Zhizhong, CHU Dianhui, et al. POI recommendation for occasional groups based on hybrid graph neural networks[J]. Expert Systems with Applications, 2024, 237:121583.
[5] GUO Lei, YIN Hongzhi, CHEN Tong, et al. Hierarchical hyperedge embedding-based representation learning for group recommendation[J]. ACM Transactions on Information Systems, 2021, 40(1):1-27.
[6] YANG Mingdai, LIU Zhiwei, YANG Liangwei, et al. Ranking-based group identification via factorized attention on social tripartite graph[C] //Proceedings of the 16th ACM International Conference on Web Search and Data Mining. Singapore: ACM, 2023:769-777.
[7] WU Xixi, XIONG Yun, ZHANG Yao, et al. Consrec: learning consensus behind interactions for group recommendation[C] //Proceedings of the ACM Web Conference 2023. Texas: ACM, 2023:240-250.
[8] SANKAR A, WU Y H, WU Y H, et al. Groupim: a mutualinformation maximization framework for neural group recommendation[C] //Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval. Xian: ACM, 2020:1279-1288.
[9] GUO Lei, YIN Hongzhi, WANG Qinyong, et al. Group recommendation with latent voting mechanism[C] //Proceedings of the 36th International Conference on Data Engineerin. Dallas: IEEE, 2020:121-132.
[10] HE Z X, CHOW C Y, ZHANG J D. GAME: learning graphical and attentive multi-view embeddings for occasional group recommendation[C] //Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. Xian: ACM, 2020:649-658.
[11] ZHENG Xiaolin, TAN Yanchao, WANG Yan, et al. Finding high-quality item attributes for recommendation[J]. IEEE Transactions on Knowledge and Data Engineering, 2022, 35(8):7980-7993.
[12] HUANG Ling, CHEN Biyi, YE Haiyi, et al. DIAG: a deep interaction-attribute-generation model for user-generated item recommendation[J]. Knowledge-Based Systems, 2022, 243:108463.
[13] XU Li, ZENG Jun, PENG Weile, et al. Modeling and predicting user preferences with multiple item attributes for sequential recommendations[J]. Knowledge-Based Systems, 2023, 260:110174.
[14] SANJAY K, PERVIN N. Integration of short and long-term interests: a preference aware session-based recommender[J]. Neurocomputing, 2024, 583:127558.
[15] FU Jiarun, GAO Rong, YU Yonghong, et al. Contrastive graph learning long and short-term interests for POI recommendation[J]. Expert Systems with Applications, 2024, 238:121931.
[16] SONG Jing, SHEN Hong, OU Zijing, et al. ISLF: interest shift and latent factors combination model for session-based recommendation[C] //Proceedings of the 28th International Joint Conference on Artificial Intelligence. Macao: AAAI, 2019:5765-5771.
[17] ZHAO Na, LONG Zhen, WANG Jian, et al. AGRE: a knowledge graph recommendation algorithm based on multiple paths embeddings RNN encoder[J]. Knowledge-Based Systems, 2023, 259:110078.
[18] YU Dongjin, YU Ting, WANG Dongjing, et al. Long tail service recommendation based on cross-view and contrastive learning[J]. Expert Systems with Applications, 2024, 238:121957.
[19] WANG Yu, ZHAO Yuying, ZHANG Yi, et al. Collaboration-aware graph convolutional network for recommender systems[C] //Proceedings of the ACM Web Conference 2023. Texas: ACM, 2023:91-101.
[20] ZENG Biqing, CHI Junlong, HONG Peilin, et al. Context-aware graph embedding with gate and attention for session-based recommendation[J]. Neurocomputing, 2024, 574:127221.
[21] XIA Lianghao, HUANG Chao, XU Yong, et al. Hypergraph contrastive collaborative filtering[C] //Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. Madrid: ACM, 2022:70-79.
[22] WU Xixi, XIONG Yun, ZHANG Yao, et al. Dual intents graph modeling for user-centric group discovery[C] //Proceedings of the 32nd ACM International Conference on Information and Knowledge Management. Birmingham: ACM, 2023:2716-2725.
[23] GU Shuyun, WANG Xiao, SHI Chuan, et al. Self-supervised graph neural networks for multi-behavior recommendation[C] //Proceedings of the 30th International Joint Conference on Artificial Intelligence. Montreal: Morgan Kaufmann, 2022:2052-2058.
[24] YANG Yuhao, HUANG Chao, XIA Lianghao, et al. Knowledge graph contrastive learning for recommendation[C] //Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. Madrid: ACM, 2022:1434-1443.
[25] ZHAO Pengpeng, LUO Anjing, LIU Yanchi, et al. Where to go next: a spatio-temporal gated network for next POI recommendation[J]. IEEE Transactions on Knowledge and Data Engineering, 2020, 34(5):2512-2524.
[26] YAN Cairong, WANG Yiwei, ZHANG Yanting, et al. Modeling long and short-term user behaviors for sequential recommendation with deep neural networks[C] //2021 International Joint Conference on Neural Networks. Rome: IEEE, 2021:1-8.
[27] WU Shu, TANG Yuyuan, ZHU Yanqiao, et al. Session-based recommendation with graph neural networks[C] //Proceedings of the AAAI Conference on Artificial Intelligence. Vancouver: AAAI, 2019, 33(1):346-353.
[28] JIA Renqi, ZHOU Xiaofei, DONG Linhua, et al. Hypergraph convolutional network for group recommendation[C] //2021 IEEE International Conference on Data Mining. Auckland: IEEE, 2021:260-269.
[29] FENG Yifan, YOU Haoxuan, ZHANG Zizhao, et al. Hypergraph neural networks[C] //Proceedings of the AAAI Conference on Artificial Intelligence. Vancouver: AAAI, 2019:3558-3565.
[30] WU F, SOUZA A H, ZHANG T Y, et al. Simplifying graph convolutional networks[C] //International Conference on Machine Learning. California: ACM, 2019:6861-6871.
[31] HE Xiangnan, DENG Kuan, WANG Xiang, et al. Lightgcn: simplifying and powering graph convolution network for recommendation[C] //Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. Xian: ACM, 2020:639-648.
[32] GUTMANN M, HYVARINEN A. Noise-contrastive estimation: a new estimation principle for unnormalized statistical models[C] //Proceedings of the 13th International Conference on Artificial Intelligence and Statistics. Sardinia: JMLR, 2010:297-304.
[33] HE Wei, SUN Guohao, LU Jinhu, et al. Candidate-aware graph contrastive learning for recommendation[C] //Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. Taipei: ACM, 2023:1670-1679.
[34] YU Junliang, YIN Hongzhi, XIA Xin, et al. Are graph augmentations necessary? Simple graph contrastive learning for recommendation[C] //Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. Madrid: ACM, 2022:1294-1303.
[35] CREMONESI P, KOREN Y, TURRIN R. Performance of recommender algorithms on top-n recommendation tasks[C] //Proceedings of the 4th ACM Conference on Recommender Systems. Barcelona: ACM, 2010:39-46.
[36] HE Xiangnan, LIAO Lizi, ZHANG Hanwang, et al. Neural collaborative filtering[C] //Proceedings of the 26th International Conference on World Wide Web. Perth: ACM, 2017:173-182.
[37] CAO Da, HE Xiangnan, MIAO Lianhai, et al. Attentive group recommendation[C] //The 41st International ACM SIGIR Conference on Research and Development in Information Retrieval. Ann Arbor: ACM, 2018:645-654.
[38] ZHANG Song, ZHENG Nan, WANG Danli. HetGRec: heterogeneous graph attention network for group recommendation[J]. IEEE Intelligent Systems, 2022, 38(1):9-18.
[39] HONG T, IBRAHIM N F. Group recommendation fueled by noise-based graph contrastive learning[J]. Journal of King Saud University-Computer and Information Sciences, 2024, 36(5):102063.
[1] . Based on multi-scale feature fusion and improved attention for rusty bolt and nut detection [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 1-14.
[2] . Fuzzy rough c-means based on the knowledge measure [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 49-64.
[3] ZOU Zheng, LEI Yusheng, LIU Shijian, WANG Dingyi, QIU Xuewei, SHI Wenwen, ZHOU Xiaotong. Precise morphological recognition with zonal micro-direction for termites [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 76-84.
[4] ZHONG Shang, MA Li, LIU Wenzhe, LI Yuhao. Lightweight water surface small object detection model with multi-scale attention mechanism and improved feature fusion [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 15-25.
[5] YU Lei, SUN Yi, HUA Jinming, LI Laquan. Analysis of the prediction model based on deep neural networks for mortality risk prediction for sepsis patients in intensive care units [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 26-35.
[6] SUN Qing, YE Jun, ZENG Guangcai, SONG Suyang, WANG Yixin. Three-way K-means algorithm combining the bat algorithm and the improved compactness [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 65-75.
[7] . Fuzzy mathematical morphology edge detection method derived from general overlap functions [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2026, 61(1): 36-48.
[8] Xia LIANG,Jie GUO. A method of online teaching platform selection based on online reviews [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(9): 108-118.
[9] Chao LI,Wei LIAO. Chinese disease text classification model driven by medical knowledge [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 122-130.
[10] Jie JI,Chengjie SUN,Lili SHAN,Boyue SHANG,Lei LIN. A prompt learning approach for telecom network fraud case classification [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 113-121.
[11] Qi LUO,Gang GOU. Multimodal conversation emotion recognition based on clustering and group normalization [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 105-112.
[12] Fengxu ZHAO,Jian WANG,Yuan LIN,Hongfei LIN. Probability distribution optimization model for learning to rank [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 95-104.
[13] Xingyu HUANG,Mingyu ZHAO,Ziyu LYU. Category-wise knowledge probers for representation learning of graph neural networks [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 85-94.
[14] Liang GUI,Yao XU,Shizhu HE,Yuanzhe ZHANG,Kang LIU,Jun ZHAO. Factual error detection in knowledge graphs based on dynamic neighbor selection [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 76-84.
[15] Ning XIAN,Yixing FAN,Tao LIAN,Jiafeng GUO. Noise network alignment method integrating multiple features [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 64-75.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!