Binary Text Classification Task
(Redirected from Binary Text Classification)
Jump to navigation
Jump to search
A Binary Text Classification Task is a Text Classification Task that is binary classification task.
- Context:
- It can be solved by a Binary Text Classification System (that implements a Binary Text Classification Algorithm).
- It can range from being a Heuristic Binary Text Classification Task to being a Data-Driven Binary Text Classification Task.
- Counter-Example(s):
- See: Supervised Binary Text Classification Task, Unsupervised Binary Text Classification Task.
References
1999
- (McCallum, 1999) ⇒ Andrew McCallum. (1999). “Multi-label Text Classification with a Mixture Model Trained by EM.” In: AAAI 99 Workshop on Text Learning.
- QUOTE: In many important document classification tasks, documents may each be associated with multiple class labels. … Text classification is the problem of assigning a text document into one or more topic categories or classes. In multiclass document classification, as distinguished from binary document classification, there are more than two classes. In multi-label classification each document may have more than one class label. For example, given classes N. America, S. America, Europe, Asia and Australia, a news article about U.S. troops in Bosnia may be labeled with both the N. America and Europe classes.