金字塔算法_金字塔原理应用于分类算法

金字塔算法

机器学习(Machine Learning)

The Minto’s Pyramid Principle is aimed to better organize and remember ideas with a pyramidal, and hierarchical structure. If you have to answer: what are the different classification algorithms? You may think of, Random Forest, KNN, Naive Bayes, Logistic Regression, and so on. But what the relationships between, and how to give a structured answer?

Minto的金字塔原理旨在更好地组织和记住具有金字塔结构和层次结构的思想。 如果您必须回答：有哪些不同的分类算法？ 您可能会想到随机森林，KNN，朴素贝叶斯，逻辑回归等。 但是之间的关系是什么，如何给出结构化的答案呢？

Let’s apply the Minto’s Pyramid Principle.

让我们应用Minto的金字塔原理。

3种基本方法 (3 basic ways)

3 basic ways of classifying data into categories are:

将数据分类的3种基本方法是：

• Linear classifier with a linear decision boundary. Or more precisely, the decision boundary is a hyperplane.

  具有线性决策边界的线性分类器。 更确切地说，决策边界是一个超平面。

• Nearest Neighbors by analyzing k nearest observations (after calculating the distance between the new observation and all training data)

  通过分析k个最近的观测值(计算新观测值与所有训练数据之间的距离之后)，确定最邻近的人

• Decision trees construct (hyper)rectangles to regroup observations by minimizing gini or entropy.

  决策树通过最小化基尼或熵来构造(超)矩形以重新组合观察。

线性分类器 (Linear classifiers)

Construct a hyperplane to separate the space into 2, this is the principle of linear classifiers. Now how to construct this hyperplane? We have several different ways.

构造一个超平面将空间分成2个，这是线性分类器的原理。 现在如何构造这个超平面？ 我们有几种不同的方式。

Let’s first consider the binary classification case:

让我们首先考虑二进制分类的情况：

• Logistic Regression uses the logistic function to transform the data into classes 0 and 1. And the value of 0.5 will give us the dec