Context-aware Outstanding Fact Mining from Knowledge Graphs
Yueji Yang, Yuchen Li, Panagiotis Karras, Anthony K. H. Tung
摘要
An Outstanding Fact (OF) is an attribute that makes a target entity stand out from its peers. The mining of OFs has important applications, especially in Computational Journalism, such as news promotion, fact-checking, and news story finding. However, existing approaches to OF mining: (i) disregard the context in which the target entity appears, hence may report facts irrelevant to that context; and (ii) require relational data, which are often unavailable or incomplete in many application domains. In this paper, we introduce the novel problem of mining Context-aware Outstanding Facts (COFs) for a target entity under a given context specified by a context entity. We propose FMiner, a context-aware mining framework that leverages knowledge graphs (KGs) for COF mining. FMiner generates COFs in two steps. First, it discovers top-k relevant relationships between the target and the context entity from a KG. We propose novel optimizations and pruning techniques to expedite this operation, as this process is very expensive on large KGs due to its exponential complexity. Second, for each derived relationship, we find the attributes of the target entity that distinguish it from peer entities that have the same relationship with the context entity, yielding the top-l COFs. As such, the mining process is modeled as a top-(k,l) search problem. Context-awareness is ensured by relying on the relevant relationships with the context entity to derive peer entities for COF extraction. Consequently, FMiner can effectively navigate the search to obtain context-aware OFs by incorporating a context entity. We conduct extensive experiments, including a user study, to validate the efficiency and the effectiveness of FMiner.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- BABOONS: Black-Box Optimization of Data Summaries in Natural LanguageImmanuel TrummerVLDB 2022 · 被引用 5 次
- How to Avoid Jumping to Conclusions: Measuring the Robustness of Outstanding Facts in Knowledge GraphsHanhua Xiao, Yuchen Li, Yanhao Wang, Panagiotis Karras 等KDD 2024
它引用的顶会 Paper1
相关 Paper
- Fast Core-based Top-k Frequent Pattern Discovery in Knowledge GraphsJian Zeng, Leong Hou U, Xiao Yan, Mingji Han 等ICDE 2021 · 被引用 11 次
- A Good Neighbor, A Found Treasure: Mining Treasured Neighbors for Knowledge Graph Entity TypingZhuoran Jin, Pengfei Cao, Yubo Chen, Kang Liu 等EMNLP 2022 · 被引用 6 次
- Direct Fact Retrieval from Knowledge Graphs without Entity LinkingJinheon Baek, Alham Fikri Aji, Jens Lehmann, Sung Ju HwangACL 2023 · 被引用 9 次
- Benchmark and Neural Architecture for Conversational Entity Retrieval from a Knowledge GraphMona Zamiri, Yao Qiang, Fedor Nikolaev, Dongxiao Zhu 等WWW 2024 · 被引用 6 次
- KAN: Knowledge-aware Attention Network for Fake News DetectionYaqian Dun, Kefei Tu, Chen Chen, Chunyan Hou 等AAAI 2021 · 被引用 142 次
