Abstract
Nowadays, with the development of recommender systems, an emerging recommendation scenario called group-to-group recommendation has played a vital role in information acquisition for users. The new recommendation scenario seeks to recommend a group of related items to users with similar interests. To some extent, it alleviates the problem of point-to-point recommendations getting trapped in an information cocoon due to an over-reliance on user behaviors. For the new recommendation scenario, the existing recommendation methods cannot model the complex interactions between user groups and item groups, thus affecting the accuracy of the group-to-group recommendation. In this paper, we propose a group-to-group recommendation method, which abstracts user groups and item groups into graphs and calculates the similarity between two graphs based on graph matching, dubbed as GMRec. Specifically, we construct the graph of user groups and item groups and then calculate the graph similarity scores between user groups and item groups from two perspectives of feature matching and structure matching. Experimental results show that our model achieves higher accuracy than state-of-the-art models on three industrial datasets with different group sizes, with a maximum improvement of 8.2%.
Similar content being viewed by others
Availability of data and materials
We will indicate the source of the three industrial datasets and the company of the datasets after review.
References
Rendle, S.: Factorization machines. In: Proceedings of ICDE, pp. 995–1000 (2010). IEEE
Wang, X., He, X., Wang, M., Feng, F., Chua, T.-S.: Neural graph collaborative filtering. In: Proceedings of SIGIR, pp. 165–174 (2019)
He, Z., Chow, C.-Y., Zhang, J.-D.: Game: Learning graphical and attentive multi-view embeddings for occasional group recommendation. In: Proceedings of SIGIR, pp. 649–658 (2020)
Sankar, A., Wu, Y., Wu, Y., Zhang, W., Yang, H., Sundaram, H.: Groupim: A mutual information maximization framework for neural group recommendation. In: Proceedings of SIGIR, pp. 1279–1288 (2020)
Guo, L., Yin, H., Chen, T., Zhang, X., Zheng, K.: Hierarchical hyperedge embedding-based representation learning for group recommendation. ACM Trans. Inf. Syst. (TOIS). 40(1), 1–27 (2021)
Chen, L., Liu, Y., He, X., Gao, L., Zheng, Z.: Matching user with item set: Collaborative bundle recommendation with deep attention network. In: Proceedings of IJCAI, pp. 2095–2101 (2019)
Chang, J., Gao, C., He, X., Jin, D., Li, Y.: Bundle recommendation with graph convolutional networks. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1673–1676 (2020)
Zhao, S., Wei, W., Zou, D., Mao, X.: Multi-view intent disentangle graph networks for bundle recommendation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 4379–4387 (2022)
Xiao, J., Ye, H., He, X., Zhang, H., Wu, F., Chua, T.-S.: Attentional factorization machines: Learning the weight of feature interactions via attention networks. Proceedings of IJCAI. (2017)
Li, Z., Cui, Z., Wu, S., Zhang, X., Wang, L.: Fi-gnn: Modeling feature interactions via graph neural networks for ctr prediction. In: Proceedings of CIKM, pp. 539–548 (2019)
He, X., Chua, T.-S.: Neural factorization machines for sparse predictive analytics. In: Proceedings of SIGIR, pp. 355–364 (2017)
Guo, H., Tang, R., Ye, Y., Li, Z., He, X.: Deepfm: a factorization-machine based neural network for ctr prediction. Proceedings of IJCAI. (2017)
Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of SIGMOD, pp. 766–777 (2005)
Dijkman, R., Dumas, M., García-Bañuelos, L.: Graph matching algorithms for business process model similarity search. In: International Conference on Business Process Management, pp. 48–63 (2009). Springer
Berretti, S., Del Bimbo, A., Vicario, E.: Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1089–1105 (2001)
Srinivasa, S., Kumar, S.: A platform based on the multi-dimensional data model for analysis of bio-molecular structures. In: Proceedings of VLDB, pp. 975–986 (2003). Elsevier
Raymond, J.W., Gardiner, E.J., Willett, P.: Rascal: Calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45(6), 631–644 (2002)
Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6), 983–996 (1998)
Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proceedings of ICML, pp. 321–328 (2003)
Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201–1242 (2010)
Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? Proceedings of ICLR. (2019)
Leman, A., Weisfeiler, B.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsiya. 2(9), 12–16 (1968)
Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., Wang, W.: Simgnn: A neural network approach to fast graph similarity computation. In: Proceedings of WSDM, pp. 384–392 (2019)
Li, Y., Gu, C., Dullien, T., Vinyals, O., Kohli, P.: Graph matching networks for learning the similarity of graph structured objects. In: International Conference on Machine Learning, pp. 3835–3845 (2019). Proceedings of PMLR
Su, Y., Zhang, R., Erfani, S., Gan, J.: Neural graph matching based collaborative filtering. Proceedings of SIGIR. (2021)
Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. Proceedings of ICLR. (2013)
Cheng, H.-T., Koc, L., Harmsen, J., Shaked, T., Chandra, T., Aradhye, H., Anderson, G., Corrado, G., Chai, W., Ispir, M., et al.: Wide & deep learning for recommender systems. In: Proceedings of the 1st Workshop on Deep Learning for Recommender Systems, pp. 7–10 (2016)
Yu, X., Ren, X., Gu, Q., Sun, Y., Han, J.: Collaborative filtering with entity similarity regularization in heterogeneous information networks. Proceedings of IJCAI. 27 (2013)
Shi, C., Hu, B., Zhao, W.X., Philip, S.Y.: Heterogeneous information network embedding for recommendation. IEEE Trans. Knowl. Data. Eng. 31(2), 357–370 (2018)
Glorot, X., Bengio, Y.: Understanding the difficulty of training deep feedforward neural networks. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 249–256 (2010). JMLR Workshop and Conference Proceedings
Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. Proceedings of ICLR. (2015)
Funding
This work is supported in part by the National Natural Science Foundation of China (No. 62192784, U1936104, U20B2045, 62172052, 62002029).
Author information
Authors and Affiliations
Contributions
Chunchen Wang and Cheng Yang wrote the main manuscript text. Wei Wang and Ruobing Xie prepared figures and fixed text. All authors reviewed the manuscript.
Corresponding author
Ethics declarations
Ethical Approval
We collect three industrial datasets from real business scenarios, which is the biggest social platform serving more than one billion users, and users can browse and share articles. To safeguard user privacy, we have implemented data anonymization techniques and rigorous desensitization measures.
Competing interests
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wang, C., Wang, W., Yang, C. et al. Group-to-group recommendation with neural graph matching. World Wide Web 27, 19 (2024). https://doi.org/10.1007/s11280-024-01250-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11280-024-01250-x