A comprehensive review of machine learning algorithms and their application in geriatric medicine: present and future
The increasing access to health data worldwide is driving a resurgence in machine learning
research, including data-hungry deep learning algorithms. More computationally efficient …
research, including data-hungry deep learning algorithms. More computationally efficient …
BMPA-TVSinV: A Binary Marine Predators Algorithm using time-varying sine and V-shaped transfer functions for wrapper-based feature selection
Z Beheshti - Knowledge-Based Systems, 2022 - Elsevier
The feature selection problem is one of the pre-processing mechanisms to find the optimal
subset of features from a dataset. The search space of the problem will exponentially grow …
subset of features from a dataset. The search space of the problem will exponentially grow …
Recognizing the differentiation degree of human induced pluripotent stem cell-derived retinal pigment epithelium cells using machine learning and deep learning …
CY Lien, TT Chen, ET Tsai, YJ Hsiao, N Lee, CE Gao… - Cells, 2023 - mdpi.com
Induced pluripotent stem cells (iPSCs) can be differentiated into mesenchymal stem cells
(iPSC-MSCs), retinal ganglion cells (iPSC-RGCs), and retinal pigmental epithelium cells …
(iPSC-MSCs), retinal ganglion cells (iPSC-RGCs), and retinal pigmental epithelium cells …
[HTML][HTML] Directed Clustering of Multivariate Data Based on Linear or Quadratic Latent Variable Models
Y Zhang, J Einbeck - Algorithms, 2024 - mdpi.com
We consider situations in which the clustering of some multivariate data is desired, which
establishes an ordering of the clusters with respect to an underlying latent variable. As our …
establishes an ordering of the clusters with respect to an underlying latent variable. As our …
Unsupervised Deep Embedded Clustering for High-Dimensional Visual Features of Fashion Images
Fashion image clustering is the key to fashion retrieval, forecasting, and recommendation
applications. Manual labeling-based clustering is both time-consuming and less accurate …
applications. Manual labeling-based clustering is both time-consuming and less accurate …
Robust unsupervised feature selection based on matrix factorization with adaptive loss via bi-stochastic graph regularization
X Song - Applied Intelligence, 2025 - Springer
Unsupervised feature selection (UFS) has gained increasing attention and research interest
in various domains, such as machine learning and data mining. Recently, numerous matrix …
in various domains, such as machine learning and data mining. Recently, numerous matrix …
Feature screening for clustering analysis
C Wang, Z Chen, R ** - arxiv preprint arxiv:2306.12671, 2023 - arxiv.org
In this paper, we consider feature screening for ultrahigh dimensional clustering analyses.
Based on the observation that the marginal distribution of any given feature is a mixture of its …
Based on the observation that the marginal distribution of any given feature is a mixture of its …
Tuning-free sparse clustering via alternating hard-thresholding
W Dong, C Xu, J **e, N Tang - Journal of Multivariate Analysis, 2024 - Elsevier
Abstract Model-based clustering is a commonly-used technique to partition heterogeneous
data into homogeneous groups. When the analysis is to be conducted with a large number …
data into homogeneous groups. When the analysis is to be conducted with a large number …
Feature Selection for Classification on High-Dimensional Data Using Swarm Optimization Algorithms
BJ Sowmya, A Kanavalli… - 2023 7th International …, 2023 - ieeexplore.ieee.org
Feature selection plays a crucial role in classification by identifying relevant features. Bio-
inspired algorithms, such as genetic algorithms, particle swarm optimization, and ant colony …
inspired algorithms, such as genetic algorithms, particle swarm optimization, and ant colony …
[PDF][PDF] Robust Cut for Hierarchical Clustering and Merge Trees
Hierarchical clustering arrange multi-dimensional data into a tree-like structure, organizing
the data by increasing levels of similarity. A cut of the tree divides data into clusters, where …
the data by increasing levels of similarity. A cut of the tree divides data into clusters, where …