|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||Analysing the Evolution of Knowledge Graphs for the Purpose of Change Verification|
|Citation:||Nishioka C & Scherp A (2018) Analysing the Evolution of Knowledge Graphs for the Purpose of Change Verification. In: 2018 IEEE 12th International Conference on Semantic Computing (ICSC)volume 2018-January. 12th International Conference on Semantic Computing (ICSC), Laguna Hills, CA, USA, 31.01.2018-02.02.2018. Piscataway, NJ, USA: Institute of Electrical and Electronics Engineers, pp. 25-32. https://doi.org/10.1109/ICSC.2018.00013|
|Conference Name:||12th International Conference on Semantic Computing (ICSC)|
|Conference Dates:||2018-01-31 - 2018-02-02|
|Conference Location:||Laguna Hills, CA, USA|
|Abstract:||Knowledge graphs (KGs) are a core component of many web-based applications. KGs store information about entities such as persons and organisations. A central challenge is to keep KGs up-to-date while the entities in the real world continuously change. While the majority of the changes are correct, the KGs still receive erroneous changes due to vandalism and carelessness. Thus, change verification is required to ensure a quality of the information stored in the KG. Since manual change verification is labour intensive, different works have dealt with automatic change verification in the past. However, these works have not shed light on the evolutionary patterns of the KGs. Since the analysis of the evolution of social networks has contributed to link prediction between persons, we assume that the evolutionary patterns of KGs can contribute to the task of change verification. In this paper, we analyse the evolution of a KG, focusing on its topological features such as degree. The analysis reveals that the evolutionary patterns are similar to those of social networks. Subsequently, we develop classifiers that judge whether each incoming change is correct or incorrect. In the classifiers, we use a set of novel features, which originate from topological features of the KG. Finally, our experiments demonstrate that the novel features improve the verification performance. The results of this paper can contribute to making the KG editing process more efficient and reliable.|
|Status:||VoR - Version of Record|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Nishioka-Scherp 2018.pdf||Fulltext - Published Version||978.32 kB||Adobe PDF||Under Permanent Embargo Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.