Utility metric for unsupervised feature selection [PDF]
Feature selection techniques are very useful approaches for dimensionality reduction in data analysis. They provide interpretable results by reducing the dimensions of the data to a subset of the original set of features.
Amalia Villa +4 more
doaj +7 more sources
Unsupervised feature selection algorithm based on L 2,p-norm feature reconstruction. [PDF]
Traditional subspace feature selection methods typically rely on a fixed distance to compute residuals between the original and feature reconstruction spaces.
Wei Liu +5 more
doaj +2 more sources
Multiview Data Clustering with Similarity Graph Learning Guided Unsupervised Feature Selection [PDF]
In multiview data clustering, consistent or complementary information in the multiview data can achieve better clustering results. However, the high dimensions, lack of labeling, and redundancy of multiview data certainly affect the clustering effect ...
Ni Li, Manman Peng, Qiang Wu
doaj +2 more sources
Using the Kriging Correlation for unsupervised feature selection problems [PDF]
This paper proposes a KC Score to measure feature importance in clustering analysis of high-dimensional data. The KC Score evaluates the contribution of features based on the correlation between the original features and the reconstructed features in the
Cheng-Han Chua +2 more
doaj +2 more sources
Unsupervised Feature Selection to Identify Important ICD-10 and ATC Codes for Machine Learning on a Cohort of Patients With Coronary Heart Disease: Retrospective Study [PDF]
BackgroundThe application of machine learning in health care often necessitates the use of hierarchical codes such as the International Classification of Diseases (ICD) and Anatomical Therapeutic Chemical (ATC) systems.
Peyman Ghasemi, Joon Lee
doaj +2 more sources
Unsupervised Feature Selection Algorithm Based on Dual Manifold Re-ranking [PDF]
High dimensional data is often encountered in many data analysis tasks.Feature selection techniques aim to find the most representative features from the original high-dimensional data.Due to the lack of class label information,it is much more difficult ...
LIANG Yunhui, GAN Jianwen, CHEN Yan, ZHOU Peng, DU Liang
doaj +1 more source
Unsupervised Feature Selection Based on Self-configuration Approaches using Multidimensional Scaling
Some researchers often collect features so the principal information does not lose. However, many features sometimes cause problems. The truth of analysis results will decrease because of the irrelevant or repetitive features.
Ridho Ananda +4 more
doaj +1 more source
Improved SOCFS Algorithm Based on Triplet Ordinal Locality [PDF]
Features selection is commonly used in dimensionality reduction of machine learning,but existing unsupervised feature selection algorithms often ignore the influence of ordinal locality on feature selection while preserving the local structure of ...
WU Changming, ZHAO Xingtao, LIU Kexin
doaj +1 more source
Determining the optimal feature set is a challenging problem, especially in an unsupervised domain. To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature ...
Deepesh Chugh +5 more
doaj +1 more source
Robust Low-rank Self-representation Feature Selection Algorithm [PDF]
Since unsupervised feature selection algorithms do not have label information and also ignore the low-rank characteristics of the data,this paper proposes a new low-rank feature selection algorithm based on self-representation method.In the loss function,
HU Rongyao,LIU Xingyi,CHENG Debo,HE Wei,LUO Yan
doaj +1 more source

