Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
oneDAL
352
issues
39
pull requests
3,339
files
1
active branch
×
CodeFactor Rating A-
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
cpp\daal\include\algorithms\optimization_solver\objective_function\logistic_loss_batch.h
9
2
-
A
cpp\oneapi\dal\algo\sigmoid_kernel\test\overflow.cpp
5
2
-
A
cpp\oneapi\dal\algo\pca\detail\train_ops.cpp
4
2
1
A
cpp\daal\src\algorithms\low_order_moments\low_order_moments_csr_fast_distr_step2_fpt_dispatcher.cpp
2
2
-
A
cpp\oneapi\dal\algo\pca\detail\train_ops_dpc.cpp
4
2
1
A
cpp\daal\src\algorithms\linear_regression\linear_regression_group_of_betas_dense_default_batch_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\src\algorithms\classifier\binary_confusion_matrix_types.cpp
10
2
1
A
cpp\oneapi\dal\algo\pca\parameters\cpu\train_parameters.cpp
15
2
-
A
cpp\daal\src\algorithms\low_order_moments\low_order_moments_csr_fast_online_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\include\algorithms\naive_bayes\multinomial_naive_bayes_predict_types.h
1
2
-
A
cpp\daal\src\algorithms\kmeans\kmeans_init_dense_deterministic_distr_step1_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\src\algorithms\kmeans\kmeans_init_dense_deterministic_distr_step2_fpt_dispatcher.cpp
1
2
-
A
cpp\daal\src\algorithms\low_order_moments\low_order_moments_dense_singlepass_online_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\src\algorithms\low_order_moments\low_order_moments_csr_sum_batch_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\src\algorithms\classifier\classifier_predict.cpp
21
2
-
A
cpp\daal\include\algorithms\naive_bayes\multinomial_naive_bayes_quality_metric_set_batch.h
6
2
1
A
cpp\daal\src\algorithms\kmeans\kmeans_init_dense_parallelplus_batch_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\src\algorithms\classifier\classifier_predict_fpt.cpp
4
2
-
A
cpp\daal\src\algorithms\logitboost\logitboost_train_friedman_fpt_dispatcher.cpp
2
2
-
A
cpp\daal\src\algorithms\kmeans\kmeans_init_dense_parallelplus_distr_step1_fpt_dispatcher.cpp
2
2
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!