Results 241 to 250 of about 53,359 (288)

Multiple graph unsupervised feature selection

open access: yesSignal Processing, 2016
Feature selection improves the quality of the model by filtering out the noisy or redundant part. In the unsupervised scenarios, the selection is challenging due to the unavailability of the labels. To overcome that, the graphs which can unfold the geometry structure on the manifold are usually used to regularize the selection process. These graphs can
Xingzhong Du   +4 more
core   +6 more sources

A review of unsupervised feature selection methods

Artificial Intelligence Review, 2019
In recent years, unsupervised feature selection methods have raised considerable interest in many research areas; this is mainly due to their ability to identify and select relevant features without needing class label information. In this paper, we provide a comprehensive and structured review of the most relevant and recent unsupervised feature ...
Saul Solorio-Fernández   +2 more
exaly   +2 more sources

Unsupervised soft-label feature selection

Knowledge-Based Systems, 2021
Abstract Unsupervised feature selection is an important task in various research fields. It is difficult to select the discriminative features under unsupervised scenario due to the absence of label guidance. Recent works employ the pseudo labels to guide feature selection.
Lei Zhu, Jingjing Li, Huaxiang Zhang
exaly   +2 more sources

An unsupervised attribute clustering algorithm for unsupervised feature selection

open access: yes2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), 2015
The curse of dimensionality refers to the problem that one faces when analyzing datasets with thousands or hundreds of thousands of attributes. This problem is usually tackled by different feature selection methods which have been shown to effectively reduce computation time, improve prediction performance, and facilitate better understanding of ...
Pei-Yuan Zhou, Keith C. C. Chan
openaire   +2 more sources

Unsupervised robust Bayesian feature selection

open access: yes2014 International Joint Conference on Neural Networks (IJCNN), 2014
In this paper, we proposed a generative graphical model for unsupervised robust feature selection. The model assumes that the data are independent and identically sampled from a finite mixture of Student-t distribution for dealing with outliers. The Student t-distribution works as the building block for robust clustering and outlier detection.
Jianyong Sun, Aimin Zhou
openaire   +2 more sources

Dependence Guided Unsupervised Feature Selection

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2018
In the past decade, various sparse learning based unsupervised feature selection methods have been developed. However, most existing studies adopt a two-step strategy, i.e., selecting the top-m features according to a calculated descending order and then performing K-means clustering, resulting in a group of sub-optimal features.
Jun Guo 0008, Wenwu Zhu 0001
openaire   +2 more sources

Consensus Guided Unsupervised Feature Selection

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2016
Feature selection has been widely recognized as one of the key problems in data mining and machine learning community, especially for high-dimensional data with redundant information, partial noises and outliers. Recently, unsupervised feature selection attracts substantial research attentions since data acquisition is rather cheap ...
Hongfu Liu 0001, Ming Shao, Yun Fu 0001
openaire   +2 more sources

Selective Deep Autoencoder for Unsupervised Feature Selection

open access: yesProceedings of the AAAI Conference on Artificial Intelligence
In light of the advances in big data, high-dimensional datasets are often encountered. Incorporating them into data-driven models can enhance performance; however, this comes at the cost of high computation and the risk of overfitting, particularly due to abundant redundant features.
Wael Hassanieh, Abdallah A. Chehade
openaire   +2 more sources

Unsupervised Adaptive Feature Selection With Binary Hashing [PDF]

open access: yesIEEE Transactions on Image Processing, 2023
Unsupervised feature selection chooses a subset of discriminative features to reduce feature dimension under the unsupervised learning paradigm. Although lots of efforts have been made so far, existing solutions perform feature selection either without ...
Dan Shi, Lei Zhu, Jingjing Li
exaly   +2 more sources

Unsupervised feature selection by regularized self-representation

open access: yesPattern Recognition, 2015
By removing the irrelevant and redundant features, feature selection aims to find a compact representation of the original feature with good generalization ability.
Pengfei Zhu, Wangmeng Zuo, Qinghua Hu
exaly   +2 more sources

Home - About - Disclaimer - Privacy