بدائل البحث:
design optimization » bayesian optimization (توسيع البحث)
yet optimization » art optimization (توسيع البحث), lead optimization (توسيع البحث), path optimization (توسيع البحث)
image design » images designed (توسيع البحث), simple design (توسيع البحث), space design (توسيع البحث)
class yet » class left (توسيع البحث), class y (توسيع البحث)
design optimization » bayesian optimization (توسيع البحث)
yet optimization » art optimization (توسيع البحث), lead optimization (توسيع البحث), path optimization (توسيع البحث)
image design » images designed (توسيع البحث), simple design (توسيع البحث), space design (توسيع البحث)
class yet » class left (توسيع البحث), class y (توسيع البحث)
-
1
-
2
-
3
ROC and PR–AUC curves of the ABC–LR–RF hybrid model for IVF outcome prediction.
منشور في 2025الموضوعات: -
4
-
5
The comparison of the accuracy score of the benchmark and the proposed models.
منشور في 2025الموضوعات: -
6
-
7
-
8
The statistical description of the original data set of the patients (<i>n</i> = 162).
منشور في 2025الموضوعات: -
9
Comparison of baseline and hybrid machine learning models in predicting IVF outcomes (%).
منشور في 2025الموضوعات: -
10
-
11
-
12
The list of parameters of the modified data set for machine learning (<i>n</i> = 162).
منشور في 2025الموضوعات: -
13
-
14
Calibration curve of the ABC–LR–RF hybrid model for IVF outcome prediction.
منشور في 2025الموضوعات: -
15
<i>hi</i>PRS algorithm process flow.
منشور في 2023"…<b>(B)</b> Focusing on the positive class only, the algorithm exploits FIM (<i>apriori</i> algorithm) to build a list of candidate interactions of any desired order, retaining those that have an empirical frequency above a given threshold <i>δ</i>. …"
-
16
Sample image for illustration.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
17
Quadratic polynomial in 2D image plane.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
18
Comparison analysis of computation time.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
19
Process flow diagram of CBFD.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
20
Precision recall curve.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"