【机器学习】集成算法使用样例

最新推荐文章于 2024-07-18 15:30:34 发布

DrCrypto

最新推荐文章于 2024-07-18 15:30:34 发布

阅读量524

点赞数

分类专栏： Machine Learning

本文链接：https://blog.csdn.net/u011240016/article/details/85066553

版权

本文将通过实例探讨如何在Python中应用集成学习算法，结合《机器学习Python实践》一书，带你深入理解并掌握这一强大的机器学习技术。

摘要由CSDN通过智能技术生成

# -*- coding: utf-8 -*-
"""集成算法.ipynb

Automatically generated by Colaboratory.

Original file is located at
    https://colab.research.google.com/drive/1cr8C3JW8619DoKNb0nd9u7_RqfAlruTv

**Bagged Decision Tree**

Bagging算法在数据有很大的方差时很有效，最常见的是决策树的Bagging算法。
"""

from pandas import read_csv
from sklearn.model_selection import KFold
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import BaggingClassifier
from sklearn.tree import DecisionTreeClassifier

# 导入数据
filename = 'http://ftp.ics.uci.edu/pub/machine-learning-databases/pima-indians-diabetes/pima-indians-diabetes.data'
names = ['preg','plas','pres','skin','test','mass','pedi','age','class']
data = read_csv(filename, names=names)

data.shape

# 数据划分
array = data.values
X = array[:, 0:8]
y = array[:, 8]

# 构建模型
num_folds = 10
seed = 7
kfold = KFold(n_splits=num_folds, random_state=seed)
cart = DecisionTreeClassifier()
num_tree = 100
model = BaggingClassifier(base_estimator=cart, n_estimators=num_tree, random_state=seed)

result = cross_val_score(model, X, y, cv=kfold)

print(result.mean())

"""### 随机森林

用随机的方式建立一个森林，森林由多棵决策树组成，每个决策树之间没有关联。新的输入进入到随机森林，会让每个决策树分别判断，看样本属于哪一类，最后看哪类被选择的最多，就预测这个样本为那个类。
"""

from pandas import read_csv
from sklearn.model_selection import KFold
from sklearn.model_selection import cross_val_score
from<