python——将类别数据转化为数值数据

最新推荐文章于 2024-07-28 21:01:31 发布

哎呦-_-不错

最新推荐文章于 2024-07-28 21:01:31 发布

阅读量5.4k

点赞数 4

分类专栏： # 基础进阶文章标签：类别数据转化为数值数据

本BLOG上原创文章未经本人许可，不得用于商业用途，转载请注明出处。

本文链接：https://blog.csdn.net/weixin_46649052/article/details/112365453

版权

基础进阶专栏收录该内容

46 篇文章 2 订阅

订阅专栏

文章目录

LabelEncoder

# 数据预处理-将类别数据转化为数值数据
import numpy as np
import pandas as pd
from sklearn.preprocessing import LabelEncoder


# 加载数据
def loaddata():
    columns = ['sepal_length', 'speal_width', 'petal_length', 'petal_width', 'type']
    data = pd.read_csv('data/iris.data', header=None, names=columns)
    data = data.values
    X = data[:, :-1]
    y = data[:, -1]
    return X, y


if __name__ == '__main__':
    # 加载数据
    X, y = loaddata()
    # 获取标签
    label = np.unique(y)

    le = LabelEncoder()
    le.fit(label)
    y = le.transform(y)
    print(y)

pd.Catrgorical(series).codes

# 数据预处理-将类别数据转化为数值数据
import numpy as np
import pandas as pd


# 加载数据
def loaddata():
    columns = ['sepal_length', 'speal_width', 'petal_length', 'petal_width', 'type']
    data = pd.read_csv('data/iris.data', header=None, names=columns)
    # 将类别信息转化为数值信息
    data['type'] = pd.Categorical(data['type']).codes
    data = data.values
    X = data[:, :-1]
    y = data[:, -1]
    return X, y


if __name__ == '__main__':
    # 加载数据
    X, y = loaddata()
    print(y)

字典映射

# 数据预处理-将类别数据转化为数值数据
import numpy as np
import pandas as pd


# 加载数据
def loaddata():
    columns = ['sepal_length', 'speal_width', 'petal_length', 'petal_width', 'type']
    data = pd.read_csv('iris.data', header=None, names=columns)
    # 将类别信息转化为数值信息
    data['type'] = data['type'].map({'Iris-setosa':0,'Iris-versicolor':1,'Iris-virginica':2}).astype(int)
    data = data.values
    X = data[:, :-1]
    y = data[:, -1]
    return X, y


if __name__ == '__main__':
    # 加载数据
    X, y = loaddata()
    print(y)

[0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0.
 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0.
 0. 0. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1.
 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1. 1.
 1. 1. 1. 1. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2.
 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2. 2.
 2. 2. 2. 2. 2. 2.]