Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Since you ask this very basic question, it looks like it's worth specifying what Machine Learning itself is.</p> <p>Machine Learning is a class of algorithms which is data-driven, i.e. unlike "normal" algorithms it is the data that "tells" what the "good answer" is. Example: a hypothetical non-machine learning algorithm for face detection in images would try to define what a face is (round skin-like-colored disk, with dark area where you expect the eyes etc). A machine learning algorithm would not have such coded definition, but would "learn-by-examples": you'll show several images of faces and not-faces and a good algorithm will eventually learn and be able to predict whether or not an unseen image is a face.</p> <p>This particular example of face detection is <strong>supervised</strong>, which means that your examples must be <em>labeled</em>, or explicitly say which ones are faces and which ones aren't.</p> <p>In an <strong>unsupervised</strong> algorithm your examples are not <em>labeled</em>, i.e. you don't say anything. Of course, in such a case the algorithm itself cannot "invent" what a face is, but it can try to <a href="http://en.wikipedia.org/wiki/Cluster_analysis" rel="noreferrer">cluster</a> the data into different groups, e.g. it can distinguish that faces are very different from landscapes, which are very different from horses.</p> <p>Since another answer mentions it (though, in an incorrect way): there are "intermediate" forms of supervision, i.e. <strong>semi-supervised</strong> and <strong>active learning</strong>. Technically, these are supervised methods in which there is some "smart" way to avoid a large number of labeled examples. In active learning, the algorithm itself decides which thing you should label (e.g. it can be pretty sure about a landscape and a horse, but it might ask you to confirm if a gorilla is indeed the picture of a face). In semi-supervised learning, there are two different algorithms which start with the labeled examples, and then "tell" each other the way they think about some large number of unlabeled data. From this "discussion" they learn.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. This table or related slice is empty.
    2. VO
      singulars
      1. This table or related slice is empty.
    3. VO
      singulars
      1. This table or related slice is empty.
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload