{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:58:40Z","timestamp":1763665120386,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T00:00:00Z","timestamp":1675987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T00:00:00Z","timestamp":1675987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176221"],"award-info":[{"award-number":["62176221"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Hum-Cent Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the study of social relationship inference, social relationship link inference aims to infer whether there is a social relationship between users. Most previous works applied the unsupervised graph random walk sampling, which had sampling bias and lost much information. In this paper, a Social Relationship Link Inference Based on Graph Convolutional Networks (SLiGCN) is proposed, which learns the spatiotemporal information of check-ins and the impact of related users\u2019 trajectories. It firstly employs the end-to-end supervised learning and applies a recurrent neural network to extract spatiotemporal sequence features from trajectories. Then the graph convolutional network fuses the features of neighboring nodes and employs the fully connected network to infer social relationship links. Finally, it is evaluated with AUC on three real-world datasets. The experiment results show that, compared with baseline models, it not only avoids hand-crafted feature construction that requires much prior knowledge, but also achieves 10% improvement on average.<\/jats:p>","DOI":"10.1007\/s44230-023-00016-4","type":"journal-article","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T20:25:27Z","timestamp":1676060727000},"page":"47-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Social Relationship Link Inference Based on Graph Convolutional Networks"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2919-0448","authenticated-orcid":false,"given":"Shunyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianrui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Cho E, Seth A M, Jure L. Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD The International Conference on Knowledge Discovery and Data Mining, 2011, pp 1082\u20131090.","DOI":"10.1145\/2020408.2020579"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Scellato S, Anastasios N, Cecilia M. Exploiting place features in link prediction on location-based social networks. In: Proceedings of the 17th ACM SIGKDD The International Conference on Knowledge Discovery and Data Mining, 2011, pp 1046\u20131054.","DOI":"10.1145\/2020408.2020575"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Perozzi B, Rami A, Steven S. Deepwalk: Online learning of social representations. In: Proceedings of the 17th ACM SIGKDD The International Conference on Knowledge Discovery and Data Mining, 2014, pp 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"issue":"5786","key":"16_CR4","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1126\/science.1127647","volume":"313","author":"GE Hinton","year":"2006","unstructured":"Hinton GE, Ruslan RS. Reducing the dimensionality of data with neural networks. Science. 2006;313(5786):504\u20137.","journal-title":"Science"},{"key":"16_CR5","unstructured":"Bruna J, Wojciech Z, Arthur S, LeCun Y. Spectral networks and locally connected networks on graphs.\u00a0arxiv:1312.6203 (2013)"},{"issue":"36","key":"16_CR6","doi-asserted-by":"publisher","first-page":"15274","DOI":"10.1073\/pnas.0900282106","volume":"106","author":"N Eagle","year":"2009","unstructured":"Eagle N, Alex P, David L. Inferring friendship network structure by using mobile phone data. Proc Natl Aacademy Sci. 2009;106(36):15274\u20138.","journal-title":"Proc Natl Aacademy Sci"},{"issue":"7","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"ND Liben","year":"2007","unstructured":"Liben ND, Jon K. The link-prediction problem for social networks. J Am Soc Inf Sci Technol. 2007;58(7):1019\u201331.","journal-title":"J Am Soc Inf Sci Technol"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Backstorm L, Jure L. Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, 2011, pp 635\u2013644.","DOI":"10.1145\/1935826.1935914"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Wu Y, Lian D, Jin S, Chen E. Graph Convolutional Networks on User Mobility Heterogeneous Graphs for Social Relationship Inference. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, 2019, pp 3898\u20133904.","DOI":"10.24963\/ijcai.2019\/541"},{"key":"16_CR10","first-page":"3844","volume":"29","author":"M Defferrard","year":"2016","unstructured":"Defferrard M, Xavier B, Pierre V. Convolutional neural networks on graphs with fast localized spectral filtering. Adv Neural Inf Process Syst. 2016;29:3844\u201352.","journal-title":"Adv Neural Inf Process Syst"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/TNN.2008.2010350","volume":"20","author":"A Micheli","year":"2009","unstructured":"Micheli A. Neural network for graphs: a contextual constructive approach. IEEE Trans Neural Netw. 2009;20(3):498\u2013511.","journal-title":"IEEE Trans Neural Netw"},{"key":"16_CR12","first-page":"1993","volume":"29","author":"J Atwood","year":"2016","unstructured":"Atwood J, Don T. Diffusion-convolutional neural networks. Adv Neural Inf Process Syst. 2016;29:1993\u20132001.","journal-title":"Adv Neural Inf Process Syst"},{"issue":"8","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J. Long short-term memory. Neural Comput. 1997;9(8):1735\u201380.","journal-title":"Neural Comput"},{"key":"16_CR14","unstructured":"Chung J, Gulcehre C, Cho K, Bengio Y. Empirical evaluation of gated recurrent neural networks on sequence modeling.\u00a0arxiv:1412.3555 (2014)"},{"issue":"11","key":"16_CR15","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun Y, Bottou L, Bengio Y, Haffner P. Gradient-based learning applied to document recognition. Proc IEEE. 1998;86(11):2278\u2013324.","journal-title":"Proc IEEE"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Yang D, Qu B, Yang J, Cudre-Mauroux P. Revisiting user mobility and social relationships in lbsns: a hypergraph embedding approach. In: Proceedings of the world wide web conference, 2019, pp 2147\u20132157.","DOI":"10.1145\/3308558.3313635"},{"issue":"6","key":"16_CR17","first-page":"1176","volume":"45","author":"An Jing-Min","year":"2022","unstructured":"Jing-Min An, Guan-Yu Li, Wei J, Yun-Hao S. A point-of-interest recommendation method based on activity tracks and personalized-area partitions of users. Chin J Comput. 2022;45(6):1176\u201394 (in Chinese).","journal-title":"Chin J Comput"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Backes M, Humbert M, Pang J, Zhang Y. walk2friends: Inferring social links from mobility profiles. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, pp 1943\u20131957.","DOI":"10.1145\/3133956.3133972"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Dong Y, Chawla NV, Swami A. metapath2vec: Scalable representation learning for heterogeneous networks. In: Proceedings of 23rd ACM SIGKDD International Conference on Web Search and Data Mining, 2017, pp 135\u2013144.","DOI":"10.1145\/3097983.3098036"},{"key":"16_CR20","first-page":"1024","volume":"30","author":"W Hamilton","year":"2017","unstructured":"Hamilton W, Ying Z, Leskovec J. Inductive representation learning on large graphs. Adv Neural Inf Process Syst. 2017;30:1024\u201334.","journal-title":"Adv Neural Inf Process Syst."},{"key":"16_CR21","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y. Graph attention networks.\u00a0arxiv:1710.10903 (2017)"}],"container-title":["Human-Centric Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44230-023-00016-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44230-023-00016-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44230-023-00016-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T19:14:39Z","timestamp":1679685279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44230-023-00016-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,10]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s44230-023-00016-4","relation":{},"ISSN":["2667-1336"],"issn-type":[{"type":"electronic","value":"2667-1336"}],"subject":[],"published":{"date-parts":[[2023,2,10]]},"assertion":[{"value":"8 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to Participate"}},{"value":"Authors declare consent for publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}]}}