Reasoning with classifiers

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Research in machine learning concentrates on the study of learning single concepts from examples. In this framework the learner attempts to learn a single hidden function from a collection of examples, assumed to be drawn independently from some unknown probability distribution. However,in many cases - as in most natural language and visual processing situations - decisions depend on the outcomes of several different but mutually dependent classifiers. The classifiers’ outcomes need to respect some constraints that could arise from the sequential nature of the data or other domain specific conditions,th us requiring a level of inference on top the predictions. We will describe research and present challenges related to Inference with Classifiers - a paradigm in which we address the problem of using the outcomes of several different classifiers in making coherent inferences - those that respect constraints on the outcome of the classifiers. Examples will be given from the natural language domain.

Cite

CITATION STYLE

APA

Roth, D. (2002). Reasoning with classifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2430, pp. 506–510). Springer Verlag. https://doi.org/10.1007/3-540-36755-1_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free