机器学习实战源代码.pdfVIP

机器学习实战 2 K-近邻算法3 2.1 kNN.py 3 2.2 createDist.py 5 2.3 createDist2.py7 2.4 createFirstPlot.py 8 3 决策树9 3.1 treePlotter.py 9 3.2 trees.py 11 4 基于概率论的分类方法：朴素贝叶斯 13 4.1 bayes.py 13 4.2 create2Normal.py 17 4.3 monoDemo.py 18 5 Logistic 回归 19 5.1 logRegres.py 19 5.2 plot2D.py21 5.3 plotGD.py22 5.4 plotSDerror.py 24 5.5 sigmoidPlot.py 25 6 支持向量机26 6.1 svmMLiA.py 26 6.2 notLinSeperable.py 34 6.3 plotRBF.py 36 6.4 plotSupportVectors.py 37 7 利用AdaBoost 元算法提高分类性能38 7.1 adaboost.py 38 7.2 old_adaboost.py 41 8 预测数值型数据：回归43 8.1 regression.py 43 8.2 Old_regression.py 48 9 树回归53 9.1 regTrees.py 53 9.2 treeExplore.py 56 10 利用K-均值聚类算法对未标注数据分组58 10.1 kMeans.py58 11 使用Apriori 算法进行关联分析61 11.1 apriori.py 61 12 使用FP-growth 算法来高效分析频繁项集65 12.1 fpGrowth.py 65 13 利用PCA 来简化数据68 13.1 pca.py 68 13.2 createFig1.py69 13.2 createFig2.py70 13.3 createFig370 13.4 createFig4.py 72 14 利用SVD 简化数据72 14.1 svdRec.py72 15 大数据与MapReduce 75 15.1 mrMean.py 75 15.2 mrMeanMapper.py76 15.3 mrMeanReducer.py 76 15.4 mrSVM.py77 15.5 mrSVMkickStart.py 79 15.6 pegasos.py 79 15.7 proximalSVM.py81 15.8 py27dbg.py82 15.9 wc.py83 2 K-近邻算法 2.1 kNN.py Created on Sep 16, 2010 kNN: k Nearest Neighbors Input: inX: vector to compare to existing dataset (1xN) dataSet: size m data set of known vectors (NxM) labels: data set labels (1xM vector) k: number of neighbors to use for comparison (should be an odd number) Output: the most popular class label @author: pbharrin from numpy import * import operator fr