一口气刷完牛客网全部机器学习算法题_学习机器学习需要每天刷题吗

最新推荐文章于 2024-05-28 17:00:50 发布

2401_84181108

最新推荐文章于 2024-05-28 17:00:50 发布

阅读量248

点赞数 7

分类专栏：程序员文章标签：机器学习算法学习

本文链接：https://blog.csdn.net/2401_84181108/article/details/138424692

版权

程序员专栏收录该内容

171 篇文章 0 订阅

订阅专栏

鸢尾花分类_2

原题：鸢尾花分类_2_牛客题霸_牛客网 (nowcoder.com)")

我使用的是决策树模型，默认参数下该二分类问题准确率还是100%

import numpy as np
from sklearn import datasets
from sklearn.model_selection import train_test_split
from sklearn.metrics import accuracy_score
from sklearn.tree import DecisionTreeClassifier


def transform_three2two_cate():
    data = datasets.load_iris()
    new_data = np.hstack([data.data, data.target[:, np.newaxis]])
    new_feat = new_data[new_data[:, -1] != 2][:, :4]
    new_label = new_data[new_data[:, -1] != 2][:, -1]
    return new_feat, new_label


def train_and_evaluate():
    data_X, data_Y = transform_three2two_cate()
    train_x, test_x, train_y, test_y = train_test_split(data_X, data_Y, test_size=0.2)
    DT = DecisionTreeClassifier()
    DT.fit(train_x, train_y)
    y_predict = DT.predict(test_x)
    print(accuracy_score(y_predict, test_y))


if __name__ == "__main__":
    train_and_evaluate()

信息熵的计算

原题：决策树的生成与训练-信息熵的计算_牛客题霸_牛客网 (nowcoder.com)")

这道题十分简单，我的做法是把下面的数据转换为numpy的ndarray矩阵取出最后一列，直接套公式：

import numpy as np
import pandas as pd
from collections import Counter

dataSet = pd.read_csv('dataSet.csv', header=None).values[:, -1]


def calcInfoEnt(dataSet):
    numEntres = len(dataSet)
    cnt = Counter(dataSet)  # 计数每个值出现的次数
    probability_lst = [1.0 * cnt[i] / numEntres for i in cnt]
    return -np.sum([p * np.log2(p) for p in probability_lst])


if __name__ == '__main__':
    print(calcInfoEnt(dataSet))

信息增益的计算

原题：决策树的生成与训练-信息增益_牛客题霸_牛客网 (nowcoder.com)")

import numpy as np
import pandas as pd
from collections import Counter
import random

dataSet = pd.read_csv('dataSet.csv', header=None).values.T  # 转置 5*15数组


def entropy(data):  # data 一维数组
    numEntres = len(data)
    cnt = Counter(data)  # 计数每个值出现的次数  Counter({1: 8, 0: 5})
    probability_lst = [1.0 * cnt[i] / numEntres for i in cnt]
    return -np.sum([p * np.log2(p) for p in probability_lst])  # 返回信息熵


def calc_max_info_gain(dataSet):
    label = np.array(dataSet[-1])
    total_entropy = entropy(label)
    max_info_gain = [0, 0]

    for feature in range(4):  # 4种特征 我命名为特征：0 1 2 3
        f_index = {}
        for idx, v in enumerate(dataSet[feature]):
            if v not in f_index:
                f_index[v] = []
            f_index[v].append(idx)
        f_impurity = 0
        for k in f_index:
            # 根据该特征取值对应的数组下标 取出对应的标签列表 比如分支1有多少个正负例 分支2有...
            f_l = label[f_index[k]]
            f_impurity += entropy(f_l) * len(f_l) / len(label)  # 循环结束得到各分支混杂度的期望

        gain = total_entropy - f_impurity  # 信息增益IG
        if gain > max_info_gain[1]:
            max_info_gain = [feature, gain]

    return max_info_gain


if __name__ == '__main__':
    info_res = calc_max_info_gain(dataSet)
    print("信息增益最大的特征索引为：{0},对应的信息增益为{1}".format(info_res[0], info_res[1]))