Transduction (machine learning)
- Transduction (machine learning)
In logic, statistical inference, and supervised learning,transduction or transductive inference is reasoning fromobserved, specific (training) cases to specific (test) cases. In contrast,
induction is reasoning from observed training casesto general rules, which are then applied to the test cases. The distinction ismost interesting in cases where the predictions of the transductive model arenot achievable by any inductive model. Note that this is caused by transductiveinference on different test sets producing mutually inconsistent predictions.
Transduction was introduced by Vladimir Vapnik in the 1990's, motivated byhis view that transduction is preferable to induction since, according to him, induction requiressolving a more general problem (inferring a function) before solving a morespecific problem (computing outputs for new cases): "When solving a problem ofinterest, do not solve a more general problem as an intermediate step. Try toget the answer that you really need but not a more general one."
An example of learning which is not inductive would be in the case of binaryclassification, where the inputs tend to cluster in two groups. A large set oftest inputs may help in finding the clusters, thus providing useful informationabout the classification labels. The same predictions would not be obtainablefrom a model which induces a function based only on the training cases. Somepeople may call this an example of the closely related semi-supervised learning, since Vapnik's motivation is quite different. An example of an algorithm in this category is the Transductive Support Vector Machine (TSVM).
A third possible motivation which leads to transduction arises through the needto approximate. If exact inference is computationally prohibitive, one may atleast try to make sure that the approximations are good at the test inputs. Inthis case, the test inputs could come from an arbitrary distribution (notnecessarily related to the distribution of the training inputs), which wouldn'tbe allowed in semi-supervised learning. An example of an algorithm falling inthis category is the Bayesian Committee Machine (BCM).
References
* V. N. Vapnik. "Statistical learning theory". New York: Wiley, 1998. "(See pages 339-371)"
* V. Tresp. "A Bayesian committee machine", Neural Computation, 12, 2000, [http://www.tresp.org/papers/bcm6.pdf pdf] .
Wikimedia Foundation.
2010.
Look at other dictionaries:
Machine learning — is a subfield of artificial intelligence that is concerned with the design and development of algorithms and techniques that allow computers to learn . In general, there are two types of learning: inductive, and deductive. Inductive machine… … Wikipedia
Transduction — has different meanings in different fields: * Transduction (biophysics) is the conveyance of energy from a donor electron to a receptor receptor electron, during which the class of energy changes * Transduction (cybernetics) is a process or… … Wikipedia
Машинное обучение — (англ. Machine Learning) обширный подраздел искусственного интеллекта, изучающий методы построения алгоритмов, способных обучаться. Различают два типа обучения. Обучение по прецедентам, или индуктивное обучение, основано на выявлении… … Википедия
Papyrus (technology) — Papyrus is the generic name of the enterprise communication and business process platform and related components developed by ISIS Papyrus, a Swiss based commercial enterprise software vendor. The Papyrus Platform is intended to consolidate… … Wikipedia
Обучение машин — Машинное обучение (англ. Machine Learning) обширный подраздел искусственного интеллекта, изучающий методы построения алгоритмов, способных обучаться. Различают два типа обучения. Обучение по прецедентам, или индуктивное обучение, основано на… … Википедия
Обучение по прецедентам — Машинное обучение (англ. Machine Learning) обширный подраздел искусственного интеллекта, изучающий методы построения алгоритмов, способных обучаться. Различают два типа обучения. Обучение по прецедентам, или индуктивное обучение, основано на… … Википедия
Quantitative structure-activity relationship — (QSAR) is the process by which chemical structure is quantitatively correlated with a well defined process, such as biological activity or chemical reactivity.For example, biological activity can be expressed quantitatively as in the… … Wikipedia
Bioinformatics — For the journal, see Bioinformatics (journal). Map of the human X chromosome (from the NCBI website). Assembly of the human genome is one of the greatest achievements of bioinformatics. Bioinformatics … Wikipedia
Computer Audition — (CA) is general field of study of algorithms and systems for audio understanding by machine. Since the notion of what it means for a machine to hear is very broad and somewhat vague, computer audition attempts to bring together several… … Wikipedia
DNA — For a non technical introduction to the topic, see Introduction to genetics. For other uses, see DNA (disambiguation). The structure of the DNA double helix. The atoms in the structure are colour coded by element and the detailed structure of two … Wikipedia
