{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:13:23Z","timestamp":1755839603604,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:00:00Z","timestamp":1695168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:00:00Z","timestamp":1695168000000},"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":["62002311"],"award-info":[{"award-number":["62002311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program of Key Laboratory of Yunnan Province","award":["202205AG070003"],"award-info":[{"award-number":["202205AG070003"]}]},{"name":"Major Science and Technology Special Foundation of Yunnan Province","award":["202202AD080001"],"award-info":[{"award-number":["202202AD080001"]}]},{"name":"Foundation of Fundamental Research of Yunnan Province","award":["202201AT070394"],"award-info":[{"award-number":["202201AT070394"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Knowledge graph (KG) has become the vital resource for various applications like question answering and recommendation system. However, several relations in KG only have few observed triples, which makes it necessary to develop the method for few-shot relation prediction. In this paper, we propose the <jats:bold>C<\/jats:bold>onvolutional Neural Network with Self-<jats:bold>A<\/jats:bold>ttention <jats:bold>R<\/jats:bold>elation <jats:bold>P<\/jats:bold>rediction (CARP) model to predict new facts with few observed triples. First, to learn the relation property features, we build a feature encoder by using the convolutional neural network with self-attention from the few observed triples rather than background knowledge. Then, by incorporating the learned features, we give an embedding network to learn the representation of incomplete triples. Finally, we give the loss function and training algorithm of our CARP model. Experimental results on three real-world datasets show that our proposed method improves Hits@10 by 48% on average over the state-of-the-art competitors.<\/jats:p>","DOI":"10.1007\/s41019-023-00230-x","type":"journal-article","created":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:02:31Z","timestamp":1695196951000},"page":"385-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Few-Shot Relation Prediction of Knowledge Graph via Convolutional Neural Network with Self-Attention"],"prefix":"10.1007","volume":"8","author":[{"given":"Shanna","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3641-1461","authenticated-orcid":false,"given":"Kun","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengbao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"issue":"11","key":"230_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller GA (1995) Wordnet: a lexical database for english. Commun ACM 38(11):39\u201341","journal-title":"Commun ACM"},{"doi-asserted-by":"crossref","unstructured":"Suchanek FM, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge. In: Proceedings of the 16th International Conference on World Wide Web, pp. 697\u2013706","key":"230_CR2","DOI":"10.1145\/1242572.1242667"},{"doi-asserted-by":"crossref","unstructured":"Bollacker KD, Evans C, Paritosh PK, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1247\u20131250","key":"230_CR3","DOI":"10.1145\/1376616.1376746"},{"issue":"10","key":"230_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrandecic","year":"2014","unstructured":"Vrandecic D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385","journal-title":"Commun ACM"},{"doi-asserted-by":"crossref","unstructured":"Lan Y, He G, Jiang J, Jiang J, Zhao WX, Wen J (2021) A survey on complex knowledge base question answering: Methods, challenges and solutions. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence, pp. 4483\u20134491","key":"230_CR5","DOI":"10.24963\/ijcai.2021\/611"},{"issue":"4","key":"230_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s41019-022-00200-9","volume":"7","author":"Z Lei","year":"2022","unstructured":"Lei Z, Zhang G, Wu L, Zhang K, Liang R (2022) A multi-level mesh mutual attention model for visual question answering. Data Sci Eng 7(4):339\u2013353","journal-title":"Data Sci Eng"},{"issue":"6","key":"230_CR7","doi-asserted-by":"publisher","first-page":"232","DOI":"10.3390\/info12060232","volume":"12","author":"J Chicaiza","year":"2021","unstructured":"Chicaiza J, D\u00edaz PV (2021) A comprehensive survey of knowledge graph-based recommender systems: Technologies, development, and contributions. Information 12(6):232","journal-title":"Information"},{"issue":"1","key":"230_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s41019-023-00204-z","volume":"8","author":"C Li","year":"2023","unstructured":"Li C, Zhou B, Lin W, Tang Z, Tang Y, Zhang Y, Cao J (2023) A personalized explainable learner implicit friend recommendation method. Data Sci Eng 8(1):23\u201335","journal-title":"Data Sci Eng"},{"doi-asserted-by":"crossref","unstructured":"Xiong W, Yu M, Chang S, Guo X, Wang WY (2018) One-shot relational learning for knowledge graphs. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pp. 1980\u20131990","key":"230_CR9","DOI":"10.18653\/v1\/D18-1223"},{"issue":"3","key":"230_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3386252","volume":"53","author":"Y Wang","year":"2021","unstructured":"Wang Y, Yao Q, Kwok JT, Ni LM (2021) Generalizing from a few examples: a survey on few-shot learning. ACM Comput Surv 53(3):1\u201334","journal-title":"ACM Comput Surv"},{"issue":"9","key":"230_CR11","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"230_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424672","volume":"15","author":"A Rossi","year":"2021","unstructured":"Rossi A, Barbosa D, Firmani D, Matinata A, Merialdo P (2021) Knowledge graph embedding for link prediction: a comparative analysis. ACM Trans Knowl Discov Data 15(2):1\u201349","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"230_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s41019-020-00118-0","volume":"5","author":"LF Sikos","year":"2020","unstructured":"Sikos LF, Philp D (2020) Provenance-aware knowledge representation: A survey of data models and contextualized knowledge graphs. Data Sci Eng 5(3):293\u2013316","journal-title":"Data Sci Eng"},{"doi-asserted-by":"crossref","unstructured":"Zhang C, Yao H, Huang C, Jiang M, Li Z, Chawla NV (2020) Few-shot knowledge graph completion. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, pp. 3041\u20133048","key":"230_CR14","DOI":"10.1609\/aaai.v34i03.5698"},{"doi-asserted-by":"crossref","unstructured":"Sheng J, Guo S, Chen Z, Yue J, Wang L, Liu T, Xu H (2020) Adaptive attentional network for few-shot knowledge graph completion. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, pp. 1681\u20131691","key":"230_CR15","DOI":"10.18653\/v1\/2020.emnlp-main.131"},{"doi-asserted-by":"crossref","unstructured":"Niu G, Li Y, Tang C, Geng R, Dai J, Liu Q, Wang H, Sun J, Huang F, Si L (2021) Relational learning with gated and attentive neighbor aggregator for few-shot knowledge graph completion. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 213\u2013222","key":"230_CR16","DOI":"10.1145\/3404835.3462925"},{"key":"230_CR17","first-page":"5998","volume":"30","author":"A Vaswani","year":"2017","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I (2017) Attention is all you need. Proc Adv Neural Inf Proc Syst 30:5998\u20136008","journal-title":"Proc Adv Neural Inf Proc Syst"},{"issue":"11","key":"230_CR18","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 (1998) Gradient-based learning applied to document recognition. Proc IEEE 86(11):2278\u20132324","journal-title":"Proc IEEE"},{"unstructured":"Bordes A, Usunier N, Garc\u00eda-Dur\u00e1n A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems 2013, pp. 2787\u20132795","key":"230_CR19"},{"doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 1112\u20131119","key":"230_CR20","DOI":"10.1609\/aaai.v28i1.8870"},{"doi-asserted-by":"crossref","unstructured":"Qian W, Fu C, Zhu Y, Cai D, He X (2018) Translating embeddings for knowledge graph completion with relation attention mechanism. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 4286\u20134292","key":"230_CR21","DOI":"10.24963\/ijcai.2018\/596"},{"doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence,, pp. 1811\u20131818","key":"230_CR22","DOI":"10.1609\/aaai.v32i1.11573"},{"unstructured":"Nickel M, Tresp V, Kriegel H (2011) A three-way model for collective learning on multi-relational data. In: Proceedings of the 28th International Conference on Machine Learning, pp. 809\u2013816","key":"230_CR23"},{"unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier \u00c9, Bouchard G (2016) Complex embeddings for simple link prediction. In: Proceedings of the 33nd International Conference on Machine Learning, pp. 2071\u20132080","key":"230_CR24"},{"unstructured":"Teru KK, Denis EG, Hamilton WL (2020) Inductive relation prediction by subgraph reasoning. In: Proceedings of the 37th International Conference on Machine Learning, pp. 9448\u20139457","key":"230_CR25"},{"doi-asserted-by":"crossref","unstructured":"Chen J, He H, Wu F, Wang J (2021) Topology-aware correlations between relations for inductive link prediction in knowledge graphs. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, pp. 6271\u20136278","key":"230_CR26","DOI":"10.1609\/aaai.v35i7.16779"},{"key":"230_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110124","volume":"260","author":"P Baghershahi","year":"2023","unstructured":"Baghershahi P, Hosseini R, Moradi H (2023) Self-attention presents low-dimensional knowledge graph embeddings for link prediction. Knowl Based Syst 260:110124","journal-title":"Knowl Based Syst"},{"doi-asserted-by":"crossref","unstructured":"Chen M, Zhang W, Zhang W, Chen Q, Chen H (2019) Meta relational learning for few-shot link prediction in knowledge graphs. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, pp. 4216\u20134225","key":"230_CR28","DOI":"10.18653\/v1\/D19-1431"},{"doi-asserted-by":"crossref","unstructured":"Li Z, Geng P, Cao S, Hu B (2022) Few-shot knowledge graph completion based on data enhancement. In: Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, pp. 1607\u20131611","key":"230_CR29","DOI":"10.1109\/BIBM55620.2022.9995024"},{"doi-asserted-by":"crossref","unstructured":"Wu H, Yin J, Rajaratnam B, Guo J (2023) Hierarchical relational learning for few-shot knowledge graph completion. In: International Conference on Learning Representation","key":"230_CR30","DOI":"10.1145\/3570236.3570238"},{"doi-asserted-by":"crossref","unstructured":"Li Y, Yu K, Zhang Y, Wu X (2022) Learning relation-specific representations for few-shot knowledge graph completion. CoRR abs\/2203.11639","key":"230_CR31","DOI":"10.18653\/v1\/2022.emnlp-main.524"},{"key":"230_CR32","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1971","unstructured":"Feller W (1971) An Introduction to Probability Theory and Its Applications. Wiley, Newyork"},{"key":"230_CR33","first-page":"1237","volume":"16","author":"S Rosset","year":"2003","unstructured":"Rosset S, Zhu J, Hastie T (2003) Margin maximizing loss functions. Proc Adv Neural Inf Proc Syst 16:1237\u20131244","journal-title":"Proc Adv Neural Inf Proc Syst"},{"doi-asserted-by":"crossref","unstructured":"Han X,Cao S, Lv X, Lin Y, Liu Z, Sun M, Li J (2018) Openke: An open toolkit for knowledge embedding. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pp. 139\u2013144","key":"230_CR34","DOI":"10.18653\/v1\/D18-2024"},{"unstructured":"Kingma DP, Ba J (2015) Adam: A method for stochastic optimization. In: Proceedings of the 3rd International Conference on Learning Representations","key":"230_CR35"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00230-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-023-00230-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00230-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T03:57:49Z","timestamp":1696996669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-023-00230-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,20]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s41019-023-00230-x","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2023,9,20]]},"assertion":[{"value":"18 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2023","order":4,"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 that they have no known competing Financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval."}},{"value":"All authors have read and agreed to the published version of the manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication."}}]}}