Search alternatives:
score optimization » before optimization (Expand Search), swarm optimization (Expand Search), dose optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
image score » image scale (Expand Search), climate score (Expand Search), immune score (Expand Search)
binary ai » binary _ (Expand Search), binary pairs (Expand Search)
ai codon » ai coding (Expand Search), _ codon (Expand Search)
score optimization » before optimization (Expand Search), swarm optimization (Expand Search), dose optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
image score » image scale (Expand Search), climate score (Expand Search), immune score (Expand Search)
binary ai » binary _ (Expand Search), binary pairs (Expand Search)
ai codon » ai coding (Expand Search), _ codon (Expand Search)
-
1
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…Pixel paths were classified using a z-score brightness threshold of 1.21, optimized for noise reduction and accuracy. …”
-
2
Sample image for illustration.
Published 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. …”
-
3
-
4
Quadratic polynomial in 2D image plane.
Published 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. …”
-
5
Comparison analysis of computation time.
Published 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. …”
-
6
Process flow diagram of CBFD.
Published 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. …”
-
7
Precision recall curve.
Published 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. …”
-
8
-
9
-
10
-
11
DataSheet_1_Multi-Parametric MRI-Based Radiomics Models for Predicting Molecular Subtype and Androgen Receptor Expression in Breast Cancer.docx
Published 2021“…We applied several feature selection strategies including the least absolute shrinkage and selection operator (LASSO), and recursive feature elimination (RFE), the maximum relevance minimum redundancy (mRMR), Boruta and Pearson correlation analysis, to select the most optimal features. We then built 120 diagnostic models using distinct classification algorithms and feature sets divided by MRI sequences and selection strategies to predict molecular subtype and AR expression of breast cancer in the testing dataset of leave-one-out cross-validation (LOOCV). …”
-
12