时间:2021-05-22
本文实例为大家分享了python实现mean-shift聚类算法的具体代码,供大家参考,具体内容如下
1、新建MeanShift.py文件
import numpy as np# 定义 预先设定 的阈值STOP_THRESHOLD = 1e-4CLUSTER_THRESHOLD = 1e-1# 定义度量函数def distance(a, b): return np.linalg.norm(np.array(a) - np.array(b))# 定义高斯核函数def gaussian_kernel(distance, bandwidth): return (1 / (bandwidth * np.sqrt(2 * np.pi))) * np.exp(-0.5 * ((distance / bandwidth)) ** 2)# mean_shift类class mean_shift(object): def __init__(self, kernel=gaussian_kernel): self.kernel = kernel def fit(self, points, kernel_bandwidth): shift_points = np.array(points) shifting = [True] * points.shape[0] while True: max_dist = 0 for i in range(0, len(shift_points)): if not shifting[i]: continue p_shift_init = shift_points[i].copy() shift_points[i] = self._shift_point(shift_points[i], points, kernel_bandwidth) dist = distance(shift_points[i], p_shift_init) max_dist = max(max_dist, dist) shifting[i] = dist > STOP_THRESHOLD if(max_dist < STOP_THRESHOLD): break cluster_ids = self._cluster_points(shift_points.tolist()) return shift_points, cluster_ids def _shift_point(self, point, points, kernel_bandwidth): shift_x = 0.0 shift_y = 0.0 scale = 0.0 for p in points: dist = distance(point, p) weight = self.kernel(dist, kernel_bandwidth) shift_x += p[0] * weight shift_y += p[1] * weight scale += weight shift_x = shift_x / scale shift_y = shift_y / scale return [shift_x, shift_y] def _cluster_points(self, points): cluster_ids = [] cluster_idx = 0 cluster_centers = [] for i, point in enumerate(points): if(len(cluster_ids) == 0): cluster_ids.append(cluster_idx) cluster_centers.append(point) cluster_idx += 1 else: for center in cluster_centers: dist = distance(point, center) if(dist < CLUSTER_THRESHOLD): cluster_ids.append(cluster_centers.index(center)) if(len(cluster_ids) < i + 1): cluster_ids.append(cluster_idx) cluster_centers.append(point) cluster_idx += 1 return cluster_ids2、调用上述py文件
# -*- coding: utf-8 -*-"""Created on Tue Oct 09 11:02:08 2018@author: muli"""from sklearn.datasets.samples_generator import make_blobsimport matplotlib.pyplot as plt import randomimport numpy as npimport MeanShiftdef colors(n): ret = [] for i in range(n): ret.append((random.uniform(0, 1), random.uniform(0, 1), random.uniform(0, 1))) return retdef main(): centers = [[-1, -1], [-1, 1], [1, -1], [1, 1]] X, _ = make_blobs(n_samples=300, centers=centers, cluster_std=0.4) mean_shifter = MeanShift.mean_shift() _, mean_shift_result = mean_shifter.fit(X, kernel_bandwidth=0.5) np.set_printoptions(precision=3) print('input: {}'.format(X)) print('assined clusters: {}'.format(mean_shift_result)) color = colors(np.unique(mean_shift_result).size) for i in range(len(mean_shift_result)): plt.scatter(X[i, 0], X[i, 1], color = color[mean_shift_result[i]]) plt.show()if __name__ == '__main__': main()结果如图所示:
参考链接
以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持。
声明:本页内容来源网络,仅供用户参考;我单位不保证亦不表示资料全面及准确无误,也不保证亦不表示这些资料为最新信息,如因任何原因,本网内容或者用户因倚赖本网内容造成任何损失或损害,我单位将不会负任何法律责任。如涉及版权问题,请提交至online#300.cn邮箱联系删除。
本文实例讲述了Python聚类算法之DBSACN。分享给大家供大家参考,具体如下:DBSCAN:是一种简单的,基于密度的聚类算法。本次实现中,DBSCAN使用了
本文实例讲述了Python聚类算法之凝聚层次聚类。分享给大家供大家参考,具体如下:凝聚层次聚类:所谓凝聚的,指的是该算法初始时,将每个点作为一个簇,每一步合并两
本文主要内容:聚类算法的特点聚类算法样本间的属性(包括,有序属性、无序属性)度量标准聚类的常见算法,原型聚类(主要论述K均值聚类),层次聚类、密度聚类K均值聚类
本文实例讲述了Python实现的KMeans聚类算法。分享给大家供大家参考,具体如下:菜鸟一枚,编程初学者,最近想使用Python3实现几个简单的机器学习分析方
K-Means算法是一种基于距离的聚类算法,采用迭代的方法,计算出K个聚类中心,把若干个点聚成K类。MLlib实现K-Means算法的原理是,运行多个K-Mea