Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
-
41
-
42
Ms.FPOP: A Fast Exact Segmentation Algorithm with a Multiscale Penalty
Published 2024“…This penalty was proposed by Verzelen et al. and achieves optimal rates for changepoint detection and changepoint localization in a non-asymptotic scenario. Our proposed algorithm, Multiscale Functional Pruning Optimal Partitioning (Ms.FPOP), extends functional pruning ideas presented in Rigaill and Maidstone et al. to multiscale penalties. …”
-
43
-
44
-
45
-
46
-
47
-
48
Summary of results of naïve Bayes algorithms.
Published 2024“…Algorithms trained without auditory variables as features were statistically worse (p < .001) in both the primary measure of area under the curve (0.82/0.78) and the secondary measure of accuracy (72.3%/74.5%) for the Gaussian and kernel algorithms respectively.…”
-
49
-
50
-
51
Performance of the three algorithms.
Published 2024“…An integrated framework based on a novel genetic algorithm and the Frank—Wolfe algorithm is designed to solve the stochastic model. …”
-
52
-
53
Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic
Published 2019“…These implementations need to utilize high-precision arithmetic, and are programmed in the Python programming language. A thorough comparison with existing R functions allows the identification of cases when the latter fail, and provide further guidance to their use.…”
-
54
-
55
Brief sketch of the quasi-attraction/alignment algorithm.
Published 2023“…The focal agent selects its next direction randomly based on . (D) A brief sketch of the avoidance algorithm. Upper: Each direction is extended to the repulsion area = {<b><i>r</i></b>||<b><i>r</i></b>| = <i>R</i>}, where is the minimal sphere cap that covers all points on . …”
-
56
-
57
-
58
-
59
-
60
Algorithms for Sparse Support Vector Machines
Published 2022“…Penalties still appear, but serve a different purpose. The proximal distance principle takes a loss function <math><mrow><mi>L</mi><mo>(</mo><mi>β</mi><mo>)</mo></mrow></math> and adds the penalty <math><mrow><mi>ρ</mi><mn>2</mn>dist<mrow><mrow><mo>(</mo><mi>β</mi><mo>,</mo><msub><mrow><mi>S</mi></mrow><mi>k</mi></msub><mo>)</mo></mrow></mrow><mn>2</mn></mrow></math> capturing the squared Euclidean distance of the parameter vector <math><mi>β</mi></math> to the sparsity set <i>S<sub>k</sub></i> where at most <i>k</i> components of <math><mi>β</mi></math> are nonzero. …”