gpt4 book ai didi

machine-learning - 一类 SVM 算法耗时太长

转载 作者:行者123 更新时间:2023-12-03 14:53:56 28 4
gpt4 key购买 nike

下面的数据显示了我的数据集的一部分,用于检测异常

    describe_file   data_numbers    index
0 gkivdotqvj 7309.0 0
1 hpwgzodlky 2731.0 1
2 dgaecubawx 0.0 2
3 NaN 0.0 3
4 lnpeyxsrrc 0.0 4

我使用了一类 SVM 算法来检测异常
from pyod.models.ocsvm import OCSVM
random_state = np.random.RandomState(42)
outliers_fraction = 0.05
classifiers = {
'One Classify SVM (SVM)':OCSVM(kernel='rbf', degree=3, gamma='auto', coef0=0.0, tol=0.001, nu=0.5, shrinking=True, cache_size=200, verbose=False, max_iter=-1, contamination=outliers_fraction)
}

X = data['data_numbers'].values.reshape(-1,1)

for i, (clf_name, clf) in enumerate(classifiers.items()):
clf.fit(X)
# predict raw anomaly score
scores_pred = clf.decision_function(X) * -1

# prediction of a datapoint category outlier or inlier
y_pred = clf.predict(X)
n_inliers = len(y_pred) - np.count_nonzero(y_pred)
n_outliers = np.count_nonzero(y_pred == 1)

# copy of dataframe
dfx = data[['index', 'data_numbers']]
dfx['outlier'] = y_pred.tolist()
IX1 = np.array(dfx['data_numbers'][dfx['outlier'] == 0]).reshape(-1,1)
OX1 = dfx['data_numbers'][dfx['outlier'] == 1].values.reshape(-1,1)
print('OUTLIERS : ',n_outliers,'INLIERS : ',n_inliers, clf_name)
# threshold value to consider a datapoint inlier or outlier
threshold = stats.scoreatpercentile(scores_pred,100 * outliers_fraction)

tOut = stats.scoreatpercentile(dfx[dfx['outlier'] == 1]['data_numbers'], np.abs(threshold))

y = dfx['outlier'].values.reshape(-1,1)
def severity_validation():
tOUT10 = tOut+(tOut*0.10)
tOUT23 = tOut+(tOut*0.23)
tOUT45 = tOut+(tOut*0.45)
dfx['test_severity'] = "None"
for i, row in dfx.iterrows():
if row['outlier']==1:
if row['data_numbers'] <=tOUT10:
dfx['test_severity'][i] = "Low Severity"
elif row['data_numbers'] <=tOUT23:
dfx['test_severity'][i] = "Medium Severity"
elif row['data_numbers'] <=tOUT45:
dfx['test_severity'][i] = "High Severity"
else:
dfx['test_severity'][i] = "Ultra High Severity"

severity_validation()

from sklearn.model_selection import train_test_split
X_train, X_test, Y_train, Y_test = train_test_split(dfx[['index','data_numbers']], dfx.outlier, test_size=0.25,
stratify=dfx.outlier, random_state=30)

#Instantiate Classifier
normer = preprocessing.Normalizer()
svm1 = svm.SVC(probability=True, class_weight={1: 10})

cached = mkdtemp()
memory = Memory(cachedir=cached, verbose=3)
pipe_1 = Pipeline(steps=[('normalization', normer), ('svm', svm1)], memory=memory)

cv = skl.model_selection.KFold(n_splits=5, shuffle=True, random_state=42)

param_grid = [ {"svm__kernel": ["linear"], "svm__C": [0.5]}, {"svm__kernel": ["rbf"], "svm__C": [0.5], "svm__gamma": [5]} ]
grd = GridSearchCV(pipe_1, param_grid, scoring='roc_auc', cv=cv)

#Training
y_pred = grd.fit(X_train, Y_train).predict(X_test)
rmtree(cached)

#Evaluation
confmatrix = skl.metrics.confusion_matrix(Y_test, y_pred)
print(confmatrix)
Y_pred = grd.fit(X_train, Y_train).predict_proba(X_test)[:,1]
def plot_roc(y_test, y_pred):
fpr, tpr, thresholds = skl.metrics.roc_curve(y_test, y_pred, pos_label=1)
roc_auc = skl.metrics.auc(fpr, tpr)
plt.figure()
lw = 2
plt.plot(fpr, tpr, color='darkorange', lw=lw, label='ROC curve (area ={0:.2f})'.format(roc_auc))
plt.plot([0, 1], [0, 1], color='navy', lw=lw, linestyle='--')
plt.xlim([0.0, 1.0])
plt.ylim([0.0, 1.05])
plt.xlabel('False Positive Rate')
plt.ylabel('True Positive Rate')
plt.title('Receiver operating characteristic example')
plt.legend(loc="lower right")
plt.show();
plot_roc(Y_test, Y_pred)



我的数据集很大,有数百万行。结果我只能运行几十万行。
代码工作得很好,但是它花费的时间太长,所以我希望能得到一些优化建议,以便我运行得更快。

最佳答案

SVM 训练时间随着样本数量的增加而严重扩展,通常为 O(n^2) 或更糟。因此它不适用于具有数百万个样本的数据集。可以找到一些用于探索的示例代码 here .

我建议尝试改为 IsolationForest ,它速度快,性能好。

如果您想使用 SVM,请对您的数据集进行子采样,以便拥有 10-100k 个样本。线性内核的训练速度也明显快于 RBF,但在大量样本的情况下仍然具有较差的可扩展性。

关于machine-learning - 一类 SVM 算法耗时太长,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/60724226/

28 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com