Semi-Supervised Relation Mention Recognition Algorithm

From GM-RKB

Revision as of 22:40, 23 March 2021 by Gmelli (talk | contribs) (Text replacement - "** ..." to "** …")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

A Semi-Supervised Relation Mention Recognition Algorithm is a Relation Mention Recognition Algorithm that is a Semi-Supervised Learning Algorithm.

Example(s):
- Snowball Algorithm.
- …
Counter-Example(s):
- a Fully-Supervised Relation Mention Recognition Algorithm.
- an Unsupervised Relation Mention Recognition Algorithm.
See: Pattern-based Semantic Relation Mention Recognition Algorithm.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Semi-Supervised_Relation_Mention_Recognition_Algorithm&oldid=669079"

Concept