Python機(jī)器學(xué)習(xí)之KNN近鄰算法

from numpy import *		# 導(dǎo)入numpy模塊
import operator		# 導(dǎo)入operator模塊
def createDataSet():		# 創(chuàng)建數(shù)據(jù)集函數(shù)
	# 構(gòu)建一個(gè)數(shù)組存放特征值
    group = array(
        [[1.0, 1.1], [1.0, 1.0], [0, 0], [0, 0.1]]
    )
    # 構(gòu)建一個(gè)數(shù)組存放目標(biāo)值
    labels = ['A', 'A', 'B', 'B']
    return group, labels

# 返回矩陣的行數(shù)
dataSetSize = dataSet.shape[0]	
# 列數(shù)不變，行數(shù)變成dataSetSize列
diffMat = tile(inX, (dataSetSize, 1)) - dataSet
sqDiffMat = diffMat ** 2
sqDistances = sqDiffMat.sum(axis=1)
distances = sqDistances**0.5

# 返回矩陣的行數(shù)
dataSetSize = dataSet.shape[0]	
# 以第一步的數(shù)據(jù)為例
answer:4		# 4行

inX = [1. , 0.]
# 列數(shù)不變，行數(shù)變成dataSetSize列
diffMat = tile(inX, (dataSetSize, 1)) - dataSet

# tile(inX, (dataSetSize, 1))
inX = [
	[1. , 0.],
	[1. , 0.],
	[1. , 0.],
	[1. , 0.]
]
# inX - dataSet兩個(gè)矩陣相減（行列相等相加相減才有意義）
dataSet = [
		[1. , 1.1],
        [1. , 1. ],
        [0. , 0. ],
        [0. , 0.1]
]
diffMat = [
	[0. , -1.1],
	[0. , -1.],
	[1. , 0.],
	[1. , -0.1]
]

# 求平方差
sqDiffMat = diffMat * 2

# 計(jì)算矩陣中每一行元素之和
# 此時(shí)會(huì)形成一個(gè)多行1列的矩陣
sqDistances = sqDiffMat.sum(axis=1)

# 開(kāi)根號(hào)
distances = sqDistances**0.5

# 對(duì)數(shù)組進(jìn)行排序
sortedDistIndicies = distances.argsort()

classCount = {}		# 新建一個(gè)字典
# 確定前k個(gè)距離最小元素所在的主要分類(lèi)
for i in range(k):
	# voteIlabel的取值是labels中sortedDistIndicies[i]的位置
	voteIlabel = labels[sortedDistIndicies[i]]
	classCount[voteIlabel] = classCount.get(voteIlabel, 0) + 1

# 排序
sortedClassCount = sorted(classCount.iteritems(), key=operator.itemgetter(1), reverse=True)

return sortedClassCount[0][0]

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
int sum_vector(std::vector<int>& v) {
	int sum = 0;
	for (int i = 0; i < v.size(); ++i) {
		sum = v[i] + sum;
	}
	return sum;
}
int knn(int k) {
	using std::cout;
	using std::endl;
	using std::vector;
	vector<vector<int>> x;	
	vector<int> x_sample = {2, 3, 4};	
	for (int i = 0; i < 4; ++i) {
		x.push_back(x_sample);
	}
	vector<int> y = {1, 1, 1, 1};
	int dataSetSize = x.size();		

	vector<int> x_test = {4, 3, 4};
	vector<vector<int>> x_test_matrix;
	for (int i = 0; i < dataSetSize; ++i) {
		x_test_matrix.push_back(x_test);
	}
	vector<int> v_total;
	for (int i = 0; i < dataSetSize; ++i) {
		for (int j = 0; j < x_test_matrix[i].size(); ++j) {
			x_test_matrix[i][j] = x_test_matrix[i][j] - x[i][j];
			x_test_matrix[i][j] = x_test_matrix[i][j] * 2;
		}
		int sum_vec = sum_vector(x_test_matrix[i]);
		v_total.push_back(sqrt(sum_vec));
	}
	sort(v_total.begin(), v_total.end());
	std::map<int, int> mp;
	for (int i = 0; i < k; ++i) {
		int label = y[v_total[i]];
		mp[label] += 1;
	}
	int max_end_result = 0;
	for (std::map<int, int>::iterator it = mp.begin(); it != mp.end(); it++) {
		if (it->first > max_end_result) {
			max_end_result = it->first;
		}
	}
	return max_end_result;
}
int main() {
	int k = 12;
	int value = knn(k);
	std::cout << "result:
" << std::endl;
	return 0;
}

def file2matrix(filename):
	fr = open(filename)
	# 讀取行數(shù)據(jù)直到尾部
	arrayOLines = fr.readlines()
	# 獲取行數(shù)
	numberOfLines = len(arrayOLines)
	# 創(chuàng)建返回shape為（numberOfLines, 3）numpy矩陣
	returnMat = zeros((numberOfLines, 3))
	classLabelVector = []
	index = 0
	for line in arrayOLines:
		# 去除首尾的回車(chē)符
		line = line.strip()
		# 以tab字符'	'為符號(hào)進(jìn)行分割字符串
		listFromLine = line.split('	')
		# 選取前3個(gè)元素，把他們存儲(chǔ)到特征矩陣中
		returnMat[index, :] = listFromLine[0: 3]
		# 把目標(biāo)變量放到目標(biāo)數(shù)組中
		classLabelVector.append(int(listFromLine[-1]))
		index += 1
	return returnMat, classLabelVector

# max：最大特征值
# min：最小特征值
newValue = (oldValue - min)/(max-min)

def autoNorm(dataSet):
	# min(0)返回該矩陣中每一列的最小值
	minVals = dataSet.min(0)
	# max(0)返回該矩陣中每一列的最大值
	maxVals = dataSet.max(0)
	# 求出極值
	ranges = maxVals - minVals
	# 創(chuàng)建一個(gè)相同行列的0矩陣
	normDataSet = zeros(shape(dataSet))
	# 得到行數(shù)
	m = dataSet.shape[0]
	# 得到一個(gè)原矩陣減去m倍行1倍列的minVals
	normDataSet = dataSet - tile(minVlas, (m,1))
	# 特征值相除
	normDataSet = normDataSet/tile(ranges, (m, 1))
	return normDataSet, ranges, minVals

from sklearn.datasets import load_iris      # 導(dǎo)入內(nèi)置數(shù)據(jù)集
from sklearn.model_selection import train_test_split        # 提供數(shù)據(jù)集分類(lèi)方法
from sklearn.preprocessing import StandardScaler        # 標(biāo)準(zhǔn)化
from sklearn.neighbors import KNeighborsClassifier      # KNN


def knn_iris():
    # 獲得鳶尾花數(shù)據(jù)集
    iris = load_iris()
    # 獲取數(shù)據(jù)集
    # random_state為隨機(jī)數(shù)種子，一個(gè)數(shù)據(jù)集中相等的行不能大于6
    x_train, x_test, y_train, y_test = train_test_split(iris.data, iris.target, random_state=6)
    # 特征工程：標(biāo)準(zhǔn)化
    transfer = StandardScaler()
    # 訓(xùn)練集標(biāo)準(zhǔn)化
    x_train = transfer.fit_transform(x_train)
    # 測(cè)試集標(biāo)準(zhǔn)化
    x_test = transfer.transform(x_test)
    # 設(shè)置近鄰個(gè)數(shù)
    estimator = KNeighborsClassifier(n_neighbors=3)
    # 訓(xùn)練集測(cè)試形成模型
    estimator.fit(x_train, y_train)

    # 模型預(yù)估
    # 根據(jù)預(yù)測(cè)特征值得出預(yù)測(cè)目標(biāo)值
    y_predict = estimator.predict(x_test)
    print("y_predict: 
", y_predict)
    # 得出預(yù)測(cè)目標(biāo)值和真實(shí)目標(biāo)值之間是否相等
    print("直接比對(duì)真實(shí)值和預(yù)測(cè)值：
", y_test == y_predict)
    # 計(jì)算準(zhǔn)確率
    score = estimator.score(x_test, y_test)
    print("準(zhǔn)確率為：
", score)


def main():
    knn_iris()


if __name__ == '__main__':
    main()