Glossary
Knowledge-base population
Knowledge-base population adds candidate entities, attributes and relations to a structured body of knowledge.
Knowledge fusion
Knowledge-base population is the task of adding assertions to a structured collection of entities and relationships. Candidate assertions can come from documents, curated datasets or other records. The task includes identifying what the text or data says, mapping it to the knowledge base's vocabulary and deciding whether it belongs there. A populated entry is only as trustworthy as those steps and its retained evidence.
A practical workflow may discover a new organization, connect it to an existing identifier and attach a reported status. The candidate must be checked against existing entities to avoid duplicates. A statement that appears novel may instead correct, qualify or contradict an existing one. Evaluation therefore examines both extraction accuracy and whether the target representation preserves source meaning.
Organizations that rely on a knowledge base need to distinguish accepted assertions from unreviewed candidates. Without that boundary, scale of population can be mistaken for quality. Information extraction proposes statements from material; entity resolution anchors their subjects; schema alignment maps their predicates; provenance lets a reviewer inspect why any particular assertion was admitted.
Example
A Halden Therapeutics AG (fictional) report names a fictional subsidiary; the relationship is a candidate until its wording and entity identity are checked.
The task and its evaluation tradition
Knowledge-base population is the task of adding entities, attributes and relations to an existing structured knowledge base from unstructured or semi-structured sources. It became a named research task through the knowledge base population tracks of the Text Analysis Conference, organised by NIST, where systems were given a reference knowledge base and a corpus and were scored on the entries they added. The survey by Ji and Grishman (2011) describes the sub-tasks that emerged: finding and disambiguating the entities mentioned, filling the attributes of those entities from text, and determining when a mention denotes something not yet in the base.
Two design families are visible in the literature. Pipeline systems run information extraction, then entity disambiguation, then a decision about whether to add each candidate. Continuous systems such as NELL, the Never-Ending Language Learner, read the web repeatedly and use what they have already learned to extract more, while Knowledge Vault combines several extractors with prior knowledge to assign each candidate fact a probability. The difference matters operationally: a continuous system needs a policy for retracting facts that later evidence contradicts.
What separates a candidate from an accepted statement
Extraction produces candidates, and population is the decision to admit them. A defensible admission rule names the evidence required: how many independent sources, from which classes of source, with what extractor confidence, and with what checks against the existing content. A candidate that conflicts with a stored statement is not an update until the conflict has been assessed under the rules for data conflict. A candidate about an entity that cannot be matched to a stored entity with sufficient confidence is held as a possible new entity and not attached to the nearest neighbour.
Each admitted statement should keep its evidence span, the date it was read and the identity of the extractor version, so that a later improvement or a discovered defect in the extractor can be followed to the statements it produced. The article on data extraction error analysis shows how to attribute an error to the source or to the extractor, which determines whether the fix is a source rule or an extractor change.
A worked example
A knowledge base holds an entry for Halden Therapeutics AG (fictional), with a registry number and a headquarters. A new press release says the company has appointed a new chief medical officer. Population has three steps. The extractor proposes a candidate relation between the company and a named person, with the sentence as evidence. The disambiguation step checks that the person is not already in the base under another spelling, and finds no match above its threshold. The admission rule requires a corroborating source of a different lineage for relations of this kind, so the candidate is stored as pending, with its evidence, until a second source appears. If the second source never appears, the pending candidate expires and the base stays unchanged, which is a better outcome than an unverified appointment shown as fact.
Related terms and boundaries
Population is distinct from schema alignment, which maps incoming fields to the base's vocabulary, and from knowledge fusion, which reconciles statements from many sources once they are in comparable form. It feeds a knowledge graph and depends on an ontology to say which relations are admissible. Its characteristic risk is silent accumulation of unverified statements, which is controlled by the admission rule and by periodic audit of a sample against source.
Checks a reviewer can run
Ask for the admission rule and the count of candidates admitted, held and rejected in the last period. Sample admitted statements and check each against its evidence span. Ask what happens to a candidate that never gains corroboration. Ask which extractor version produced each statement and whether the statements from a faulty version can be listed.
Common misreadings
- Publishing extracted candidates as settled facts.
- Creating duplicate entities for spelling variants.
- Losing the sentence that supported a relation.
References
- Ji et al. (2021), A Survey on Knowledge Graphs: Representation, Acquisition, and Applications, IEEE Transactions on Neural Networks and Learning Systems.
- Ji and Grishman (2011), Knowledge Base Population: Successful Approaches and Challenges, ACL.
- Mitchell et al. (2015), Never-Ending Learning, AAAI.
- NIST, Text Analysis Conference (TAC), Knowledge Base Population evaluations.
- Dong et al. (2014), Knowledge Vault: A Web-Scale Approach to Probabilistic Knowledge Fusion, KDD.
Found an error on this page? See corrections for what counts as one, how to report it and the dated log.
Enquiry
Where does "Knowledge-base population" bear on a decision of yours?
This entry sits under knowledge fusion. If a decision in your organization turns on it, send the entity concerned, the sources you fuse to describe it and who may read which of them. We reply with what a first record would cover.
Or write to [email protected] in your own words.