固定随机种子. F1阈值搜索和F-0.3的实现

最新推荐文章于 2023-05-16 00:15:00 发布

junjian Li

最新推荐文章于 2023-05-16 00:15:00 发布

阅读量553

点赞数 1

分类专栏：比赛文章标签： pytorch 深度学习 python

本文链接：https://blog.csdn.net/qq_30129009/article/details/121533648

版权

比赛专栏收录该内容

6 篇文章 0 订阅

订阅专栏

固定随机种子

def set_seed(seed=42):
    random.seed(seed)
    os.environ['PYTHONHASHSEED'] = str(seed)
    np.random.seed(seed)
    
set_seed()

F1阈值搜索

def f_score_search(df):
    t0 = 0.01
    v = 0.001
    best_t = t0
    best_f = 0
    best_p, best_r = 0, 0
    for step in range(950):
        curr_t = t0 + step * v

        p, r, curr_f = f_beta(df_oof['pred'], df_oof['label'], threshold=curr_t)
        if curr_f > best_f:
            best_t = curr_t
            best_f = curr_f
            best_p = p
            best_r = r
    print(f'best threshold: {best_t},  precision={best_p}; recall={best_r};  best f_score: {best_f}')
    return best_t, best_f

F-0.3实现

def f_beta(y_hat, y_true,  threshold):

    y_hat = y_hat > threshold
    y_hat = np.int8(y_hat)
    
    true_positive = np.sum(y_hat*y_true, axis=0)
    false_positive = np.sum(y_hat*(1-y_true), axis=0)
    false_negative = np.sum((1-y_hat)*y_true, axis=0)
    
    precision = true_positive / (true_positive + false_positive )
    recall = true_positive / (true_positive + false_negative )

    f_score = (1 + (0.3 ** 2)) * precision * recall / ((0.3 ** 2) * precision + recall)
    
    return precision, recall, f_score