Results 1 to 10 of about 53,359 (288)

Utility metric for unsupervised feature selection [PDF]

open access: yesPeerJ Computer Science, 2021
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

Group Based Unsupervised Feature Selection [PDF]

open access: yesAdvances in Knowledge Discovery and Data Mining24th Pacific-Asia Conference, 2020
Unsupervised feature selection is an important task in machine learning applications, yet challenging due to the unavailability of class labels. Although a few unsupervised methods take advantage of external sources of correlations within feature groups in feature selection, they are limited to genomic data, and suffer poor accuracy because they ignore
Perera K, Chan J, Karunasekera S.
europepmc   +4 more sources

Unsupervised feature selection algorithm based on L 2,p-norm feature reconstruction. [PDF]

open access: yesPLoS ONE
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   +3 more sources

Unsupervised Feature Selection Algorithm Based on Dual Manifold Re-ranking [PDF]

open access: yesJisuanji kexue, 2023
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   +2 more sources

Multiview Data Clustering with Similarity Graph Learning Guided Unsupervised Feature Selection [PDF]

open access: yesEntropy, 2023
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]

open access: yesScientific Reports, 2022
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]

open access: yesJMIR Medical Informatics
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 using feature similarity [PDF]

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
In this article, we describe an unsupervised feature selection algorithm suitable for data sets, large in both dimension and size. The method is based on measuring similarity between features whereby redundancy therein is removed. This does not need any search and, therefore, is fast.
C A Murthy, Sankar K Pal
exaly   +2 more sources

Unsupervised Feature Selection Based on Self-configuration Approaches using Multidimensional Scaling

open access: yesJambura Journal of Mathematics, 2023
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

Augmentation of Densest Subgraph Finding Unsupervised Feature Selection Using Shared Nearest Neighbor Clustering

open access: yesAlgorithms, 2023
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

Home - About - Disclaimer - Privacy