Results 241 to 250 of about 3,949,706 (285)
Unsupervised Adaptive Feature Selection With Binary Hashing [PDF]
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 ...
Lei Zhu, Jingjing Li, Xiaojun Chang
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Unsupervised feature selection for attributed graphs
Expert Systems with Applications, 2021Abstract Many real-world applications generate attributed graphs that contain both link structures and content information associated with nodes. Content information in real networks always contains high dimensional feature space. In recent years, unsupervised feature selection has been widely used in handling high dimensional data without label ...
Ruizhi Zhou +2 more
openaire +1 more source
Scalable and Flexible Unsupervised Feature Selection
Neural Computation, 2019Recently, graph-based unsupervised feature selection algorithms (GUFS) have been shown to efficiently handle prevalent high-dimensional unlabeled data. One common drawback associated with existing graph-based approaches is that they tend to be time-consuming and in need of large storage, especially when faced with the increasing size of data. Research
Haojie Hu +3 more
openaire +4 more sources
Unsupervised feature selection with ensemble learning
Machine Learning, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elghazel, Haytham, Aussem, Alex
openaire +4 more sources
Feature Selection for Unsupervised Machine Learning
2023 IEEE 8th International Conference on Smart Cloud (SmartCloud), 2023Compared to supervised machine learning (ML), the development of feature selection for unsupervised ML is far behind. To address this issue, the current research proposes a stepwise feature selection approach for clustering methods with a specification to the Gaussian mixture model (GMM) and the k-means.
Huyunting Huang +5 more
openaire +4 more sources
Unsupervised Soft-Label Feature Selection
Knowledge-Based Systems, 2021Abstract 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.
Huaxiang Zhang, Lei Zhu, Haibao Chen
exaly +2 more sources
Unsupervised Discriminative Projection for Feature Selection
IEEE Transactions on Knowledge and Data Engineering, 2022Feature selection is one of the most important techniques to deal with the high-dimensional data for a variety of machine learning and data mining tasks, such clustering, classification, and retrieval, etc. Fuzziness is a widespread nature of data in nature human society.
Rong Wang 0001 +3 more
openaire +1 more source
Feature Selection for Unsupervised Learning
2012In this paper, we present a methodology for identifying best features from a large feature space. In high dimensional feature space nearest neighbor search is meaningless. In this feature space we see quality and performance issue with nearest neighbor search. Many data mining algorithms use nearest neighbor search. So instead of doing nearest neighbor
Jyoti Ranjan Adhikary +1 more
openaire +1 more source
An unsupervised attribute clustering algorithm for unsupervised feature selection
2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), 2015The 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 +1 more source
Clustering Ensemble for Unsupervised Feature Selection
2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 2009A new feature selection algorithm for unsupervised learning is proposed. It is based on the assumption that, in absence of class labels, the clustering ensemble result can be employed as a heuristic to guide the feature selection. Therefore?a modified RReliefF algorithm is then used to assign the rankings for every feature.
Yihui Luo, Shuchu Xiong
openaire +1 more source

