UM  > Faculty of Science and Technology
Residential Collegefalse
Status已發表Published
Robust Link Prediction over Noisy Hyper-Relational Knowledge Graphs via Active Learning
Yu, Weijian1; Yang, Jie2; Yang, Dingqi1
2024-05-13
Conference NameTheWebConf: The 33rd ACM Web Conference
Source PublicationWWW '24: Proceedings of the ACM Web Conference 2024
Pages2282-2293
Conference Date13 May 2024through 17 May 2024
Conference PlaceSingapore
CountrySingapore
Publication PlaceNew York, NY, United States
PublisherAssociation for Computing Machinery, Inc
Abstract

Modern Knowledge Graphs (KGs) are inevitably noisy due to the nature of their construction process. Existing robust learning techniques for noisy KGs mostly focus on triple facts, where the fact-wise confidence is straightforward to evaluate. However, hyper-relational facts, where an arbitrary number of key-value pairs are associated with a base triplet, have become increasingly popular in modern KGs, but significantly complicate the confidence assessment of the fact. Against this background, we study the problem of robust link prediction over noisy hyper-relational KGs, and propose NYLON, a \underlineN oise-resistant h\underlineY per-re\underlineL ati\underlineON al link prediction technique via active crowd learning. Specifically, beyond the traditional fact-wise confidence, we first introduce element-wise confidence measuring the fine-grained confidence of each entity or relation of a hyper-relational fact. We connect the element- and fact-wise confidences via a "least confidence'' principle to allow efficient crowd labeling. NYLON is then designed to systematically integrate three key components, where a hyper-relational link predictor uses the fact-wise confidence for robust prediction, a cross-grained confidence evaluator predicts both element- and fact-wise confidences, and an effort-efficient active labeler selects informative facts for crowd annotators to label using an efficient labeling mechanism guided by the element-wise confidence under the "least confidence'' principle and further followed by data augmentation. We evaluate NYLON on three real-world KG datasets against a sizeable collection of baselines. Results show that NYLON achieves superior and robust performance in both link prediction and error detection tasks on noisy KGs, and outperforms best baselines by 2.42-10.93% and 3.46-10.65% in the two tasks, respectively.

KeywordHyper-relation Link Prediction Noisy Knowledge Graph
DOI10.1145/3589334.3645686
URLView the original
Language英語English
Scopus ID2-s2.0-85194056233
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionFaculty of Science and Technology
THE STATE KEY LABORATORY OF INTERNET OF THINGS FOR SMART CITY (UNIVERSITY OF MACAU)
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Corresponding AuthorYang, Dingqi
Affiliation1.State Key Laboratory of Internet of Things for Smart City, Department of Computer and Information Science, University of Macau, Macao
2.Delft University of Technology, Delft, Netherlands
First Author AffilicationUniversity of Macau
Corresponding Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Yu, Weijian,Yang, Jie,Yang, Dingqi. Robust Link Prediction over Noisy Hyper-Relational Knowledge Graphs via Active Learning[C], New York, NY, United States:Association for Computing Machinery, Inc, 2024, 2282-2293.
APA Yu, Weijian., Yang, Jie., & Yang, Dingqi (2024). Robust Link Prediction over Noisy Hyper-Relational Knowledge Graphs via Active Learning. WWW '24: Proceedings of the ACM Web Conference 2024, 2282-2293.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yu, Weijian]'s Articles
[Yang, Jie]'s Articles
[Yang, Dingqi]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yu, Weijian]'s Articles
[Yang, Jie]'s Articles
[Yang, Dingqi]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yu, Weijian]'s Articles
[Yang, Jie]'s Articles
[Yang, Dingqi]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.