Search alternatives:
based optimization » whale optimization (Expand Search)
class optimization » phase optimization (Expand Search), cost optimization (Expand Search), task optimization (Expand Search)
primary target » primary care (Expand Search)
target class » target cells (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
based optimization » whale optimization (Expand Search)
class optimization » phase optimization (Expand Search), cost optimization (Expand Search), task optimization (Expand Search)
primary target » primary care (Expand Search)
target class » target cells (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
-
1
-
2
-
3
-
4
Sample image for illustration.
Published 2024“…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“…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“…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“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
8
Quadratic polynomial in 2D image plane.
Published 2024“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
9
CIAHS-Data.xls
Published 2025“…This method identifies inherent natural grouping points within the data through the Jenks optimization algorithm, maximizing between-class differences while minimizing within-class differences37. …”