Labeling Heuristic

From GM-RKB
Jump to navigation Jump to search

A Labeling Heuristic is a heuristic that can convert an unlabeled example to a labeled example (a weakly labeled example).



References

2012

2008

2003

  • (Pinto et al., 2003) ⇒ David Pinto, Andrew McCallum, Xing Wei, and W. Bruce Croft. (2003). “Table Extraction Using Conditional Random Fields.” In: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2003). doi:10.1145/860435.860479
    • QUOTE: … A simple heuristic program was run to make an educated guess for a label for each line. Human judgment was then employed to correct mistakes in the heuristic labeling. …