{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:32Z","timestamp":1742914172242,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811912528"},{"type":"electronic","value":"9789811912535"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-1253-5_10","type":"book-chapter","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T17:03:29Z","timestamp":1648055009000},"page":"132-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Chinese Dataset Building Method Based on Data Hierarchy and Balance Analysis in Knowledge Graph Completion"],"prefix":"10.1007","author":[{"given":"Yunwei","family":"Shi","sequence":"first","affiliation":[]},{"given":"Kuangrong","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Xuesong","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/3397512","volume":"64","author":"P Hitzler","year":"2021","unstructured":"Hitzler, P.: A review of the semantic web field. Commun. ACM 64(2), 76\u201383 (2021)","journal-title":"Commun. ACM"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"489","DOI":"10.3233\/SW-160218","volume":"8","author":"H Paulheim","year":"2017","unstructured":"Paulheim, H.: Knowledge graph refinement: a survey of approaches and evaluation methods. Semant. Web 8(3), 489\u2013508 (2017)","journal-title":"Semant. Web"},{"key":"10_CR3","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., et al.: Translating embeddings for modeling multi-relational data. In: Advances in Neural Information Processing Systems, pp. 2787\u20132795 (2013)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Lin, Y., Liu, Z., Sun, M., Liu, Y., Zhu, X.: Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29, no. 1, February 2015","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ji, G., Liu, K., He, S., Zhao, J.: Knowledge graph completion with adaptive sparse transfer matrix. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), pp. 985\u2013991. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10089"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"He, S., Liu, K., Ji, G., et al.: Learning to represent knowledge graphs with Gaussian embedding. In: Proceedings of the CIKM, pp. 623\u2013632. ACM, New York (2015)","DOI":"10.1145\/2806416.2806502"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Balazevic, I., Allen, C., Hospedales, T.M.: TuckER: tensor factorization for knowledge graph completion. arXiv:1901.09590 (2019). n. pag","DOI":"10.18653\/v1\/D19-1522"},{"key":"10_CR8","unstructured":"Sun, Z., Deng, Z., Nie, J., Tang, J.: RotatE: knowledge graph embedding by relational rotation in complex space. arXiv:1902.10197 (2019)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Shang, C., Tang, Y., Huang, J., Bi, J., He X., Zhou, B.: End-to-end structure-aware convolutional networks for knowledge base completion. arXiv:1811.04441 (2019). n. pag","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:1712.02121 (2017)","DOI":"10.18653\/v1\/N18-2053"},{"key":"10_CR11","unstructured":"Nguyen, D.Q., Vu, T., Dinh Nguyen, T., Phung, D.: A capsule network-based embedding model for search personalization. arXiv e-prints, arXiv-1804 (2018)"},{"key":"10_CR12","unstructured":"Santoro, A., et al.: Relational recurrent neural networks. arXiv:1806.01822 (2018)"},{"issue":"9","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Chen, D., Fisch, A., Weston, J., Bordes, A.: Reading wikipedia to answer open-domain questions. arXiv preprint arXiv:1704.00051 (2017)","DOI":"10.18653\/v1\/P17-1171"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Akrami, F., Saeef, M.S., Zhang, Q., Hu, W., Li, C.: Realistic re-evaluation of knowledge graph completion methods: an experimental study. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 1995\u20132010, June 2020","DOI":"10.1145\/3318464.3380599"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Chami, I., Wolf, A., Juan, D.C., Sala, F., Ravi, S., R\u00e9, C:. Low-dimensional hyperbolic knowledge graph embeddings. arXiv preprint arXiv:2005.00545 (2020)","DOI":"10.18653\/v1\/2020.acl-main.617"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Xu, B., et al.: CN-DBpedia: a never-ending chinese knowledge extraction system. In: Benferhat, S., Tabia, K., Ali, M. (eds.) IEA\/AIE 2017. LNCS, vol. 10351, pp. 428\u2013438. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60045-1_44","DOI":"10.1007\/978-3-319-60045-1_44"},{"issue":"9","key":"10_CR18","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.3390\/su10093245","volume":"10","author":"T Wu","year":"2018","unstructured":"Wu, T., Qi, G., Li, C., Wang, M.: A survey of techniques for constructing Chinese knowledge graphs and their applications. Sustainability 10(9), 3245 (2018)","journal-title":"Sustainability"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-1253-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T22:01:03Z","timestamp":1675029663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-1253-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811912528","9789811912535"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-1253-5_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.bicta.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":"211","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":"67","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":"32% - 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":"4","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)"}}]}}