网格搜索特点
网格搜索类似于穷举法,来确定模型参数的一个最优的组合,但相应的会大量的增加计算时间,但精确率等指标会很高
代码如下
import pandas as pd
import matplotlib.pyplot as plt
from sklearn.linear_model import LogisticRegression
from sklearn.model_selection import cross_val_score, GridSearchCV, train_test_split
from sklearn.tree import DecisionTreeClassifier
from sklearn.metrics import confusion_matrix, precision_score, recall_score, f1_score, roc_auc_score, roc_curve
plt.rcParams["font.sans-serif"] = ["SimHei"]
plt.rcParams["axes.unicode_minus"] = False
# 读取数据并设置MEMBER_NO为索引列
data = pd.read_excel('../../datas/aviation.xls', index_col='MEMBER_NO')
# 处理数据(去重,删除空值)
data.drop_duplicates(inplace=True)
data.dropna(inplace=True)
# 抽取500个样本,并切出XY
data = data.sample(500)
X = data.iloc[:, :-1]
Y =