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

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.
主站蜘蛛池模板: 贵州省| 陈巴尔虎旗| 宜丰县| 宁乡县| 连平县| 阜阳市| 承德市| 达日县| 屏山县| 陵川县| 龙川县| 道孚县| 通辽市| 乃东县| 丰城市| 江油市| 山西省| 金溪县| 邛崃市| 普洱| 新兴县| 西青区| 东阿县| 忻城县| 睢宁县| 江油市| 岳池县| 锦屏县| 延长县| 九台市| 灵璧县| 浏阳市| 克山县| 大连市| 大庆市| 台湾省| 青铜峡市| 读书| 玛纳斯县| 府谷县| 榆社县|