官术网_书友最值得收藏!

The machine learning algorithm using a distributed environment

Machine learning algorithms combine simple tasks into complex patterns, that are even more complicated in distributed environment. Let's take a simple decision tree algorithm (reference), for example. This particular algorithm creates a binary tree that tries to fit training data and minimize prediction errors. However, in order to do this, it has to decide about the branch of tree it has to send every data point to (don't worry, we'll cover the mechanics of how this algorithm works along with some very useful parameters that you can learn in later in the book). Let's demonstrate it with a simple example:

Figure 3 - Example of red and blue data points covering 2D space.

Consider the situation depicted in preceding figure. A two-dimensional board with many points colored in two colors: red and blue. The goal of the decision tree is to learn and generalize the shape of data and help decide about the color of a new point. In our example, we can easily see that the points almost follow a chessboard pattern. However, the algorithm has to figure out the structure by itself. It starts by finding the best position of a vertical or horizontal line, which would separate the red points from the blue points.

The found decision is stored in the tree root and the steps are recursively applied on both the partitions. The algorithm ends when there is a single point in the partition:

Figure 4 - The final decision tree and projection of its prediction to the original space of points.
主站蜘蛛池模板: 大安市| 安新县| 绥江县| 泗阳县| 凤阳县| 顺义区| 博野县| 阳江市| 安阳县| 昌江| 定日县| 平顶山市| 北安市| 读书| 银川市| 松潘县| 兰溪市| 格尔木市| 襄汾县| 宿州市| 永城市| 教育| 玉环县| 道孚县| 铜川市| 甘洛县| 临猗县| 涿州市| 介休市| 福清市| 池州市| 岑溪市| 梅河口市| 德格县| 南溪县| 玛沁县| 沙湾县| 东丽区| 安乡县| 濮阳市| 双江|