Search alternatives:
selection algorithm » detection algorithm (Expand Search), detection algorithms (Expand Search)
codon optimization » wolf optimization (Expand Search)
node selection » model selection (Expand Search), wide selection (Expand Search), nozzle selection (Expand Search)
binary game » binary image (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data node » data code (Expand Search), data model (Expand Search), data noise (Expand Search)
selection algorithm » detection algorithm (Expand Search), detection algorithms (Expand Search)
codon optimization » wolf optimization (Expand Search)
node selection » model selection (Expand Search), wide selection (Expand Search), nozzle selection (Expand Search)
binary game » binary image (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data node » data code (Expand Search), data model (Expand Search), data noise (Expand Search)
-
1
-
2
-
3
GSE96058 information.
Published 2024“…</p><p>Results</p><p>In this study, five main steps were followed for the analysis of mRNA expression data: reading, preprocessing, feature selection, classification, and SHAP algorithm. …”
-
4
The performance of classifiers.
Published 2024“…</p><p>Results</p><p>In this study, five main steps were followed for the analysis of mRNA expression data: reading, preprocessing, feature selection, classification, and SHAP algorithm. …”
-
5
Benchmarking of algorithms for unsupervised clustering of multi-omics data.
Published 2022“…(A) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, (B) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, (C) <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, , <i>K</i> ∈ {3, 5, 7, 9}; distance between centers set to medium (D) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 1000, <i>n</i><sub><i>b</i></sub> = 100, , algorithms were applied to the full data and a subset of data consisting of all binary nodes with non-zero standard deviation and 150 selected continuous nodes; distance between centers set to medium.…”
-
6
-
7
-
8
-
9
Clustering accuracy simulation: F1.
Published 2022“…(A) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, (B) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, (C) <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, , <i>K</i> ∈ {3, 5, 7, 9}; distance between centers set to medium (D) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 1000, <i>n</i><sub><i>b</i></sub> = 100, , algorithms were applied to the full data and a subset of data consisting of all binary nodes with non-zero standard deviation and 150 selected continuous nodes; distance between centers set to medium.…”
-
10
Clustering accuracy simulation: Precision.
Published 2022“…(A) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, (B) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, (C) <i>n</i><sub><i>c</i></sub> = 100, <i>n</i><sub><i>b</i></sub> = 20, , <i>K</i> ∈ {3, 5, 7, 9}; distance between centers set to medium (D) <i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 1000, <i>n</i><sub><i>b</i></sub> = 100, , algorithms were applied to the full data and a subset of data consisting of all binary nodes with non-zero standard deviation and 150 selected continuous nodes; distance between centers set to medium.…”
-
11
Clustering accuracy simulation: Strength of signal.
Published 2022“…<i>K</i> = 3, <i>n</i><sub><i>c</i></sub> = 1000, <i>n</i><sub><i>b</i></sub> = 100, , algorithms were applied to the full data and a subset of data consisting of all binary nodes with non-zero standard deviation and 150 selected continuous nodes; distance between centers set to medium. …”