REVIEW 3 cited by
Automated Construction of Theme-specific Knowledge Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Despite widespread applications of knowledge graphs (KGs) in various tasks such as question answering and intelligent conversational systems, existing KGs face two major challenges: information granularity and deficiency in timeliness. These hinder considerably the retrieval and analysis of in-context, fine-grained, and up-to-date knowledge from KGs, particularly in highly specialized themes (e.g., specialized scientific research) and rapidly evolving contexts (e.g., breaking news or disaster tracking). To tackle such challenges, we propose a theme-specific knowledge graph (i.e., ThemeKG), a KG constructed from a theme-specific corpus, and design an unsupervised framework for ThemeKG construction (named TKGCon). The framework takes raw theme-specific corpus and generates a high-quality KG that includes salient entities and relations under the theme. Specifically, we start with an entity ontology of the theme from Wikipedia, based on which we then generate candidate relations by Large Language Models (LLMs) to construct a relation ontology. To parse the documents from the theme corpus, we first map the extracted entity pairs to the ontology and retrieve the candidate relations. Finally, we incorporate the context and ontology to consolidate the relations for entity pairs. We observe that directly prompting GPT-4 for theme-specific KG leads to inaccurate entities (such as "two main types" as one entity in the query result) and unclear (such as "is", "has") or wrong relations (such as "have due to", "to start"). In contrast, by constructing the theme-specific KG step by step, our model outperforms GPT-4 and could consistently identify accurate entities and relations. Experimental results also show that our framework excels in evaluations compared with various KG construction baselines.
Forward citations
Cited by 3 Pith papers
-
Slides2MindMap: Reconstructing Cognitively Efficient Knowledge Hierarchies from Lecture Slides
An agentic pipeline called AutoMindMap reconstructs course-level mind maps from lecture slides and beats document-hierarchy baselines on a new 24-course benchmark.
-
LKD-KGC: Domain-Specific KG Construction via LLM-driven Knowledge Dependency Parsing
An LLM pipeline that orders documents by knowledge dependency, builds an entity schema from summaries, and extracts triples beats prior unsupervised KG construction baselines on three domain corpora.
-
MedKGent: A Large Language Model Agent Framework for Constructing Temporally Evolving Medical Knowledge Graph
A submission whose abstract describes a large temporal medical knowledge graph built by LLM agents, but whose full text is an unrelated paper on histogram regression, leaving the announced claims unsupported.
Discussion (0). Continue with ORCID to comment.