Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.6K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.6K
Types of Selection01:46

Types of Selection

40.5K
Natural selection influences the frequencies of particular alleles and phenotypes within populations in several different ways. Primarily, natural selection can be directional, stabilizing, or disruptive. Directional selection favors one extreme trait and shifts the population towards that phenotype while selecting against individuals displaying alternate traits. Stabilizing selection favors an intermediate trait with a narrow range of variation. Deviation from the optimal phenotype towards an...
40.5K
Classification of Signals01:30

Classification of Signals

471
In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
471
Force Classification01:22

Force Classification

1.2K
Forces play a crucial role in the study of physics and engineering. They are essential in describing the motion, behavior, and equilibrium of objects in the physical world. Forces can be classified based on their origin, type, and direction of action.
Contact and non-contact forces are two of the most widely used categories of forces. As the name suggests, contact forces require physical contact between two objects to act upon each other. Examples of contact forces include frictional,...
1.2K
Extraction: Advanced Methods00:56

Extraction: Advanced Methods

450
Metal ions can be separated from one another by complexation with organic ligands–the chelating agent– to form uncharged chelates. Here, the chelating agent must contain hydrophobic groups and behave as a weak acid, losing a proton to bind with the metal. Since most organic ligands used in this process are insoluble or undergo oxidation in the aqueous phase, the chelating agent is initially added to the organic phase and extracted into the aqueous phase. The metal-ligand complex is...
450
Generalization, Discrimination, and Extinction01:24

Generalization, Discrimination, and Extinction

570
Generalization, discrimination, and extinction are key concepts in operant conditioning that influence how behaviors are learned and maintained.
Generalization occurs when a behavior reinforced in one context is performed in similar situations. For instance, a student who studies diligently for calculus and receives excellent grades might apply the same study habits to psychology and history, expecting similar results. Generalization shows how learning in one setting can influence behavior in...
570

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Unsupervised feature selection via row-sparse local preserving projection.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Projection with mixed-size anchor graphs.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

SimMTC: Simple Multi-View Tensor Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Unsupervised fine-tuning of vision-language models by fusing classifier tuning and visual prompt tuning.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

IB2MC: Information Bottleneck Inspired Balanced Multiview Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026

Related Experiment Video

Updated: Jul 8, 2025

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
09:47

Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

Published on: December 15, 2023

1.1K

Discriminative and Robust Autoencoders for Unsupervised Feature Selection.

Yunzhi Ling, Feiping Nie, Weizhong Yu

    IEEE Transactions on Neural Networks and Learning Systems
    |December 13, 2023
    PubMed
    Summary
    This summary is machine-generated.

    This paper introduces a new machine learning method that improves how computers identify important data features without needing pre-labeled examples. By combining a robust autoencoder with clustering techniques, the model effectively ignores noisy data points while highlighting patterns that distinguish different groups. This approach leads to more accurate and reliable feature selection compared to standard techniques.

    Keywords:
    machine learningdata clusteringrobust statisticspattern discovery

    Frequently Asked Questions

    More Related Videos

    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
    07:35

    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

    Published on: October 11, 2018

    7.5K
    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
    03:37

    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers

    Published on: March 1, 2024

    763

    Related Experiment Videos

    Last Updated: Jul 8, 2025

    Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches
    09:47

    Author Spotlight: Advancing Alzheimer's Research – Exploring Early Detection and Multi-Omics Approaches

    Published on: December 15, 2023

    1.1K
    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
    07:35

    Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

    Published on: October 11, 2018

    7.5K
    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
    03:37

    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers

    Published on: March 1, 2024

    763

    Area of Science:

    • Unsupervised feature selection within machine learning
    • Data mining and pattern recognition research

    Background:

    No prior work had resolved the limitations of standard autoencoders when handling noisy datasets during unsupervised feature selection. Prior research has shown that squared error metrics often fail because they amplify the negative impact of outliers. That uncertainty drove the development of models that could better manage data irregularities. It was already known that traditional architectures prioritize reconstruction accuracy over the discovery of underlying group structures. This gap motivated the need for a framework that integrates cluster detection directly into the learning process. Researchers have long struggled to balance data recovery with the identification of discriminative characteristics. Existing approaches frequently overlook the necessity of assigning varying importance to data points based on their reconstruction quality. This study addresses these challenges by proposing a unified model that simultaneously handles robustness and feature relevance.

    Purpose Of The Study:

    The aim of this study is to develop a robust framework for unsupervised feature selection that overcomes the limitations of traditional autoencoders. Researchers seek to address the performance degradation caused by outliers in standard reconstruction-based methods. The project specifically targets the lack of discriminative power in features extracted without explicit cluster structure detection. By combining feature selection with clustering, the authors intend to create a more effective representation learning process. This motivation stems from the need to identify informative features that capture both intrinsic data information and latent group structures. The team explores how adaptive weighting can mitigate the negative effects of noisy data points. They also investigate the benefits of incorporating k-means clustering directly into the training criterion. Ultimately, this work provides a unified approach to improve the accuracy and reliability of feature identification in unsupervised settings.

    Main Methods:

    The review approach involves a unified framework that merges robust feature selection with clustering tasks. Investigators utilize an autoencoder architecture modified with a specific norm to enhance data processing. An adaptive weighting strategy is implemented to dynamically adjust the influence of individual samples during training. This design choice allows the system to automatically downplay the significance of noisy input points. The team incorporates k-means clustering directly into the representation learning phase to guide feature extraction. This integration ensures that the model continuously explores underlying group structures within the datasets. An efficient optimization procedure is developed to solve the resulting objective function effectively. Extensive testing on multiple benchmark datasets validates the performance of this integrated computational strategy.

    Main Results:

    Key findings from the literature indicate that the proposed model consistently outperforms state-of-the-art methods across various benchmark datasets. The integration of clustering objectives leads to the discovery of more discriminative features compared to standard approaches. By employing an adaptive weight vector, the model successfully reduces the influence of outliers on reconstruction accuracy. The use of a norm-based autoencoder provides a stable foundation for identifying informative data characteristics. Experimental evidence shows that assigning smaller weights to samples with larger errors improves overall model robustness. Larger weights are assigned to clean data, which strengthens the influence of reliable information during the learning process. The joint optimization of feature selection and clustering yields superior results in identifying latent structures. These outcomes confirm that the combined framework effectively addresses the limitations of traditional reconstruction-based models.

    Conclusions:

    The authors propose a unified framework that successfully integrates robust feature selection with clustering objectives. Their results suggest that employing a norm-based autoencoder significantly mitigates the detrimental influence of outliers. By incorporating clustering into the representation learning phase, the model effectively uncovers latent group structures. This synthesis implies that prioritizing discriminative power over simple reconstruction leads to superior feature identification. The findings demonstrate that adaptive weighting strategies provide a reliable mechanism for handling noisy input data. Researchers can utilize this approach to enhance performance across diverse benchmark datasets. The evidence indicates that this joint optimization strategy consistently outperforms current state-of-the-art techniques. These implications highlight the value of combining structural awareness with robust error estimation in unsupervised learning tasks.

    The researchers propose a joint framework that combines a robust autoencoder with k-means clustering. This dual approach simultaneously minimizes reconstruction errors while actively seeking latent group structures to improve feature discrimination.

    The authors utilize an adaptive weight vector within the autoencoder. This component assigns lower values to samples with high reconstruction errors, effectively reducing the negative impact of outliers on the final model.

    An L2,1-norm is employed as the basic model for the autoencoder. This specific mathematical choice is necessary to maintain stability and performance when processing complex, high-dimensional data inputs.

    The study uses an adaptive weight vector to manage the influence of individual data points. This data-driven component dynamically adjusts the importance of samples based on their specific reconstruction performance.

    The researchers measure performance using extensive experiments on various benchmark datasets. These tests evaluate the model against existing state-of-the-art methods to confirm its superior effectiveness in feature selection.

    The authors claim that their approach provides a more efficient way to solve the objective function. This improvement allows for better discovery of discriminative features compared to traditional, non-integrated architectures.