{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:48:32Z","timestamp":1742950112316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466762"},{"type":"electronic","value":"9783031466779"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46677-9_1","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heterogeneous Line Graph Neural Network for\u00a0Link Prediction"],"prefix":"10.1007","author":[{"given":"Yiyang","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuncong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"issue":"7","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Networks 25(3), 211\u2013230 (2003)","journal-title":"Soc. Networks"},{"issue":"6","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc, L., Zhou, T.: Link prediction in complex networks: a survey. Phys. A 390(6), 1150\u20131170 (2011)","journal-title":"Phys. A"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/JPROC.2015.2483592","volume":"104","author":"M Nickel","year":"2016","unstructured":"Nickel, M., Murphy, K., Tresp, V., Gabrilovich, E.: A review of relational machine learning for knowledge graphs. Proc. IEEE 104(1), 11\u201333 (2016)","journal-title":"Proc. IEEE"},{"key":"1_CR5","unstructured":"Airoldi, E. M., Blei, D. M., Fienberg, S. E., et al.: Mixed membership stochastic blockmodels. J. Mach. Learn. Res., 1981\u20132014 (2008)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"25102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64(2), 25102 (2001)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou, T., L\u00fc, L., Zhang, Y.: Predicting missing links via local information. Europ. Phys. J. B. 71(4), 623\u2013630 (2009)","journal-title":"Europ. Phys. J. B."},{"key":"1_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":"1_CR9","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: ICLR (2017)"},{"key":"1_CR10","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., et al.: Graph attention networks. In: ICLR (2018)"},{"key":"1_CR11","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NeurIPS, pp. 1024\u20131034 (2017)"},{"issue":"11","key":"1_CR12","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., et al.: Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. Proc. VLDB Endowment 4(11), 992\u20131003 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Wang, X., Ji, H., Shi, C., et al.: Heterogeneous graph attention network. In: WWW, pp. 2022\u20132032 (2019)","DOI":"10.1145\/3308558.3313562"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Fu, X., Zhang, J., Meng, Z., et al.: MAGNN: metapath aggregated graph neural network for heterogeneous graph embedding. In: WWW, pp. 2331\u20132341 (2020)","DOI":"10.1145\/3366423.3380297"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, C., Song, D., Huang, C., et al.: Heterogeneous graph neural network. In: KDD, pp. 793\u2013803 (2019)","DOI":"10.1145\/3292500.3330961"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Xu, S., Yang, C., Shi, C., et al.: Topic-aware heterogeneous graph neural network for link prediction. In: CIKM, pp. 2261\u20132270 (2021)","DOI":"10.1145\/3459637.3482485"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415\u2013444 (2001)","journal-title":"Ann. Rev. Sociol."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Dong, Y., Chawla, N.V., Swami, A.: Metapath2vec: scalable representation learning for heterogeneous networks. In: KDD, pp. 135\u2013144 (2017)","DOI":"10.1145\/3097983.3098036"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Sun, Y., Han, J.: Mining heterogeneous information networks. Principles Methodol. 14(2), 20\u201328 (2012). Morgan & Claypool Publishers","DOI":"10.1007\/978-3-031-01902-9"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Shi, C., Hu, B., Zhao, W.X., et al.: Heterogeneous information network embedding for recommendation. IEEE Trans. Knowl. Data Eng., 357\u2013370 (2019)","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Cen, Y., Zou, X., Zhang, J., et al.: Representation learning for attributed multiplex heterogeneous network. In: KDD, pp. 1358\u20131368 (2019)","DOI":"10.1145\/3292500.3330964"},{"issue":"9","key":"1_CR22","first-page":"5103","volume":"44","author":"L Cai","year":"2021","unstructured":"Cai, L., Li, J., Wang, J., et al.: Line graph neural networks for link prediction. IEEE Trans. Pattern Anal. Mach. Intell. 44(9), 5103\u20135113 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1_CR23","unstructured":"Chen, Z., Li, L., Bruna, J.: Supervised community detection with line graph neural networks. In: ICLR (2019)"},{"key":"1_CR24","unstructured":"Zhu J., Yan Y., Zhao L., et al.: Beyond homophily in graph neural networks: current limitations and effective designs. In: NeurIPS, pp. 7793\u20137804 (2020)"},{"key":"1_CR25","unstructured":"Wu, F., Souza, A., Zhang, T., et al.: Simplifying graph convolutional networks. In: ICML, pp. 6861\u20136871 (2019)"},{"key":"1_CR26","unstructured":"Mikolov, T., Chen, K., Corrado, G., et al.: Efficient estimation of word representations in vector space. In: ICLR (2013)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: KDD, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: KDD, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46677-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:21:50Z","timestamp":1699104110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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":"43% - 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":"2.97","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":"3.77","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}