• hugeng007_DecisionTreeClassifier_demo


    # -*- coding:utf-8 -*-
    import numpy as np
    import matplotlib.pyplot as plt
    from sklearn import datasets
    from sklearn import tree
    """
    生成分类面数据点
    """
    def make_meshgrid(x, y, h=.02):
        """Create a mesh of points to plot in
    
        Parameters
        ----------
        x: data to base x-axis meshgrid on
        y: data to base y-axis meshgrid on
        h: stepsize for meshgrid, optional
    
        Returns
        -------
        xx, yy : ndarray
        """
        x_min, x_max = x.min() - 1, x.max() + 1
        y_min, y_max = y.min() - 1, y.max() + 1
        xx, yy = np.meshgrid(np.arange(x_min, x_max, h),
                             np.arange(y_min, y_max, h))
        return xx, yy
    
    """
    利用分类器对数据点进行分类
    """
    def plot_contours(ax, clf, xx, yy, **params):
        """Plot the decision boundaries for a classifier.
    
        Parameters
        ----------
        ax: matplotlib axes object
        clf: a classifier
        xx: meshgrid ndarray
        yy: meshgrid ndarray
        params: dictionary of params to pass to contourf, optional
        """
        Z = clf.predict(np.c_[xx.ravel(), yy.ravel()])
        Z = Z.reshape(xx.shape)
        out = ax.contourf(xx, yy, Z, **params)
        return out
    
    """
    实验目的:决策树分类实验
    
    数据集:本程序使用Iris数据集是常用的分类实验数据集,由Fisher, 1936收集整理。
    Iris也称鸢尾花卉数据集,是一类多重变量分析的数据集。
    数据集包含150个数据集,分为3类,每类50个数据,每个数据包含4个属性。
    可通过花萼长度,花萼宽度,花瓣长度,花瓣宽度4个属性预测鸢尾花卉属于
    (Setosa,Versicolour,Virginica)三个种类中的哪一类。
    
    注意:为了方面可视化,实验中取Iris数据集中前两维特征进行模型训练
    """
    
    # import some data to play with
    iris = datasets.load_iris()
    # Take the first two features. We could avoid this by using a two-dim dataset
    X = iris.data[:, :2]
    y = iris.target
    
    """
    函数说明:
        class sklearn.tree.DecisionTreeClassifier(criterion=’gini’, splitter=’best’, max_depth=None, min_samples_split=2, 
                        min_samples_leaf=1, min_weight_fraction_leaf=0.0, max_features=None, random_state=None, max_leaf_nodes=None, 
                        min_impurity_decrease=0.0, min_impurity_split=None, class_weight=None, presort=False)
     
    参数说明:
    http://scikit-learn.org/stable/modules/generated/sklearn.tree.DecisionTreeClassifier.html#sklearn.tree.DecisionTreeClassifier
    """
    # Create and fit an decision tree
    clf = tree.DecisionTreeClassifier()
    clf.fit(X,y)
    
    """
    DecisionTreeClassifier(class_weight=None, criterion='gini', max_depth=None,
                max_features=None, max_leaf_nodes=None,
                min_impurity_decrease=0.0, min_impurity_split=None,
                min_samples_leaf=1, min_samples_split=2,
                min_weight_fraction_leaf=0.0, presort=False, random_state=None,
                splitter='best')
    """
    import matplotlib.pyplot as plt
    
    # title for the plots
    title = ('DecisionTreeClassifier')
    
    # Set-up window for plotting.
    fig, ax = plt.subplots(1, 1)
    plt.subplots_adjust(wspace=0.4, hspace=0.4)
    
    X0, X1 = X[:, 0], X[:, 1]
    xx, yy = make_meshgrid(X0, X1)
    
    """
    对平面内的点集分类并进行可视化处理
    """
    plot_contours(ax, clf, xx, yy,
    			  cmap=plt.cm.coolwarm, alpha=0.8)
    ax.scatter(X0, X1, c=y, cmap=plt.cm.coolwarm, s=20, edgecolors='k')
    ax.set_xlim(xx.min(), xx.max())
    ax.set_ylim(yy.min(), yy.max())
    ax.set_xlabel('Sepal length')
    ax.set_ylabel('Sepal width')
    ax.set_xticks(())
    ax.set_yticks(())
    ax.set_title(title)
    
    plt.show()
    

  • 相关阅读:
    [ html canvas save restore ] canvas绘图 save restore 属性理论讲解
    [ html canvas save restore ] canvas绘图 save restore 属性实例演示
    [ html canvas 绘制文本 ] canvas绘图实现绘制文本 strokeText fillText方法及textAlign textBaseline font 属性实例演示
    [ html canvas 旋转 缩放 平移 ] canvas绘图实现旋转复制实例演示
    [ html canvas 绘制曲线三种方法 ] canvas绘图 绘制曲线三种方法属性实例演示
    context.quadraticCurveTo() context.bezierCurveTo()详解
    sphinx教程 区段查询配置 命令(2)
    sphinx安装测试2
    fabric教程(1)
    NLPIR使用(1)
  • 原文地址:https://www.cnblogs.com/hugeng007/p/9471746.html
Copyright © 2020-2023  润新知