Search alternatives:
centrality algorithm » control algorithm (Expand Search), generation algorithm (Expand Search), density algorithm (Expand Search)
method algorithm » network algorithm (Expand Search), means algorithm (Expand Search), mean algorithm (Expand Search)
code algorithm » cosine algorithm (Expand Search), novel algorithm (Expand Search), modbo algorithm (Expand Search)
Showing 201 - 220 results of 689 for search '(((( element centrality algorithm ) OR ( element method algorithm ))) OR ( source code algorithm ))', query time: 0.48s Refine Results
  1. 201
    Log-likelihood as a function of the number of selected edges on the random graph dataset (black dashed line: The true number of edges).

    Log-likelihood as a function of the number of selected edges on the random graph dataset (black dashed line: The true number of edges). by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  2. 202
    Examples of ground-truth graph structures with (<i>p</i>, <i>n</i><sub>≠0</sub>) = (10, 10).

    Examples of ground-truth graph structures with (<i>p</i>, <i>n</i><sub>≠0</sub>) = (10, 10). by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  3. 203
    Number of edges selected through cross-validation on the chain graph dataset.

    Number of edges selected through cross-validation on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  4. 204
    Number of edges selected through cross-validation on the random graph dataset.

    Number of edges selected through cross-validation on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  5. 205
    Graphs of the regularization terms.

    Graphs of the regularization terms. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  6. 206
    F1 score of a given number of selected edges on the chain graph dataset.

    F1 score of a given number of selected edges on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  7. 207
    Computation time as a function of the number of variables on the chain graph dataset.

    Computation time as a function of the number of variables on the chain graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  8. 208
    Computation time as a function of the number of variables on the random graph dataset.

    Computation time as a function of the number of variables on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  9. 209
    F1 score of a given number of selected edges on the random graph dataset.

    F1 score of a given number of selected edges on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  10. 210
    F1 score of edges selected through cross-validation on the random graph dataset.

    F1 score of edges selected through cross-validation on the random graph dataset. by Tomokaze Shiratori (9635271)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  11. 211
    A Novel Multi-Speed Uniform Propagation Lattice Boltzmann Method Based on the Callaway Model for Unified Phonon Heat Transport

    A Novel Multi-Speed Uniform Propagation Lattice Boltzmann Method Based on the Callaway Model for Unified Phonon Heat Transport by Songcheng Li (21267944)

    Published 2025
    Save to List
    Saved in:
  12. 212
    Correlation matrices of handcrafted features before and after feature selection. The figure presents two heatmaps illustrating the correlation among 52 handcrafted features derived from the 3-level wavelet transform (WT) at four resolutions. These features were used as inputs for traditional ML algorithms. The left map demonstrates the correlation matrix of 52 features crafted from 4 resolutions of the 3-level WT, which are used as inputs for traditional ML algorithms. The heat map (on the right) is the correlation matrix after feature selection, in which features whose Pearson’s correlation coefficient is higher than 0.8 are considered highly correlated. We keep only one representative feature and remove its highly correlated features.

    Correlation matrices of handcrafted features before and after feature selection. The figure presents two heatmaps illustrating the correlation among 52 handcrafted features derived... by Quang Dung Dinh (20995766)

    Published 2025
    Save to List
    Saved in:
  13. 213
    Communication-Efficient Distributed Estimation and Inference for Cox’s Model

    Communication-Efficient Distributed Estimation and Inference for Cox’s Model by Pierre Bayle (21567081)

    Published 2025
    “…To construct confidence intervals for linear combinations of high-dimensional hazard regression coefficients, we introduce a novel debiased method, establish central limit theorems, and provide consistent variance estimators that yield asymptotically valid distributed confidence intervals. …”
    Save to List
    Saved in:
  14. 214
    Execution time comparisons between DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B) and Epi-SSA(P) on the DNME3 100 dataset.

    Execution time comparisons between DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B) and Epi-SSA(P) on the DNME3 100 dataset. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  15. 215
    F-measure comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DNME 1000 dataset.

    F-measure comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DNME 1000 dataset. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  16. 216
    Genes of the epistastic interactions detected on the seven GWAS data using Epi-SSA.

    Genes of the epistastic interactions detected on the seven GWAS data using Epi-SSA. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  17. 217
    Power comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DME 1000 dataset.

    Power comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DME 1000 dataset. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  18. 218
    Execution time comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DME 100 dataset.

    Execution time comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DME 100 dataset. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  19. 219
    The brief description on the WTCCC dataset.

    The brief description on the WTCCC dataset. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:
  20. 220
    F-measure comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DME 1000 dataset.

    F-measure comparisons between AntEpiSeeker(A), DECMDR(D), HS-MMGKG(G), SEE(S), SHEIB-AGM(B), SNPHarvester(H), SNPRuler(R) and Epi-SSA(P) on the DME 1000 dataset. by Liyan Sun (760586)

    Published 2024
    Subjects:
    Save to List
    Saved in:

Search Tools: