【发布时间】:2020-05-04 08:25:50
【问题描述】:
在 K-Nearest Neighbors 分类的上下文中,我需要对字典中的多个值进行最小-最大标准化。我通过获取值,将它们拆分为单独的列表,在这些列表上运行 min-max normalize 函数并再次将列表压缩在一起来做到这一点。见下文。我想有更聪明的方法吗?
dataset = {'a':[1, 200], 'b':[1.5, 180], 'c':[0.8, 80], 'd':[1.2, 150]}
values = dataset.values()
value_1 = [i[0] for i in values]
value_2 = [i[1] for i in values]
def min_max_normalize(lst):
minimum = min(lst)
maximum = max(lst)
normalized = []
for i in range(len(dataset)):
normalized_value = (lst[i] - minimum)/(maximum - minimum)
normalized.append(normalized_value)
return normalized
value_1_normalized = min_max_normalize(value_1)
value_2_normalized = min_max_normalize(value_2)
values_normalized = zip(value_1_normalized, value_2_normalized)
【问题讨论】:
标签: python-3.x machine-learning classification