Results 251 to 260 of about 3,949,706 (285)
Some of the next articles are maybe not open access.

An unsupervised approach to feature discretization and selection

Pattern Recognition, 2012
Many learning problems require handling high dimensional datasets with a relatively small number of instances. Learning algorithms are thus confronted with the curse of dimensionality, and need to address it in order to be effective. Examples of these types of data include the bag-of-words representation in text classification problems and gene ...
J. Ferreira, Artur   +1 more
openaire   +4 more sources

Unsupervised feature selection for balanced clustering

Knowledge-Based Systems, 2020
Abstract In many real-world applications of data mining, such as energy load balance of wireless sensor networks, given data points with balanced distribution, i.e., each class contains approximately the same number of instances, we often need to obtain a clustering result to reflect such balance.
Peng Zhou 0006   +5 more
openaire   +2 more sources

Unsupervised feature selection based on clustering

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010
Feature selection plays an important part in improving the classification accuracy and the quality of clustering in many applications. Feature selection has been widely studied in supervised learning, but in unsupervised learning it is still relatively rare.
Shengyi Jiang, Lianxi Wang 0001
openaire   +1 more source

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 ...
Saúl Solorio-Fernández   +2 more
openaire   +2 more sources

Discriminant Analysis for Unsupervised Feature Selection

Proceedings of the 2014 SIAM International Conference on Data Mining, 2014
Feature selection has been proven to be efficient in preparing high dimensional data for data mining and machine learning. As most data is unlabeled, unsupervised feature selection has attracted more and more attention in recent years. Discriminant analysis has been proven to be a powerful technique to select discriminative features for supervised ...
Jiliang Tang   +3 more
openaire   +1 more source

Discriminative embedded unsupervised feature selection

Pattern Recognition Letters, 2018
Abstract Unsupervised feature selection is a powerful tool to process high-dimensional data, in which a subset of features are selected out for effective data representation. In this paper, we propose a novel unsupervised feature selection method which discovers and exploits the global information of the data by maximizing distances between samples ...
Qi-Hai Zhu, Yu-Bin Yang
openaire   +1 more source

Co-regularized unsupervised feature selection

Neurocomputing, 2018
Abstract Unsupervised feature selection (UFS) is very challenging due to the lack of label information. Most UFS methods generate pseudo labels by spectral clustering, matrix factorization or dictionary learning, and convert UFS into a supervised feature selection problem. Generally, the features that can preserve the data distribution (i.e., cluster
Pengfei Zhu 0001   +3 more
openaire   +1 more source

Selective Deep Autoencoder for Unsupervised Feature Selection

Proceedings 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 feature selection with ordinal locality

2017 IEEE International Conference on Multimedia and Expo (ICME), 2017
Unsupervised feature selection has shown significant potential in distance-based clustering tasks. This paper proposes a novel triplet induced method. Firstly, a triplet-based loss function is introduced to enforce the selected feature groups to preserve ordinal locality of original data, which contributes to distance-based clustering tasks.
Jun Guo 0008   +3 more
openaire   +2 more sources

An efficient framework for unsupervised feature selection

Neurocomputing, 2019
Abstract In these years, the task of fast unsupervised feature selection attracts much attentions with the increasing number of data collected from the physical world. To speed up the running time of algorithms, the bipartite graph theory has been applied in many large-scale tasks, including fast clustering, fast feature extraction, etc.
Han Zhang 0012   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy