{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:43:00Z","timestamp":1776750180594,"version":"3.51.2"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306716","type":"print"},{"value":"9783031306723","type":"electronic"}],"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-30672-3_46","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:10:49Z","timestamp":1681384249000},"page":"689-705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["CLNIE: A Contrastive Learning Based Node Importance Evaluation Method for\u00a0Knowledge Graphs with\u00a0Few Labels"],"prefix":"10.1007","author":[{"given":"Jingbo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yumeng","family":"Song","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Xiaohua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fangfang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: ACM SIGMOD International Conference on Management of Data, pp. 1247\u20131250 (2008)","DOI":"10.1145\/1376616.1376746"},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","volume":"27","author":"SP Borgatti","year":"2005","unstructured":"Borgatti, S.P.: Centrality and network flow. Soc. Netw. 27(1), 55\u201371 (2005)","journal-title":"Soc. Netw."},{"issue":"4","key":"46_CR3","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466\u2013484 (2006)","journal-title":"Soc. Netw."},{"key":"46_CR4","unstructured":"Chen, T., Kornblith, S., Norouzi, M., Hinton, G.: A simple framework for contrastive learning of visual representations. In: International Conference on Machine Learning, pp. 1597\u20131607. PMLR (2020)"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Computing classic closeness centrality, at scale. In: ACM Conference on Online Social Networks, pp. 37\u201350 (2014)","DOI":"10.1145\/2660460.2660465"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Gao, T., Yao, X., Chen, D.: SimCSE: simple contrastive learning of sentence embeddings. arXiv preprint arXiv:2104.08821 (2021)","DOI":"10.18653\/v1\/2021.emnlp-main.552"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Geng, H., et al.: Modeling dynamic heterogeneous graph and node importance for future citation prediction. In: ACM International Conference on Information & Knowledge Management, pp. 572\u2013581 (2022)","DOI":"10.1145\/3511808.3557398"},{"key":"46_CR8","unstructured":"Hassani, K., Khasahmadi, A.H.: Contrastive multi-view representation learning on graphs. In: International Conference on Machine Learning, pp. 4116\u20134126. PMLR (2020)"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank. In: International Conference on World Wide Web, pp. 517\u2013526 (2002)","DOI":"10.1145\/511446.511513"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"He, K., Fan, H., Wu, Y., Xie, S., Girshick, R.: Momentum contrast for unsupervised visual representation learning. In: IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 9729\u20139738 (2020)","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Huang, C., Fang, Y., Lin, X., Cao, X., Zhang, W., Orlowska, M.: Estimating node importance values in heterogeneous information networks. In: ICDE, pp. 846\u2013858. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00068"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Huang, H., Sun, L., Du, B., Liu, C., Lv, W., Xiong, H.: Representation learning on knowledge graphs for node importance estimation. In: ACM SIGKDD, pp. 646\u2013655 (2021)","DOI":"10.1145\/3447548.3467342"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Jung, J., Park, N., Lee, S., Kang, U.: Bepi: Fast and memory-efficient method for billion-scale random walk with restart. In: ACM International Conference on Management of Data, pp. 789\u2013804 (2017)","DOI":"10.1145\/3035918.3035950"},{"issue":"5","key":"46_CR14","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604\u2013632 (1999)","journal-title":"J. ACM (JACM)"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Liu, C., Fu, Y., Xu, C., Yang, S., Li, J., Wang, C., Zhang, L.: Learning a few-shot embedding model with contrastive learning. In: the AAAI Conference on Artificial Intelligence, vol. 35, pp. 8635\u20138643 (2021)","DOI":"10.1609\/aaai.v35i10.17047"},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.aiopen.2021.02.001","volume":"2","author":"X Liu","year":"2021","unstructured":"Liu, X., Tang, J.: Network representation learning: a macro and micro view. AI Open 2, 43\u201364 (2021)","journal-title":"AI Open"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Luo, X., Chen, Y., Wen, L., Pan, L., Xu, Z.: Boosting few-shot classification with view-learnable contrastive learning. In: IEEE International Conference on Multimedia and Expo, pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/ICME51207.2021.9428444"},{"issue":"1","key":"46_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman, M.E.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39\u201354 (2005)","journal-title":"Soc. Netw."},{"key":"46_CR19","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Tech. Rep., Stanford InfoLab (1999)"},{"key":"46_CR20","unstructured":"Palmonari, M., Minervini, P.: Knowledge graph embeddings and explainable AI. Knowledge Graphs for Explainable Artificial Intelligence: Foundations, Applications and Challenges 47, 49 (2020)"},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Park, N., Kan, A., Dong, X.L., Zhao, T., Faloutsos, C.: Estimating node importance in knowledge graphs using graph neural networks. In: ACM SIGKDD, pp. 596\u2013606 (2019)","DOI":"10.1145\/3292500.3330855"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Park, N., Kan, A., Dong, X.L., Zhao, T., Faloutsos, C.: Multiimport: inferring node importance in a knowledge graph from multiple input signals. In: ACM SIGKDD, pp. 503\u2013512 (2020)","DOI":"10.1145\/3394486.3403093"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., Tang, J.: GCC: graph contrastive coding for graph neural network pre-training. In: ACM SIGKDD, pp. 1150\u20131160 (2020)","DOI":"10.1145\/3394486.3403168"},{"key":"46_CR24","unstructured":"Velickovic, P., Fedus, W., Hamilton, W.L., Li\u00f2, P., Bengio, Y., Hjelm, R.D.: Deep graph infomax. ICLR (Poster), vol. 2, no 3, p. 4 (2019)"},{"key":"46_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, J., Luo, Y.: Degree centrality, betweenness centrality, and closeness centrality in social network. In: International Conference on Modelling, Simulation and Applied Mathematics, pp. 300\u2013303. Atlantis Press (2017)","DOI":"10.2991\/msam-17.2017.68"},{"key":"46_CR26","unstructured":"Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., Wang, L.: Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30672-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:32:39Z","timestamp":1710264759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30672-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306716","9783031306723"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30672-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"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":"652","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":"125","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":"66","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":"19% - 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":"3","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":"7.3","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)"}}]}}