{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T23:35:11Z","timestamp":1776814511895,"version":"3.51.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62192784"],"award-info":[{"award-number":["62192784"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11280-024-01250-x","type":"journal-article","created":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T22:01:51Z","timestamp":1709589711000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Group-to-group recommendation with neural graph matching"],"prefix":"10.1007","volume":"27","author":[{"given":"Chunchen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruobing","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanfu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haili","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,5]]},"reference":[{"key":"1250_CR1","doi-asserted-by":"crossref","unstructured":"Rendle, S.: Factorization machines. In: Proceedings of ICDE, pp. 995\u20131000 (2010). IEEE","DOI":"10.1109\/ICDM.2010.127"},{"key":"1250_CR2","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Wang, M., Feng, F., Chua, T.-S.: Neural graph collaborative filtering. In: Proceedings of SIGIR, pp. 165\u2013174 (2019)","DOI":"10.1145\/3331184.3331267"},{"key":"1250_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013658 (2020)","DOI":"10.1145\/3397271.3401064"},{"key":"1250_CR4","doi-asserted-by":"crossref","unstructured":"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\u20131288 (2020)","DOI":"10.1145\/3397271.3401116"},{"issue":"1","key":"1250_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3457949","volume":"40","author":"L Guo","year":"2021","unstructured":"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\u201327 (2021)","journal-title":"ACM Trans. Inf. Syst. (TOIS)."},{"key":"1250_CR6","doi-asserted-by":"crossref","unstructured":"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\u20132101 (2019)","DOI":"10.24963\/ijcai.2019\/290"},{"key":"1250_CR7","doi-asserted-by":"crossref","unstructured":"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\u20131676 (2020)","DOI":"10.1145\/3397271.3401198"},{"key":"1250_CR8","doi-asserted-by":"crossref","unstructured":"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\u20134387 (2022)","DOI":"10.1609\/aaai.v36i4.20359"},{"key":"1250_CR9","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.24963\/ijcai.2017\/435"},{"key":"1250_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013548 (2019)","DOI":"10.1145\/3357384.3357951"},{"key":"1250_CR11","doi-asserted-by":"crossref","unstructured":"He, X., Chua, T.-S.: Neural factorization machines for sparse predictive analytics. In: Proceedings of SIGIR, pp. 355\u2013364 (2017)","DOI":"10.1145\/3077136.3080777"},{"key":"1250_CR12","doi-asserted-by":"crossref","unstructured":"Guo, H., Tang, R., Ye, Y., Li, Z., He, X.: Deepfm: a factorization-machine based neural network for ctr prediction. Proceedings of IJCAI. (2017)","DOI":"10.24963\/ijcai.2017\/239"},{"key":"1250_CR13","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of SIGMOD, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"1250_CR14","doi-asserted-by":"crossref","unstructured":"Dijkman, R., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L.: Graph matching algorithms for business process model similarity search. In: International Conference on Business Process Management, pp. 48\u201363 (2009). Springer","DOI":"10.1007\/978-3-642-03848-8_5"},{"issue":"10","key":"1250_CR15","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/34.954600","volume":"23","author":"S Berretti","year":"2001","unstructured":"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\u20131105 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1250_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013986 (2003). Elsevier","DOI":"10.1016\/B978-012722442-8\/50091-4"},{"issue":"6","key":"1250_CR17","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","volume":"45","author":"JW Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Rascal: Calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45(6), 631\u2013644 (2002)","journal-title":"Comput. J."},{"issue":"6","key":"1250_CR18","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P Willett","year":"1998","unstructured":"Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6), 983\u2013996 (1998)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"1250_CR19","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proceedings of ICML, pp. 321\u2013328 (2003)"},{"key":"1250_CR20","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1250_CR21","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? Proceedings of ICLR. (2019)"},{"issue":"9","key":"1250_CR22","first-page":"12","volume":"2","author":"A Leman","year":"1968","unstructured":"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\u201316 (1968)","journal-title":"Nauchno-Technicheskaya Informatsiya."},{"key":"1250_CR23","doi-asserted-by":"crossref","unstructured":"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\u2013392 (2019)","DOI":"10.1145\/3289600.3290967"},{"key":"1250_CR24","unstructured":"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\u20133845 (2019). Proceedings of PMLR"},{"key":"1250_CR25","doi-asserted-by":"crossref","unstructured":"Su, Y., Zhang, R., Erfani, S., Gan, J.: Neural graph matching based collaborative filtering. Proceedings of SIGIR. (2021)","DOI":"10.1145\/3404835.3462833"},{"key":"1250_CR26","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. Proceedings of ICLR. (2013)"},{"key":"1250_CR27","doi-asserted-by":"crossref","unstructured":"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\u201310 (2016)","DOI":"10.1145\/2988450.2988454"},{"key":"1250_CR28","unstructured":"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)"},{"issue":"2","key":"1250_CR29","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TKDE.2018.2833443","volume":"31","author":"C Shi","year":"2018","unstructured":"Shi, C., Hu, B., Zhao, W.X., Philip, S.Y.: Heterogeneous information network embedding for recommendation. IEEE Trans. Knowl. Data. Eng. 31(2), 357\u2013370 (2018)","journal-title":"IEEE Trans. Knowl. Data. Eng."},{"key":"1250_CR30","unstructured":"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\u2013256 (2010). JMLR Workshop and Conference Proceedings"},{"key":"1250_CR31","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. Proceedings of ICLR. (2015)"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01250-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-024-01250-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01250-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T10:14:21Z","timestamp":1711016061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-024-01250-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1250"],"URL":"https:\/\/doi.org\/10.1007\/s11280-024-01250-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3107838\/v1","asserted-by":"object"}]},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"25 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"19"}}