Representation of the feature selection algorithm. by Betty Wutzl (6945248)

Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. by Tehnan I. A. Mohamed (16846175)

Binary confusion matrix. by Chen Zhu (445894)

The maximum accuracy (lowest error rate) with the least number of ANOVA-ranked genes achieved by different feature filtering methods and classification algorithms refined by SIRRFE... by Song Cui (553627)

Schematic view of the overall algorithm. by Betty Wutzl (6945248)

Frequency-comparison plots for the eleven categories of linguistic features. by Olga Kellert (12254765)

<i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

“…<b>(C)</b> The whole training data is then scanned, searching for these sequences and deriving a re-encoded dataset where interaction terms are binary features (i.e., 1 if sequence <i>i</i> is observed in <i>j</i>-th patient genotype, 0 otherwise). …”

Sample image for illustration. by Indhumathi S. (19173013)

“…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. …”

Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

“…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. …”

Model training, optimisation, validation, and selection. by Maya Wardeh (4112014)

Comparison analysis of computation time. by Indhumathi S. (19173013)

“…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. …”

Process flow diagram of CBFD. by Indhumathi S. (19173013)

“…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. …”

Precision recall curve. by Indhumathi S. (19173013)

“…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. …”

Fortran & C++: design fractal-type optical diffractive element by I-Lin Ho (13768960)

“…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”

Reverse engineering information flow using stimulus-encoding and stimulus-transfer estimation algorithms. by Gabriel Matías Lorenz (21094672)

Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf by Cecilia Lindig-León (7889777)

“…In this way, for each binary problem, the CSP algorithm produces features to determine if the specific body part is engaged in the task or not. …”

Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”

Super.Complex identifies likely protein complexes within a PPI network using a distributed supervised AutoML method. by Meghana Venkata Palukuri (11890672)

Schematic overview of SINATRA Pro: A novel framework for discovering biophysical signatures that differentiate classes of proteins. by Wai Shing Tang (9541179)

“…<p><b>(A)</b> The SINATRA Pro algorithm requires the following inputs: <i>(i)</i> (<i>x</i>, <i>y</i>, <i>z</i>)-coordinates corresponding to the structural position of each atom in every protein; <i>(ii)</i> <b>y</b>, a binary vector denoting protein class or phenotype (e.g., mutant versus wild-type); <i>(iii)</i> <i>r</i>, the cutoff distance for simplicial construction (i.e., constructing the mesh representation for every protein); <i>(iv)</i> <i>c</i>, the number of cones of directions; <i>(v)</i> <i>d</i>, the number of directions within each cone; <i>(vi)</i> <i>θ</i>, the cap radius used to generate directions in a cone; and <i>(vii)</i> <i>l</i>, the number of sublevel sets (i.e., filtration steps) used to compute the differential Euler characteristic (DEC) curve along a given direction. …”

Data generation process. by Nicola Dietler (12551766)

“…The obtained sequences feature pairwise correlations and conservation arising from selection on the trait (via the Hamiltonian in <a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012091#pcbi.1012091.e004" target="_blank">Eq 1</a>). …”