{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:05:04Z","timestamp":1773511504145,"version":"3.50.1"},"reference-count":34,"publisher":"Informa UK Limited","issue":"1","license":[{"start":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T00:00:00Z","timestamp":1631059200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976061"],"award-info":[{"award-number":["61976061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Key Laboratory of Big Data Analysis and Processing","award":["202003"],"award-info":[{"award-number":["202003"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Connection Science"],"published-print":{"date-parts":[[2022,12,31]]},"DOI":"10.1080\/09540091.2021.1974819","type":"journal-article","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T15:27:20Z","timestamp":1631114840000},"page":"124-138","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":51,"title":["API recommendation for Mashup creation based on neural graph collaborative filtering"],"prefix":"10.1080","volume":"34","author":[{"given":"Sixian","family":"Lian","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Guangdong University of Foreign Studies, Guangzhou, People Republic of China"}]},{"given":"Mingdong","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Guangdong University of Foreign Studies, Guangzhou, People Republic of China"},{"name":"Guangdong Key Laboratory of Big Data Analysis and Processing, Guangzhou, People Republic of China"}]}],"member":"301","published-online":{"date-parts":[[2021,9,8]]},"reference":[{"key":"CIT0001","unstructured":"Berg, R. v. d., Kipf, T. N. & Welling, M. (2017). Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2017.05.001"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2019.00014"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2016.65"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2017.44"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2624293"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"CIT0008","unstructured":"Kingma, D. P. & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2013.107"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46295-0_23"},{"key":"CIT0013","author":"Liang W.","year":"2021","journal-title":"IEEE Transactions on Computers"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2907092"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3086845"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2433251"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1109\/TEM.2019.2961376"},{"key":"CIT0018","unstructured":"Rendle, S., Freudenthaler, C., Gantner, Z. & Schmidt-Thieme, L. (2012). BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618."},{"key":"CIT0019","first-page":"1","author":"Tang B.","year":"2021","journal-title":"Connection Science"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2894297"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1504\/IJCSE.2019.103256"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2517097"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783273"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"CIT0025","unstructured":"Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.i. & Jegelka, S. (2018). Representation learning on graphs with jumping knowledge networks. International Conference on machine learning."},{"key":"CIT0026","doi-asserted-by":"crossref","unstructured":"Xu, W., Cao, J., Hu, L., Wang, J. & Li, M. (2013). A social-aware Service recommendation Approach for Mashup creation. 2013 IEEE 20th International Conference on Web Services.","DOI":"10.1109\/ICWS.2013.24"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"Yang, J.H., Chen, C.M., Wang, C.J. & Tsai, M.F. (2018). HOP-rec: high-order proximity for implicit recommendation. Proceedings of the 12th ACM Conference on recommender systems.","DOI":"10.1145\/3240323.3240381"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2015.38"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2008.4639055"},{"key":"CIT0030","first-page":"1","volume":"13","author":"Zhang N.","year":"2017","journal-title":"IEEE Transactions on Services Computing"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2017.2693147"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2891517"},{"key":"CIT0033","author":"Zhang Y.","year":"2019","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"CIT0034","first-page":"1","author":"Zheng Z.","year":"2020","journal-title":"IEEE Transactions on Services Computing"}],"container-title":["Connection Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09540091.2021.1974819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T15:55:56Z","timestamp":1681746956000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/09540091.2021.1974819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,8]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1080\/09540091.2021.1974819"],"URL":"https:\/\/doi.org\/10.1080\/09540091.2021.1974819","relation":{},"ISSN":["0954-0091","1360-0494"],"issn-type":[{"value":"0954-0091","type":"print"},{"value":"1360-0494","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,8]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ccos20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ccos20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-06-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}