ICode9

精准搜索请尝试: 精确搜索
首页 > 编程语言> 文章详细

ML之LoR&DT&RF:基于LoR&DT(CART)&RF算法对mushrooms蘑菇数据集(22+1,6513+1611)训练来预测蘑菇是否毒性(二分类预测)

2021-06-15 20:08:37  阅读:232  来源: 互联网

标签:std GSCV penalty LoR RF params model DT mean


ML之LoR&DT&RF:基于LoR&DT(CART)&RF算法对mushrooms蘑菇数据集(22+1,6513+1611)训练来预测蘑菇是否毒性(二分类预测)

 

 

目录

输出结果

设计思路

核心代码


 

 

 

输出结果

0、数据集

after LabelEncoder

 

1、LoR算法



LoR_model_GSCV.grid_scores_: [mean: 0.77012, std: 0.01349, params: {'C': 0.001, 'penalty': 'l1'}, 
                              mean: 0.86936, std: 0.01035, params: {'C': 0.001, 'penalty': 'l2'}, 
                              mean: 0.91229, std: 0.01022, params: {'C': 0.01, 'penalty': 'l1'}, 
                              mean: 0.91045, std: 0.00831, params: {'C': 0.01, 'penalty': 'l2'}, 
                              mean: 0.94707, std: 0.00853, params: {'C': 0.1, 'penalty': 'l1'}, 
                              mean: 0.93599, std: 0.00841, params: {'C': 0.1, 'penalty': 'l2'}, 
                              mean: 0.95984, std: 0.00670, params: {'C': 1, 'penalty': 'l1'}, 
                              mean: 0.94953, std: 0.00790, params: {'C': 1, 'penalty': 'l2'}, 
                              mean: 0.96553, std: 0.00531, params: {'C': 10, 'penalty': 'l1'}, 
                              mean: 0.95722, std: 0.00559, params: {'C': 10, 'penalty': 'l2'}, 
                              mean: 0.96646, std: 0.00516, params: {'C': 100, 'penalty': 'l1'}, 
                              mean: 0.96599, std: 0.00528, params: {'C': 100, 'penalty': 'l2'}, 
                              mean: 0.96661, std: 0.00513, params: {'C': 1000, 'penalty': 'l1'}, 
                              mean: 0.96646, std: 0.00564, params: {'C': 1000, 'penalty': 'l2'}]
LoR_model_GSCV.best_score_: 0.96661024773042
LoR_model_GSCV.best_params_: {'C': 1000, 'penalty': 'l1'}
LoR_model_GSCV.best_score_: 0.96661024773042
LoR_model_GSCV.best_params_: {'C': 1000, 'penalty': 'l1'}
LoR_model_GSCV_auc_roc: 0.9739644970414202

2、DT算法

 

 

3、RF算法

 

RFC_model_GSCV grid_scores_: [mean: 0.99938, std: 0.00075, params: {'max_features': 'auto', 'min_samples_leaf': 10, 'n_estimators': 10}, 
                              mean: 0.99954, std: 0.00070, params: {'max_features': 'auto', 'min_samples_leaf': 10, 'n_estimators': 20},
                              …… 
                              mean: 0.97784, std: 0.01071, params: {'max_features': 'log2', 'min_samples_leaf': 80, 'n_estimators': 20}, 
                              mean: 0.98215, std: 0.00703, params: {'max_features': 'log2', 'min_samples_leaf': 80, 'n_estimators': 30}, 
                              mean: 0.98169, std: 0.00550, params: {'max_features': 'log2', 'min_samples_leaf': 90, 'n_estimators': 80}, 
                              mean: 0.98169, std: 0.00801, params: {'max_features': 'log2', 'min_samples_leaf': 90, 'n_estimators': 90}]
RFC_model_GSCV best_score_: 0.9998461301738729
RFC_model_GSCV best_params_: {'max_features': 'auto', 'min_samples_leaf': 10, 'n_estimators': 50}
RFC_model_GSCV_auc_roc: 1.0

 

设计思路

后期更新……

 

 

核心代码

后期更新……

RF 

tuned_parameters = {'min_samples_leaf': range(10,100,10), 
                       'n_estimators' : range(10,100,10),
                        'max_features': ['auto','sqrt','log2'] }
   
  
RFC_model_GSCV = GridSearchCV(RFC_model, tuned_parameters,cv=10)    
RFC_model_GSCV.fit(X_train,y_train)                                 
  
endtime = time.clock()
print ('RFC_model_GSCV Training time:',endtime - starttime)   

print('RFC_model_GSCV grid_scores_:', RFC_model_GSCV.grid_scores_)
print('RFC_model_GSCV best_score_:',  RFC_model_GSCV.best_score_)
print('RFC_model_GSCV best_params_:', RFC_model_GSCV.best_params_)

y_prob = RFC_model_GSCV.predict_proba(X_test)[:,1]   
y_pred = np.where(y_prob > 0.5, 1, 0)                
RFC_model_GSCV.score(X_test, y_pred)

 

 

 

 

 

 

标签:std,GSCV,penalty,LoR,RF,params,model,DT,mean
来源: https://blog.51cto.com/u_14217737/2905655

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有