{"id":659,"date":"2013-05-13T10:27:38","date_gmt":"2013-05-13T09:27:38","guid":{"rendered":"http:\/\/it4bus.vn\/itersdesktop\/?p=659"},"modified":"2017-03-02T04:16:07","modified_gmt":"2017-03-02T02:16:07","slug":"supervised-vs-unsupervised-learning","status":"publish","type":"post","link":"https:\/\/www.itersdesktop.com\/fr\/2013\/05\/13\/supervised-vs-unsupervised-learning\/","title":{"rendered":"Supervised vs. Unsupervised learning"},"content":{"rendered":"

Machine learning algorithms are described as either ‘supervised’ or ‘unsupervised’. The distinction is drawn from how the learner classifies data. In supervised algorithms, the classes are predetermined. These classes can be conceived of as a finite set, previously arrived at by a human. In practice, a certain segment of data will be labelled with these classifications. The machine learner’s task is to search for patterns and construct mathematical models. These models then are evaluated on the basis of their predictive capacity in relation to measures of variance in the data itself. Many of the methods referenced in the documentation (decision tree induction, naive Bayes, etc) are examples of supervised learning techniques.<\/p>\n

\"img75\"<\/a><\/p>\n

Unsupervised learners are not provided with classifications. In fact, the basic task of unsupervised learning is to develop classification labels automatically. Unsupervised algorithms seek out similarity between pieces of data in order to determine whether they can be characterized as forming a group. These groups are termed clusters, and there are a whole family of clustering machine learning techniques.<\/p>\n

In unsupervised classification, often known as ‘cluster analysis’ the machine is not told how the texts are grouped. Its task is to arrive at some grouping of the data. In a very common of cluster analysis (K-means), the machine is told in advance how many clusters it should form — a potentially difficult and arbitrary decision to make.<\/p>\n

It is apparent from this minimal account that the machine has much less to go on in unsupervised classification. It has to start somewhere, and its algorithms try in iterative ways to reach a stable configuration that makes sense. The results vary widely and may be completely off if the first steps are wrong. On the other hand, cluster analysis has a much greater potential for surprising you. And it has considerable corroborative power if its internal comparisons of low-level linguistic phenomena lead to groupings that make sense at a higher interpretative level or that you had suspected but deliberately withheld from the machine. Thus cluster analysis is a very promising tool for the exploration of relationships among many texts.<\/p>\n

Source: http:\/\/monkpublic.library.illinois.edu\/monkmiddleware\/public\/analytics\/clusterclassification.html
\n———–
\nC\u00e1c thu\u1eadt to\u00e1n m\u00e1y h\u1ecdc th\u01b0\u1eddng \u0111\u01b0\u1ee3c m\u00f4 t\u1ea3 d\u01b0\u1edbi d\u1ea1ng l\u00e0 ‘gi\u00e1m s\u00e1t’ ho\u1eb7c ‘kh\u00f4ng gi\u00e1m s\u00e1t’. S\u1ef1 ph\u00e2n bi\u1ec7t n\u00e0y \u0111\u01b0\u1ee3c v\u1ea1ch ra khi t\u1eeb l\u00fac ng\u01b0\u1eddi h\u1ecdc ph\u00e2n l\u1edbp d\u1eef li\u1ec7u. Trong nh\u1eefng thu\u1eadt to\u00e1n gi\u00e1m s\u00e1t, c\u00e1c l\u1edbp c\u1ea7n \u0111\u01b0\u1ee3c x\u00e1c \u0111\u1ecbnh tr\u01b0\u1edbc t\u1eeb ban \u0111\u1ea7u. Nh\u1eefng l\u1edbp n\u00e0y \u0111\u01b0\u1ee3c hi\u1ec3u l\u00e0 h\u1eefu h\u1ea1n, v\u00e0 \u0111\u01b0\u1ee3c \u00a0\u0111\u01b0a ra tr\u01b0\u1edbc \u0111\u00f3 do ng\u01b0\u1eddi d\u00f9ng t\u1ef1 x\u00e1c \u0111\u1ecbnh. Trong th\u1ef1c t\u1ebf, vi\u1ec7c ph\u00e2n l\u1edbp n\u00e0y s\u1ebd \u0111\u01b0\u1ee3c \u0111\u1eb7t t\u00ean th\u00f4ng qua c\u00f4ng vi\u1ec7c ph\u00e2n \u0111o\u1ea1n d\u1eef li\u1ec7u n\u00e0o \u0111\u00f3. Nhi\u1ec7m v\u1ee5 c\u1ee7a ch\u01b0\u01a1ng tr\u00ecnh h\u1ecdc m\u00e1y l\u00e0 t\u00ecm ki\u1ebfm nh\u1eefng m\u1eabu d\u1eef li\u1ec7u v\u00e0 nh\u1eefng m\u00f4 h\u00ecnh to\u00e1n h\u1ecdc x\u00e2y d\u1ef1ng. Nh\u1eefng m\u00f4 h\u00ecnh sau \u0111\u00f3 \u0111\u01b0\u1ee3c \u0111\u00e1nh gi\u00e1 \u00a0d\u1ef1a tr\u00ean c\u01a1 s\u1edf kh\u1ea3 n\u0103ng ti\u00ean \u0111o\u00e1n c\u1ee7a ch\u00fang trong m\u1ed1i quan h\u1ec7 v\u1edbi c\u00e1c ph\u00e9p \u0111o bi\u1ebfn \u0111\u1ed5i tr\u00ean ch\u00ednh d\u1eef li\u1ec7u \u0111\u00f3. Nhi\u1ec1u ph\u01b0\u01a1ng ph\u00e1p tham kh\u1ea3o trong b\u00e0i vi\u1ebft n\u00e0y (c\u00e2y quy\u1ebft \u0111\u1ecbnh quy n\u1ea1p, naive Bayes, etc) l\u00e0 nh\u1eefng v\u00ed d\u1ee5 v\u1ec1 k\u1ef9 thu\u1eadt h\u1ecdc m\u00e1y gi\u00e1m s\u00e1t.<\/p>","protected":false},"excerpt":{"rendered":"

Machine learning algorithms are described as either ‘supervised’ or ‘unsupervised’. The distinction is drawn from how the learner classifies data. In supervised algorithms, the classes are predetermined. These classes can… <\/p>\n","protected":false},"author":1,"featured_media":974,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[328],"tags":[152],"class_list":["post-659","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-data-mining","tag-clustering"],"_links":{"self":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/659","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/comments?post=659"}],"version-history":[{"count":5,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/659\/revisions"}],"predecessor-version":[{"id":2600,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/posts\/659\/revisions\/2600"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/media\/974"}],"wp:attachment":[{"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/media?parent=659"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/categories?post=659"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.itersdesktop.com\/fr\/wp-json\/wp\/v2\/tags?post=659"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}