Share on Facebook Share on Twitter Email
Answers.com

Machine learning

 
Sci-Tech Dictionary: machine learning
(mə′shēn ′lərn·iŋ)

(computer science) The process or technique by which a device modifies its own behavior as the result of its past experience and performance.


Search unanswered questions...
Enter a question here...
Search: All sources Community Q&A Reference topics

(International Conference on Machine Learning) An annual conference devoted to algorithms used in self-learning systems. Since its inception in 1983, ICML is held in North America or Europe. See ECML.

Download Computer Desktop Encyclopedia to your iPhone/iTouch

Wikipedia: Machine learning
Top

Machine learning is a scientific discipline that is concerned with the design and development of algorithms that allow computers to change behavior based on data, such as from sensor data or databases. A major focus of machine learning research is to automatically learn to recognize complex patterns and make intelligent decisions based on data. Hence, machine learning is closely related to fields such as statistics, probability theory, data mining, pattern recognition, artificial intelligence, adaptive control, and theoretical computer science.

Contents

Applications

Applications for machine learning include machine perception, computer vision, natural language processing, syntactic pattern recognition, search engines, medical diagnosis, bioinformatics, brain-machine interfaces and cheminformatics, detecting credit card fraud, stock market analysis, classifying DNA sequences, speech and handwriting recognition, object recognition in computer vision, game playing, software engineering, adaptive websites and robot locomotion.

Human interaction

Some machine learning systems attempt to eliminate the need for human intuition in data analysis, while others adopt a collaborative approach between human and machine. Human intuition cannot, however, be entirely eliminated, since the system's designer must specify how the data is to be represented and what mechanisms will be used to search for a characterization of the data. Machine learning can be viewed as an attempt to automate parts of the scientific method[citation needed].

Some statistical machine learning researchers create methods within the framework of Bayesian statistics.

Algorithm types

Machine learning algorithms are organized into a taxonomy, based on the desired outcome of the algorithm.

Common algorithm types include:

  • Supervised learning - Generates a function that maps inputs to desired outputs. For example, in a classification problem, the learner approximates a function mapping a vector into classes by looking at input-output examples of the function.
  • Unsupervised learning - Models a set of inputs: like clustering
  • Semi-supervised learning - Combines both labeled and unlabeled examples to generate an appropriate function or classifier.
  • Reinforcement learning - Learns how to act given an observation of the world. Every action has some impact in the environment, and the environment provides feedback in the form of rewards that guides the learning algorithm.
  • Transduction - Tries to predict new outputs based on training inputs, training outputs, and test inputs.
  • Learning to learn - Learns its own inductive bias based on previous experience.
  • Pareto-based multi-objective learning - a Pareto-based approach to learning that results in a set of learning models, which typically trade off between performance and complexity. See Multi-Objective Machine Learning Website

Theory

The computational analysis of machine learning algorithms and their performance is a branch of theoretical computer science known as computational learning theory. Because training sets are finite and the future is uncertain, learning theory usually does not yield absolute guarantees of the performance of algorithms. Instead, probabilistic bounds on the performance are quite common.

In addition to performance bounds, computational learning theorists study the time complexity and feasibility of learning. In computational learning theory, a computation is considered feasible if it can be done in polynomial time. There are two kinds of time complexity results. Positive results show that a certain class of functions can be learned in polynomial time. Negative results show that certain classes cannot be learned in polynomial time.

There are many similarities between Machine Learning theory and Statistics, although they use different terms.

See also

Further reading

External links


 
 

 

Copyrights:

Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.  Read more
Computer Desktop Encyclopedia. THIS COPYRIGHTED DEFINITION IS FOR PERSONAL USE ONLY.
All other reproduction is strictly prohibited without permission from the publisher.
© 1981-2009 Computer Language Company Inc.  All rights reserved.  Read more
Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Machine learning" Read more