Multi-view bipartite graph clustering with coupled noisy feature filter
Unsupervised bipartite graph learning has been a hot topic in multi-view clustering, to tackle
the restricted scalability issue of traditional full graph clustering in large-scale applications …
the restricted scalability issue of traditional full graph clustering in large-scale applications …
Supervised Feature Selection via Multi-Center and Local Structure Learning
Feature selection has achieved unprecedented success in obtaining sparse discriminative
features. However, the existing methods almost use the-norm constraint on transformation …
features. However, the existing methods almost use the-norm constraint on transformation …
Unsupervised feature selection by learning exponential weights
C Wang, J Wang, Z Gu, JM Wei, J Liu - Pattern Recognition, 2024 - Elsevier
Unsupervised feature selection has gained considerable attention for extracting valuable
features from unlabeled datasets. Existing approaches typically rely on sparse map** …
features from unlabeled datasets. Existing approaches typically rely on sparse map** …
Unsupervised Discriminative Feature Selection via Contrastive Graph Learning
Due to many unmarked data, there has been tremendous interest in develo**
unsupervised feature selection methods, among which graph-guided feature selection is …
unsupervised feature selection methods, among which graph-guided feature selection is …
Exploring Feature Selection With Limited Labels: A Comprehensive Survey of Semi-Supervised and Unsupervised Approaches
Feature selection is a highly regarded research area in the field of data mining, as it
significantly enhances the efficiency and performance of high-dimensional data analysis by …
significantly enhances the efficiency and performance of high-dimensional data analysis by …
A general adaptive unsupervised feature selection with auto-weighting
Feature selection (FS) is essential in machine learning and data mining as it makes
handling high-dimensional data more efficient and reliable. More attention has been paid to …
handling high-dimensional data more efficient and reliable. More attention has been paid to …
Fast unsupervised embedding learning with anchor-based graph
As graph technology is widely used in unsupervised dimensionality reduction, many
methods automatically construct a full connection graph to learn the structure of data, and …
methods automatically construct a full connection graph to learn the structure of data, and …
Local sparse discriminative feature selection
Feature selection has been widely used in machine learning for a long time. In this paper,
we propose a supervised local sparse discriminative feature selection method named …
we propose a supervised local sparse discriminative feature selection method named …
Flexible adaptive graph embedding for semi-supervised dimension reduction
Graph-based semi-supervised dimension reduction can use the inherent graph structure of
samples to propagate label information, and has become a hot research field in machine …
samples to propagate label information, and has become a hot research field in machine …
Possibilistic neighborhood graph: A new concept of similarity graph learning
Adaptive graph-based representation and learning methods have received extensive
attention due to their good performance in supervised and unsupervised learning tasks …
attention due to their good performance in supervised and unsupervised learning tasks …