Results 41 to 50 of about 3,949,706 (285)
Hypergraph Spectra for Unsupervised Feature Selection [PDF]
Most existing feature selection methods focus on ranking individual features based on a utility criterion, and select the optimal feature set in a greedy manner. However, the feature combinations found in this way do not give optimal classification performance, since they neglect the correlations among features.
Zhihong Zhang 0001, Edwin R. Hancock
openaire +1 more source
Unsupervised Feature Selection With Ordinal Preserving Self-Representation
Unsupervised feature selection is designed to select an optimal feature subset without any label information from high-dimensional data, which is implemented by eliminating the irrelevant and redundant features and has been attracted widespread attention
Jiangyan Dai +6 more
doaj +1 more source
The open-circuit faults of power semiconductor devices in multilevel converters are generally diagnosed by analyzing circuit signals. For converters with five or more levels, the difficulty of fault detection increases with increasing topological ...
Shu Ye +4 more
doaj +1 more source
SHAP-Based Feature Selection for Enhanced Unsupervised Labeling
Manual dataset labeling is expensive, time-consuming, and susceptible to noise and inaccuracies, often necessitating significant financial investments with risks of inconsistencies from human annotations.
Mary Anne Walauskis +1 more
doaj +1 more source
Feature selection plays an important role in preprocessing in pattern recognition and data mining, especially in large scale image, digital text, and biological data.
Yintong Wang
doaj +1 more source
Efficient Feature Ranking and Selection Using Statistical Moments
Unsupervised feature selection methods can be more efficient than supervised methods, which rely on the expensive and time-consuming data labeling process.
Yael Hochma, Yuval Felendler, Mark Last
doaj +1 more source
Cluster Density Properties Define a Graph for Effective Pattern Feature Selection
Feature selection is a challenging problem that occurs in the high-dimensional data analysis of many major applications. It addresses the curse of dimensionality by determining a small set of features to represent high-dimensional data without ...
Khadidja Henni +2 more
doaj +1 more source
Background Feature selection of multi-omics data analysis remains challenging owing to the size of omics datasets, comprising approximately $$10^2$$ 10 2 – $$10^5$$ 10 5 features. In particular, appropriate methods to weight individual omics datasets are
Y-h. Taguchi, Turki Turki
doaj +1 more source
Unsupervised Feature Selection and Clustering Optimization Based on Improved Differential Evolution
The feature selection method based on supervised learning has been widely studied and applied to the field of machine learning and data mining. But unsupervised feature selection is still a tricky area of research because the unavailability of the label ...
Tao Li, Hongbin Dong
doaj +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source

