{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:51:27Z","timestamp":1772319087707,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"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_41","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:10:49Z","timestamp":1681384249000},"page":"606-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["AIR: Adaptive Incremental Embedding Updating for\u00a0Dynamic Knowledge Graphs"],"prefix":"10.1007","author":[{"given":"Zhifeng","family":"Jia","sequence":"first","affiliation":[]},{"given":"Haoyang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: Dbpedia: a nucleus for a web of open data (2007)","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Bojchevski, A.: Scaling graph neural networks with approximate pagerank. In: KDD (2020)","DOI":"10.1145\/3394486.3403296"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Bollacker: Freebase: a collaboratively created graph database for structuring human knowledge. Association for Computing Machinery (2008)","DOI":"10.1145\/1376616.1376746"},{"key":"41_CR4","unstructured":"Bordes, A.: Translating embeddings for modeling multi-relational data (2013)"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y.: Attentive knowledge-aware graph convolutional networks with collaborative guidance for personalized recommendation. In: ICDE (2022)","DOI":"10.1109\/ICDE53745.2022.00027"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A.: Edge betweenness centrality: a novel algorithm for QoS-based topology control over wireless sensor networks. J. NCA (2012)","DOI":"10.1016\/j.jnca.2011.06.001"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Dettmers, T.: Convolutional 2d knowledge graph embeddings (2018)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"41_CR8","unstructured":"Gallo, D.: Personalized page rank on knowledge graphs: particle filtering is all you need! Advances in Database Technology-EDBT 2020 (2020)"},{"key":"41_CR9","unstructured":"Gallo, D., Lissandrini, M., Velegrakis, Y.: Personalized page rank on knowledge graphs: Particle filtering is all you need! In: EDBT 2020, Copenhagen, Denmark, March 30 - April 02, 2020 (2020)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Guttoski: Kruskal\u2019s algorithm for query tree optimization. In: IDEAS (2007)","DOI":"10.1109\/IDEAS.2007.4318118"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Jin, W.: Recurrent event network: autoregressive structure inference over temporal knowledge graphs (2019)","DOI":"10.18653\/v1\/2020.emnlp-main.541"},{"key":"41_CR12","unstructured":"Lassila, O., Swick, R.R., et al.: Resource description framework (RDF) model and syntax specification (1998)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Li, H., Chen, L.: Cache-based GNN system for dynamic graphs. In: CIKM, pp. 937\u2013946 (2021)","DOI":"10.1145\/3459637.3482237"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-030-73194-6_24","volume-title":"Database Systems for Advanced Applications","author":"H Li","year":"2021","unstructured":"Li, H., Lin, X., Chen, L.: Fine-grained entity typing via label noise reduction and data augmentation. In: Jensen, C.S., et al. (eds.) DASFAA 2021. LNCS, vol. 12681, pp. 356\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73194-6_24"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Li, Z.: Temporal knowledge graph reasoning based on evolutional representation learning. In: Proceedings of the 44th International ACM SIGIR (2021)","DOI":"10.1145\/3404835.3462963"},{"issue":"7","key":"41_CR16","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.14778\/3384345.3384352","volume":"13","author":"X Lin","year":"2020","unstructured":"Lin, X., Li, H., Xin, H., Li, Z., Chen, L.: Kbpearl: a knowledge base population system supported by joint entity and relation linking. Proc. VLDB Endowment 13(7), 1035\u20131049 (2020)","journal-title":"Proc. VLDB Endowment"},{"key":"41_CR17","unstructured":"Liu, Q.: Probabilistic reasoning via deep learning: Neural association models. arXiv preprint arXiv:1603.07704 (2016)"},{"key":"41_CR18","unstructured":"Sadeghian, A.: Drum: End-to-end differentiable rule mining on knowledge graphs. In: Advances in Neural Information Processing Systems (2019)"},{"key":"41_CR19","unstructured":"Schlichtkrull, M.: Modeling relational data with graph convolutional networks"},{"key":"41_CR20","unstructured":"Socher, R.: Reasoning with neural tensor networks for knowledge base completion. In: Advances in Neural Information Processing Systems (2013)"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M.: Yago: A core of semantic knowledge. In: WWW (2007)","DOI":"10.1145\/1242572.1242667"},{"key":"41_CR22","unstructured":"Vashishth, S.: Composition-based multi-relational graph convolutional networks"},{"issue":"10","key":"41_CR23","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107, D., Kr\u00f6tzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78\u201385 (2014)","journal-title":"Commun. ACM"},{"key":"41_CR24","first-page":"2724","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q.: Knowledge graph embedding: a survey of approaches and applications. IEEE TKDE 29, 2724\u20132743 (2017)","journal-title":"IEEE TKDE"},{"key":"41_CR25","doi-asserted-by":"crossref","unstructured":"Wang, X.: KGAT: knowledge graph attention network for recommendation. In: Proceedings of the 25th ACM SIGKDD (2019)","DOI":"10.1145\/3292500.3330989"},{"issue":"1","key":"41_CR26","first-page":"267","volume":"21","author":"MD Ward","year":"2013","unstructured":"Ward, M.D., Beger, A., Cutler, J., Dickenson, M., Dorff, C., Radford, B.: Comparing GDELT and ICEWS event data. Analysis 21(1), 267\u2013297 (2013)","journal-title":"Analysis"},{"key":"41_CR27","doi-asserted-by":"crossref","unstructured":"Wu, J.: Tie: A framework for embedding-based incremental temporal knowledge graph completion. In: 44th International ACM SIGIR (2021)","DOI":"10.1145\/3404835.3462961"},{"key":"41_CR28","unstructured":"Xu, K.: Representation learning on graphs with jumping knowledge networks. In: PMLR (2018)"},{"key":"41_CR29","unstructured":"Yang, B.: Embedding entities and relations for learning and inference in knowledge bases (2015)"},{"key":"41_CR30","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.14778\/3236187.3236192","volume":"11","author":"W Zheng","year":"2018","unstructured":"Zheng, W.: Question answering over knowledge graphs: question understanding via template decomposition. Proc, VLDB Endow 11, 1373\u20131386 (2018)","journal-title":"Proc, VLDB Endow"},{"key":"41_CR31","doi-asserted-by":"crossref","unstructured":"Zhu, C.: Learning from history: modeling temporal knowledge graphs with sequential copy-generation networks. In: Proceedings of the AAAI (2021)","DOI":"10.1609\/aaai.v35i5.16604"}],"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_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:31:42Z","timestamp":1710264702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30672-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306716","9783031306723"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30672-3_41","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)"}}]}}