The results indicate that the proposed framework effectively enhances the quality and structural consistency of generated hyper-relational data while mitigating the effects of long-tail distributions and pseudo-negative samples without requiring additional manual annotations.
Abstract
Hyper-relational extraction aims to identify complex factual structures from unstructured text, where each instance consists of a core triplet and multiple qualified attributes. However, existing hyper-relational datasets often suffer from long-tail relation distributions and pseudo-negative samples, which limit the performance of hyper-relational extraction models. Although large language models (LLMs) provide new opportunities for data augmentation, they may introduce semantically inconsistent relations and structurally unreliable samples in complex scenarios, reducing the quality of generated data. To address these challenges, this paper proposes a structure-consistency-driven semi-automatic data augmentation framework, termed HRE-LSC. The framework consists of two key components: (1) a distribution-aware generation strategy that selectively generates samples for low-frequency relations according to relation frequency distributions, thereby alleviating data imbalance; and (2) a hierarchical logical consistency verification mechanism based on natural language inference (NLI), which progressively verifies the consistency of core triplets and qualified attributes to filter unreliable generated samples and reduce pseudo-negative samples. Experiments on the HyperRED dataset demonstrate that the proposed method improves the F1 score of Text2NKG from 83.81% to 84.7%, with more significant improvements observed on long-tail relation subsets. The results indicate that the proposed framework effectively enhances the quality and structural consistency of generated hyper-relational data while mitigating the effects of long-tail distributions and pseudo-negative samples without requiring additional manual annotations.
Document-level relation extraction (DocRE) aims to extract relations among multiple entities across extended contexts while maintaining consistency across predicted triples. Although large language models (LLMs) show remarkable reasoning capabilities in information extraction, their predictions are typically generated...
A preliminary version of a framework that improves the most widespread DLA datasets quality by assessing and correcting layout coherence in scholarly documents and provides a more reliable ground truth with improved structural and semantic coherence for training and evaluating document segmentation and understanding mo...
Results indicate that integrating multi-source domain knowledge with relation-preserved retrieval and attribute-supported filtering provides more focused and inspectable evidence, thereby supporting more accurate complex material question answering.
Peize Li, Xi Guo, Nan Yin et al.· Electronics· 0 citations
Relational databases (RDBs) play an essential role in real-world scenarios, such as e-commerce, social media, and industry. Recently, with the rapid development of Large Language Models (LLMs), using LLMs to exploit RDBs has become a significant trend. Plenty of works have been proposed to use natural language to descr...
Yujie Tian, Kun Zhang, Qiuyuan Li et al.· Proceedings of the 32nd ACM...· 0 citations
An end-to-end information extraction framework based on the Dynamically Tokenized Relation Transformer (DTRT), which can dynamically reduce received image to-kens, filter redundant information, and efficiently extract structural knowledge to construct hyper-relational knowledge graphs is proposed.
Tianyou Bai, Yan-Ming Zhang, Zi-Xiang Zhang et al.· 0 citations
This work introduces a trust based adaptive reranking model- ATM (Adaptive Trust Model) that allocates computational resources according to file level uncertainty, instead of assigning a fixed number of reranker calls per query, which focuses computation only where ranking confidence is low.
Jenny Kalaiarasi.S· Journal of Intelligent Decis...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.