python+决策树2
来源:互联网 发布:小米6陶瓷尊享版 知乎 编辑:程序博客网 时间:2024/06/05 17:08
import pandas as pdfrom sklearn.model_selection._validation import cross_val_score #交叉检验,计算平均正确率from sklearn.tree import DecisionTreeClassifierimport numpy as npfrom collections import defaultdictclf = DecisionTreeClassifier(random_state=14)filename = "dicision_trees_sample.csv"#修复参数,将Date列的值由字符串改为日期类型.dataset = pd.read_csv(filename, parse_dates=["Date"]) #将Date列的值由字符串改为日期类型。#定义表头即定义属性列。 dataset.columns = ["Date","StartTime","VistorTeam","VisitorPTS","HomeTeam","HomePTS","ScoreType","OT?","Notes"]#添加新特征,主场获胜与否(1表示主场获胜,0表示主场未获胜),作为预测的结果是否正确的标准。dataset["HomeWin"] = dataset["VisitorPTS"] < dataset["HomePTS"]x_c = dataset["HomeWin"].values#创建新特征,提高准确率,球队排名作为预测是否获胜的依据dataset["HomeTeamRanksHiger"] = 0standings_filename = "leagues_NBA_2013_standings_expanded-standings.csv"standings = pd.read_csv(standings_filename)for index, row in dataset.sort_values("Date").iterrows(): homeTeam = row["HomeTeam"] visitorTeam = row["VistorTeam"] #处理有些球队更名问题 if homeTeam == "New Orleans Pelicans": homeTeam = "New Orleans Hornets" elif visitorTeam == "New Orleans Pelicans": visitorTeam = "New Orleans Hornets" #standings[ standings["Team"]== homeTeam ],首先在standings筛选出homeTeam,然后得到它的排名 homeRank = standings[ standings["Team"]== homeTeam ]["Rk"].values[0] #存放主场球队排名 visitorRank = standings[ standings["Team"]== visitorTeam]["Rk"].values[0] #存放客场球队排名 row["HomeTeamRanksHiger"] = int(homeRank > visitorRank) dataset.ix[index] = row#加入2支球队上场比赛情况作为判断依据(思路:如果上场比赛A打赢B,则预测下场比赛A依然会打赢B)last_match_winner = defaultdict(int) #存放0或1,分别表示客场和主场胜利dataset["HomeTeamWonLast"] = 0for index, row in dataset.sort_values("Date").iterrows(): homeTeam = row["HomeTeam"] visitorTeam = row["VistorTeam"] teams = tuple(sorted([homeTeam,visitorTeam])) row["HomeTeamWonLast"] = 1 if last_match_winner[teams] == row["HomeTeam"] else 0 dataset.ix[index] = row winner = row["HomeTeam"] if row["HomeWin"] else row["VistorTeam"] last_match_winner[teams] = winnerx_lastwinner = dataset[["HomeTeamRanksHiger","HomeTeamWonLast"]].valuesscores = cross_val_score(clf, x_lastwinner, x_c, scoring="accuracy")print("上场2球队之间比赛结果+球队排名作为预测下场比赛这2支球队比赛结果的依据,Accuracy: {0:.1f}%".format(np.mean(scores) * 100))
运行结果:
0 0
- python+决策树2
- Python 决策树
- Python决策树
- 决策树python
- 决策树python
- python 决策树
- # 详解决策树、python实现决策树
- python机器学习实战2:实现决策树
- id3决策树Python版
- 决策树绘图(python)
- python决策树算法
- Python实现决策树算法
- 决策树--Python实现
- python 决策树学习
- python学习之决策树
- 决策树及其python实现
- 决策树原理-python实现
- Python实现决策树
- 从最简单的vector中sort用法到自定义比较函数comp后对结构体排序的sort算法
- 计算机网络之局域网&以太网
- Excel2Latex 实操步骤(1)
- leetcode-93. Restore IP Addresses
- spring mvc(mybatis)配置多个不同数据库
- python+决策树2
- vi编辑器简单配置
- android调用系统浏览器和拨打电话
- 使用 Log4j 将日志记录到远程系统
- gulp安装&less插件
- Web9. CSS常见属性2
- Linux--进程间通信--管道
- 【机器学习】【可视化】Matplotlib的scatter函数用法
- 2.spark的RDD特性(Resillient Distributed Dataset)