{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:29:55Z","timestamp":1742966995002,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819980666"},{"type":"electronic","value":"9789819980673"}],"license":[{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8067-3_19","type":"book-chapter","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T20:02:55Z","timestamp":1700078575000},"page":"253-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Link Prediction Based on the Sub-graphs Learning with Fused Features"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4386-8215","authenticated-orcid":false,"given":"Haoran","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6662-1895","authenticated-orcid":false,"given":"Jianxia","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6949-2111","authenticated-orcid":false,"given":"Dipai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1054-3175","authenticated-orcid":false,"given":"Shuxi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6044-876X","authenticated-orcid":false,"given":"Shuhan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3813-9456","authenticated-orcid":false,"given":"Yu","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7525-0114","authenticated-orcid":false,"given":"Xinyun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Zou, X.: A survey on application of knowledge graph. In: Conference 2020, CCEAI, vol. 1487, Singapore (2020)","DOI":"10.1088\/1742-6596\/1487\/1\/012016"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Y., Ma, T., Yang, X., Wang, J., Song, B., Zeng, X.: MUFFIN: multi-scale feature fusion for drug-frug interaction prediction. Bioinformatics 37(17), 2651\u20132658 (2021)","DOI":"10.1093\/bioinformatics\/btab169"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Chen, L., Xie, Y., Zheng, Z., Zheng, H., Xie, J.: Friend recommendation based on multi-social graph convolutional network. IEEE Access 8, 43618\u201343629 (2020)","DOI":"10.1109\/ACCESS.2020.2977407"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Oh, S., Choi, J., Ko, N., Yoon, J.: Predicting product development directions for new product planning using patent classification-based link prediciton. Scientometrics 125(3), 1833\u20131876 (2020)","DOI":"10.1007\/s11192-020-03709-w"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64, 025102(R) (2001)","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211\u2013230 (2003)","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"19_CR7","unstructured":"Fitz-Gerald, S.J., Wiggins, B.: Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York (1986)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","DOI":"10.1007\/BF02289026"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Perozzi, B., AI-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: CONFERENCE 2014, KDD, vol. 14, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"19_CR10","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. Computation and Language (cs.CL). arXiv preprint arXiv:1301.3781 (2013)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. Social and Information Networks. arXiv preprint arXiv:1607.00653 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: LINE: large-scale information network embedding. Machine Learning. arXiv preprint arXiv:1503.03578 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"19_CR13","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: Conference 2017, ICLR. arXiv preprint arXiv:1609.02907 (2017)"},{"key":"19_CR14","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. Social and Information Networks. arXiv preprint arXiv:1706.02216 (2017)"},{"key":"19_CR15","unstructured":"Zhang, M., Cui, Z., Neumann, M., Chen, Y.: An end-to-end deep learning architectire for graph classification. In: Conference 2018, AAAI, vol. 554, pp. 4438\u20134445 (2018)"},{"key":"19_CR16","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. Machine Learning. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Louis, P., Jacob, S.A., Salehi-Abari, A.: Sampling enclosing sub-graphs for link prediction. Machine Learning. arXiv preprint arXiv:2206.12004 (2022)","DOI":"10.1145\/3511808.3557688"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Bielak, P., Puchalska, D., Kajdanowicz, T.: Retrofitting structural graph embeddings with node attribute information. In: Conference 2022, ICCS, London, part 1, pp. 178\u2013191 (2022)","DOI":"10.1007\/978-3-031-08751-6_13"},{"key":"19_CR19","unstructured":"Ai, B., Qin, Z., Shen, W., Li, Y.: Structure enhanced graph neural networks for link prediction. Machine Learning. arXiv preprint arXiv:2201.05293 (2022)"},{"key":"19_CR20","unstructured":"Li, P., Wang, Y., Wang, H., Leskovec, J.: Distance encoding: design provably more powerful neural networks for graph representation learning. Machine Learning. arXiv preprint arXiv:2009.00142 (2020)"},{"key":"19_CR21","unstructured":"Zhang, M., Chen, Y.: Link prediction based on graph neural networks. Machine Learning. arXiv preprint arXiv:1802.09691 (2018)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. Computer Vision and Pattern Recognition. arXiv preprint arXiv:1512.03385 (2015)","DOI":"10.1109\/CVPR.2016.90"},{"key":"19_CR23","unstructured":"Bahdanau, D., Cho, K., Bengio, Y.: Neural machine translation by jointly learning to align and translate. Computation and Language. arXiv preprint arXiv:1409.0473 (2014)"},{"key":"19_CR24","unstructured":"Vaswani, A., et al.: Attention is all you need. Computation and Language. arXiv preprint arXiv:1706.03762 (2017)"},{"key":"19_CR25","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? Machine Learning. arXiv preprint arXiv:1810.00826 (2018)"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Xue, H.-J., Dai, X., Zhang, J., Huang, S., Chen, J.: Deep matrix factorization models for recommender systems. In: Conference 2017, IJCAI, Melbourne, vol. 17, pp. 3203\u20133209 (2017)","DOI":"10.24963\/ijcai.2017\/447"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8067-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:39:01Z","timestamp":1709829541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8067-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"ISBN":["9789819980666","9789819980673"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8067-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,16]]},"assertion":[{"value":"16 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1274","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"650","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.14","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.46","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}