2022高教社杯全国大学生数学建模竞赛C题 问题一(3) Python代码

已于 2024-09-17 21:12:59 修改
阅读量381 收藏 7
点赞数 10
分类专栏： 数学建模 文章标签： 数学建模 python 回归 机器学习 数据可视化
于 2024-09-17 19:42:41 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_45481473/article/details/142316231
版权

目录

1.3 根据风化点检测数据，预测其风化前的化学成分含量

在这里插入图片描述

数据重塑

import numpy as np

df= pd.DataFrame(columns=['文物编号','风化标记', '化学成分含量', '化学成分标签',
                         '纹饰','类型','颜色','表面风化'], 
                 index=range(d12.shape[0]*14))
df['文物编号'] = list(d12['文物编号']) * 14
df['风化标记'] = list(d12['风化标记']) * 14
df['纹饰'] = list(d12['纹饰']) * 14
df['类型'] = list(d12['类型']) * 14
df['颜色'] = list(d12['颜色']) * 14
df['表面风化'] = list(d12['表面风化']) * 14
df['化学成分标签'] = list(np.repeat(list(d12.columns[6:20]), d12.shape[0]))

a = list(d12.iloc[:,6])
for i in range(7,20):
    a.extend(d12.iloc[:,i])
df['化学成分含量'] = a
df.head()
文物编号风化标记化学成分含量化学成分标签纹饰类型颜色表面风化
01其它69.33二氧化硅(SiO2)C高钾蓝绿无风化
12其它36.28二氧化硅(SiO2)A铅钡浅蓝风化
23其它87.05二氧化硅(SiO2)A高钾蓝绿无风化
33其它61.71二氧化硅(SiO2)A高钾蓝绿无风化
44其它65.88二氧化硅(SiO2)A高钾蓝绿无风化

数据可视化

import plotly.express as px
fig = px.box(df, x="化学成分标签", y="化学成分含量", color="风化标记")
# remove background color
fig.update_layout({'plot_bgcolor': 'rgba(0, 0, 0, 0)',})
fig.show()

在这里插入图片描述

import pandas as pd
import matplotlib.pyplot as plt
import seaborn as sns
import sklearn
import warnings
 
from sklearn.preprocessing import LabelEncoder
from sklearn.impute import KNNImputer
from sklearn.model_selection import train_test_split
from sklearn.preprocessing import StandardScaler
from sklearn.metrics import f1_score
from sklearn.ensemble import RandomForestRegressor
from sklearn.ensemble import RandomForestRegressor
from sklearn.model_selection import cross_val_score
 
warnings.filterwarnings('ignore')

# 颜色 rows with na
# 由于在风化及未风化的玻璃中，均是‘浅蓝’颜色的玻璃频数最高，这里选择使用众数进行缺失值填补
index = pd.isna(df['颜色'])
index = np.where(index)[0]
df.iloc[index,6] = '浅蓝'

df.info()

<class 'pandas.core.frame.DataFrame'>
RangeIndex: 938 entries, 0 to 937
Data columns (total 8 columns):
 #   Column  Non-Null Count  Dtype  
---  ------  --------------  -----  
 0   文物编号    938 non-null    int64  
 1   风化标记    938 non-null    object 
 2   化学成分含量  938 non-null    float64
 3   化学成分标签  938 non-null    object 
 4   纹饰      938 non-null    object 
 5   类型      938 non-null    object 
 6   颜色      938 non-null    object 
 7   表面风化    938 non-null    object 
dtypes: float64(1), int64(1), object(6)
memory usage: 58.8+ KB

import pandas as pd
from sklearn.ensemble import RandomForestRegressor
from sklearn.preprocessing import LabelEncoder

# reorder columns
df = df.iloc[:,[0,2,1] + list(range(3,8))]

# data encode
# Check for and handle categorical variables
label_encoder = LabelEncoder()
x_categorical = df.select_dtypes(include=['object']).apply(label_encoder.fit_transform)
x_numerical = df.select_dtypes(exclude=['object']).values

df_encode = pd.concat([pd.DataFrame(x_numerical), x_categorical], axis=1)
df_encode.rename(columns = {0:'文物编号', 1:'化学成分含量'}, 
                 inplace = True)
df_encode.head()
文物编号化学成分含量风化标记化学成分标签纹饰类型颜色表面风化
01.069.33102160
12.036.28100011
23.087.05100160
33.061.71100160
44.065.88100160
X = df_encode.drop('化学成分含量', axis=1)
y = df_encode['化学成分含量']

X_train, X_test, y_train, y_test = train_test_split(X, y, 
                                 test_size=0.2, random_state=1)

回归

随机森林回归

https://www.geeksforgeeks.org/random-forest-regression-in-python/

# Fitting Random Forest Regression to the dataset
RF = RandomForestRegressor(n_estimators=10, random_state=0, oob_score=True)
 
# Fit the regressor with x and y data
RF.fit(X_train, y_train)

# Evaluating the model
from sklearn.metrics import mean_squared_error, r2_score
 
# Access the OOB Score
oob_score = RF.oob_score_
print(f'Out-of-Bag Score: {oob_score}')
 
# Making predictions on the same data or new data
predictions = RF.predict(X_test)
 
# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Out-of-Bag Score: 0.858876239921834
Mean Squared Error: 18.621843142992024
R-squared: 0.9440368907222724
XGboost回归
import numpy as np 
import pandas as pd 
import xgboost as xg 
from sklearn.model_selection import train_test_split 
from sklearn.metrics import mean_squared_error as MSE 

xgb_r = xg.XGBRegressor(objective ='reg:linear', 
                  n_estimators = 10, seed = 123)
xgb_r.fit(X_train, y_train) 

[14:07:55] WARNING: /workspace/src/objective/regression_obj.cu:167: reg:linear is now deprecated in favor of reg:squarederror.





XGBRegressor(base_score=0.5, booster=None, colsample_bylevel=1,
             colsample_bynode=1, colsample_bytree=1, gamma=0, gpu_id=-1,
             importance_type='gain', interaction_constraints=None,
             learning_rate=0.300000012, max_delta_step=0, max_depth=6,
             min_child_weight=1, missing=nan, monotone_constraints=None,
             n_estimators=10, n_jobs=0, num_parallel_tree=1,
             objective='reg:linear', random_state=123, reg_alpha=0,
             reg_lambda=1, scale_pos_weight=1, seed=123, subsample=1,
             tree_method=None, validate_parameters=False, verbosity=None)

predictions = xgb_r.predict(X_test) 

# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Mean Squared Error: 31.125352266521848
R-squared: 0.9064608440301115
Gradient Boosting回归
#importing libraries  
import pandas as pd 
import numpy as np 
import seaborn as sb 
import matplotlib.pyplot as plt 
import lightgbm as lgb 

from sklearn.preprocessing import StandardScaler 
from sklearn.model_selection import train_test_split 

from sklearn.ensemble import GradientBoostingRegressor

GB = GradientBoostingRegressor()
GB.fit(X_train, y_train)

# Making predictions on the same data or new data
predictions = GB.predict(X_test)
 
# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Mean Squared Error: 44.14340281131733
R-squared: 0.8673384768386802
LightGBM回归
from lightgbm import LGBMRegressor

gbm = LGBMRegressor()
gbm.fit(X_train, y_train)

[LightGBM] [Info] Auto-choosing row-wise multi-threading, the overhead of testing was 0.000067 seconds.
You can set `force_row_wise=true` to remove the overhead.
And if memory is not enough, you can set `force_col_wise=true`.
[LightGBM] [Info] Total Bins 89
[LightGBM] [Info] Number of data points in the train set: 750, number of used features: 7
[LightGBM] [Info] Start training from score 6.549480
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf
[LightGBM] [Warning] No further splits with positive gain, best gain: -inf

LGBMRegressor()

# Making predictions on the same data or new data
predictions = gbm.predict(X_test)
 
# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Mean Squared Error: 38.507655924247906
R-squared: 0.8842752492344551
CatBoost回归
import catboost
from catboost import CatBoostRegressor

cat = CatBoostRegressor(verbose=0, n_estimators=100)
cat.fit(X_train, y_train)

# Making predictions on the same data or new data
predictions = cat.predict(X_test)
 
# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Mean Squared Error: 19.8730131181204
R-squared: 0.94027682457278
决策树回归
from sklearn.tree import DecisionTreeRegressor
tree = DecisionTreeRegressor(random_state=0)
tree.fit(X_train, y_train)

# Making predictions on the same data or new data
predictions = tree.predict(X_test)
 
# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Mean Squared Error: 18.104645212765963
R-squared: 0.9455911946687293
MLP回归
from sklearn.neural_network import MLPRegressor

mlp = MLPRegressor(random_state=0)
mlp.fit(X_train, y_train)

# Making predictions on the same data or new data
predictions = mlp.predict(X_test)
 
# Evaluating the model
mse = mean_squared_error(y_test, predictions)
print(f'Mean Squared Error: {mse}')
 
r2 = r2_score(y_test, predictions)
print(f'R-squared: {r2}')

Mean Squared Error: 213.8644123666194
R-squared: 0.3572860974079113

预测

# generate test data
df_pred = df_encode[df_encode['表面风化'] == 1]
df_pred_origin = df[df_encode['表面风化'] == 1]

# 设置风化前的数据
df_pred['表面风化'] = 0
X_pred = df_pred.drop('化学成分含量', axis=1)
X_pred
文物编号风化标记化学成分标签纹饰类型颜色表面风化
12.0100010
87.0101160
98.0102040
108.0002040
119.0101160
........................
93254.0112010
93354.0012010
93556.0112060
93657.0112060
93758.0112010

588 rows × 7 columns

predictions = RF.predict(X_pred)

df_pred_origin = df_pred_origin.drop('表面风化', axis=1)
df_pred_origin['风化前预测'] = predictions
df_pred_origin.head()
文物编号化学成分含量风化标记化学成分标签纹饰类型颜色风化前预测
1236.28其它二氧化硅(SiO2)A铅钡浅蓝41.3435
8792.63其它二氧化硅(SiO2)B高钾蓝绿60.9480
9820.14其它二氧化硅(SiO2)C铅钡紫37.7020
1084.61严重风化点二氧化硅(SiO2)C铅钡紫28.9610
11995.02其它二氧化硅(SiO2)B高钾蓝绿64.2920

数据复原

# for the samples that have two testing points, we consider the mean of the predicted values
dual = list(df_pred['文物编号'].value_counts().index[0:8])
labels = list(df_pred_origin['化学成分标签'].unique())
pre_mean = pd.DataFrame(columns=['文物编号','化学成分标签','风化前预测'], 
                 index=range(len(dual) * len(labels)))
pre_mean['文物编号'] = list(np.repeat(dual, len(labels)))
pre_mean['化学成分标签'] = labels * len(dual)

for i in dual:
    i = int(i)
    for j in labels:
        if dual[0] in list(df_pred_origin['文物编号'].unique()):
            index = np.where((df_pred_origin['文物编号'] == i) & (df_pred_origin['化学成分标签'] == j))[0]
            pre_mean.iloc[dual.index(i)*len(labels) + labels.index(j),2] = df_pred_origin.iloc[index,7].mean()

my_index = []
for i in list(df_pred_origin.iloc[:,0]):
    if i not in dual:
        my_index.append(i)

df_pred_origin.index = range(df_pred_origin.shape[0])
my_index = []
for i in list(df_pred_origin.index):
    if df_pred_origin.iloc[i,0] not in dual:
        my_index.append(i)

df_pred_origin_sub1 = df_pred_origin.iloc[my_index,[0,3,7]]
df_pred_origin_sub1.head()
文物编号化学成分标签风化前预测
02二氧化硅(SiO2)41.3435
17二氧化硅(SiO2)60.9480
49二氧化硅(SiO2)64.2920
510二氧化硅(SiO2)64.2120
611二氧化硅(SiO2)41.2345
pre_mean.head()
文物编号化学成分标签风化前预测
050.0二氧化硅(SiO2)51.22975
150.0氧化钠(Na2O)0.694
250.0氧化钾(K2O)0.033
350.0氧化钙(CaO)2.6215
450.0氧化镁(MgO)0.7615
df_merge = pd.concat([df_pred_origin_sub1, pre_mean])
df_merge = df_merge.sort_values(['化学成分标签', '文物编号'], ascending=[True, True])
df_merge
文物编号化学成分标签风化前预测
02.0二氧化硅(SiO2)41.3435
17.0二氧化硅(SiO2)60.948
288.0二氧化硅(SiO2)33.3315
49.0二氧化硅(SiO2)64.292
510.0二氧化硅(SiO2)64.212
............
20453.0氧化镁(MgO)1.02
6054.0氧化镁(MgO)0.8755
20756.0氧化镁(MgO)0.0
20857.0氧化镁(MgO)0.0
20958.0氧化镁(MgO)0.743

476 rows × 3 columns

nrow = len(df_merge['文物编号'].unique())
ncol = len(df_merge['化学成分标签'].unique())

df_shape = np.array(df_merge['风化前预测']).reshape(ncol, nrow)
df_results = pd.DataFrame(np.transpose(df_shape), 
             columns = list(df_merge.iloc[:,1].unique()),
             index = list(df_merge.iloc[:,0].unique()))

columns_order = list(d2.columns)[1:15]
df_results = df_results.reindex(columns=columns_order)

for i in range(df_results.shape[0]):
    df_results.iloc[i,:] = df_results.iloc[i,:] / list(df_results.sum(axis=1) / 100)[i]

df_results.to_csv('/home/shiyu/Desktop/path_acdemic/ant/数模/历年题目/2022/output/df_results.csv', index=True)

相关阅读：

data learning
关注
专栏目录
2022 年高教社杯全国大学生数学建模竞赛-C 题 古代玻璃制品的成分分析与鉴别详解+Python代码源码
master_hunter的博客
04-11 1987
简单介绍一下我自己：博主专注建模四年，参与过大大小小数十来次数学建模，理解各类模型原理以及每种模型的建模流程和各类题目分析方法。参与过十余次数学建模大赛，三次美赛获得过二次M奖一次H奖，国赛二等奖。**提供免费的思路和部分源码，以后的数模比赛只要我还有时间肯定会第一时间写出免费开源思路。**博主紧跟各类数模比赛，每场数模竞赛博主都会将最新的思路和代码写进此专栏以及详细思路和完全代码且完全免费。希望有需求的小伙伴不要错过笔者精心打造的文章。
2024 年高教社杯全国大学生数学建模竞赛 E 题 交通流量管控 python代码
m0_52343631的博客
09-06 915
【代码】2024 年高教社杯全国大学生数学建模竞赛 E 题 交通流量管控 python代码。
2024高教社杯全国大学生数学建模竞赛C题保姆级分析完整思路+代码+数据教学
ivanlj的博客
09-05 1万+
2024高教社杯全国大学生数学建模竞赛C题保姆级分析完整思路+代码+数据教学 C题题目：农作物的种植策略 今年的题目很有意思，和去年C题题目相关联了，接下来我们将按照题目总体分析-背景分析-各小问分析的形式来 1总体分析 1.1问题背景： 该乡村位于华北山区，温度较低，耕地有限且地块分散，包含露天耕地和不同类型的大棚。不同地块适合种植不同类型的农作物，需根据当地条件选择合适的作物，并避免连续重茬种植。
2024高教社杯全国大学生数学建模竞赛C题原创python代码
ivanlj的博客
09-06 4310
以下均为python代码，推荐用anaconda中的notebook当作编译环境。2024高教社杯全国大学生数学建模竞赛C题原创python代码。思路可以参考我主页之前的文章。
2020年高教社杯全国大学生数学建模竞赛C题 第一问详细解答+代码
热门推荐
yasNing
06-05 3万+
2020年高教社杯全国大学生数学建模竞赛C题 第一问详细解答+代码 本文摘自小编自己的参赛论文与经历,小编获得了2020年高教社杯国奖，有问题的同学们可私聊博主哦。 1. 问题分析 问题一主要围绕信贷风险和信贷策略展开，其中信贷策略又包括是否 放贷 、贷款额度、利率和期限等 。首先，我们应该对企业的信贷风险进行量化评估。 影响信贷风险的因素是多方面的 而依据题意，信贷风险主要依据企业实力和信誉来衡量。对于 多因素影响的问题， 应该对因素进行权重 划分 ，由此我们考虑对企业实力和信誉这两个因素进行加权，
2023 年高教社杯全国大学生数学建模竞赛题目-C 题 蔬菜类商品的自动定价与补货决策（包含源代码、解题策略）
10-26
问题 1 蔬菜类商品不同品类或不同单品之间可能存在一定的关联关系，请分析蔬菜各 品类及单品销售量的分布规律及相互关系。 问题 2 考虑商超以品类为单位做补货计划，请分析各蔬菜品类的销售总量与成本加成 定价的...
2024 年高教社杯全国大学生数学建模竞赛 C 题 农作物的种植策略（详细思路+matlab代码+python代码+论文范例）
09-07
2024 年高教社杯全国大学生数学建模竞赛 C 题 农作物的种植策略（详细思路+matlab代码+python代码+论文范例）
2023年高教社杯全国大学生数学建模竞赛-完整赛题及数据
09-08
在2023年的高教社杯全国大学生数学建模竞赛中，参赛者们将面临一系列挑战性的赛题，这些赛题通常涵盖了现实生活中的各种问题，涉及自然科学、社会科学、工程技术等多个领域。 数学建模是应用数学解决实际问题的一种...
数学建模常用模型全面总结（含适用条件、优点、局限性和应用场景）
qq_63913621的博客
09-14 1106
数学建模常用模型全面总结（含适用条件、优点、局限性和应用场景）
Python 数学建模——Prophet 时间序列预测
wr114514的博客
09-11 1522
介绍如何使用 Python 库 Prophet 进行时间序列分析，以及一些参数的含义和设置。
2024国赛数学建模预测算法-BP神经网络模型的预测精度分析（MATLAB 实现）
weixin_43608857的博客
09-05 2217
在您阅读这本书的时候，大约有个相互连接的神经元在帮助您阅读、呼吸、思考，以及完成各种各样的动作。这些神经元中，有些有着与生俱来的功能，比如呼吸、吮吸，有些则是由后天训练得到的，比如阅读、语言。虽然人们并不完全清楚生物的神经网络是如何工作的，但是根据神经元的基本工作原理而构造的“人工神经元”，可以模拟“人脑”的某些功能，这就是本部分所要讨论的内容。人工神经网络（Artificial Neural Network，ANN）是在人类对大脑神经网络认识理解的基础上人工构造的能够实现某种功能的神经网络。
【数学建模】2024数学建模国赛经验分享
风高秋月白，雨霁晚霞红
09-04 1万+
国赛经验分享。
认识数学建模，什么是数学建模
qq_63913621的博客
09-13 1146
数学建模（Mathematical Modeling）是一种利用数学语言、结构和方法，对实际问题进行描述、简化、分析和求解的过程。其核心在于通过将复杂的现实世界问题转化为可操作的数学形式，从而利用数学理论和计算技术对其进行深入研究和解决。数学建模涉及对系统的基本组成和关系进行抽象和简化。模型的形式可以多种多样，包括代数方程、微分方程、概率模型、优化模型、统计模型等。无论其形式如何，模型的最终目标都是为现实问题提供有意义的解释和预测，以支持决策制定和实际应用。
2024年数学建模比赛题目及解题代码
yz_518的博客
09-12 1880
1.1.1数学建模竞赛概述数学建模竞赛，作为一项集知识性、创新性与实践性于一体的国际性赛事，旨在培养学生运用数学理论与方法解决实际问题的能力。它要求参赛者针对现实生活中的复杂问题，通过深入的分析、抽象与建模，最终提出科学合理的解决方案。数学建模竞赛不仅考验了学生的数学基础，更重要的是锻炼了他们的逻辑思维能力、团队合作精神以及创新能力。在这个过程中，学生需要将抽象的数学理论与具体的应用场景相结合，创造出既有理论深度又具实用价值的模型。
Python 数学建模——Pearson/Spearman 相关系数
wr114514的博客
09-11 947
介绍了两种相关系数——Peason 相关系数和 Spearman 相关系数，并使用 Python 库求取它们。
【数学建模】相关系数
shaozheng0503的博客
09-12 1131
总体与样本总体：指研究对象的全体，比如全国人口普查数据。样本：从总体中抽取的一部分个体，如通过问卷调查收集的学生数据。皮尔逊相关系数总体皮尔逊相关系数：衡量两个变量之间的线性相关性。它是将两个变量标准化后的协方差，消除了量纲的影响。样本皮尔逊相关系数：与总体相关系数类似，但在计算时分母为(n-1)而不是(n)，这是为了更好地估计总体相关系数。相关性可视化：通过绘制散点图来直观展示两个变量之间的相关性。Excel中的美化步骤调整单元格格式为正方形。设置文本居中对齐。
数学建模常用模型---“算法”总结（含特性和应用场景）
qq_63913621的博客
09-14 1445
常用算法线性方程求解算法：如高斯消元法、LU分解等，用于解线性方程组。非线性方程求解算法：如牛顿-拉夫森法、割线法、二分法，用于解非线性方程组。应用场景快速解算简单的静态模型，如工程计算中的电路分析、经济平衡问题等。
Python 数学建模——cvxpy 规划求解器
最新发布
wr114514的博客
09-14 1179
介绍了 Python 的 cvxpy 规划求解器，可以用于求解线性规划、非线性规划、整数规划，0-1 规划等常见的规划问题。
Python 数学建模——灰色关联度分析
wr114514的博客
09-12 963
介绍了灰色关联度的使用，并与 Pearson/Spearman 相关系数进行了对比。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值