Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Survival Tree

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a...

Structural Classification of Joints

Structural Classification of Joints

Joints, also known as articulations, are classified based on their structural characteristics, i.e., based on whether the articulating surfaces of the adjacent bones are directly connected by fibrous connective tissue or cartilage, or whether the articulating surfaces contact each other within a fluid-filled joint cavity. These differences serve to divide the joints of the body into three structural classifications.
A fibrous joint is where the adjacent bones are united by fibrous connective...

Stability of structures

Stability of structures

In mechanical engineering, the stability of systems under various forces is critical for designing durable and efficient structures. One fundamental way to explore these concepts is by analyzing systems like two rods connected at a pivot point, O, with a torsional spring of spring constant k at the pivot point. This system is similar in appearance to a scissor jack used to change tires on a car. In this case, the arms of the linkage (equivalent to the rods in this system) are entirely vertical,...

Quantifying and Rejecting Outliers: The Grubbs Test

Quantifying and Rejecting Outliers: The Grubbs Test

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...

You might also read

Related Articles

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

Sort by

Same author

Bridging Subjectivity in Affective Explanation Captioning via Consensus-Prompted Emotion Reasoning.

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

Same author

Looking Broader for Knowledge Distillation Via Receptive-Field Alignment.

IEEE transactions on pattern analysis and machine intelligence·2026

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 journal

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

IEEE transactions on neural networks and learning systems·2026

Same journal

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

IEEE transactions on neural networks and learning systems·2026

Same journal

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

IEEE transactions on neural networks and learning systems·2026

Same journal

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

IEEE transactions on neural networks and learning systems·2026

Same journal

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systems·2026

Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Mar 8, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Adaptive Unsupervised Feature Selection With Structure Regularization.

Minnan Luo, Feiping Nie, Xiaojun Chang

IEEE Transactions on Neural Networks and Learning Systems

|February 1, 2017

Summary

This summary is machine-generated.

This study introduces a novel unsupervised feature selection method that preserves intrinsic data structure using an adaptive reconstruction graph. It effectively identifies relevant features for clustering without requiring labeled data.

Related Experiment Videos

Last Updated: Mar 8, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Area of Science:

Machine Learning
Data Science
Computer Vision

Background:

Unsupervised feature selection is crucial for large-scale, unlabeled datasets due to high labeling costs.
Existing methods struggle to accurately capture the intrinsic geometry and structure of high-dimensional data without labels.

Purpose of the Study:

To develop an effective unsupervised feature selection technique that accurately preserves the intrinsic local and multi-cluster structure of data.
To simultaneously learn an optimal reconstruction graph and a selective matrix for superior feature subset generation.

Main Methods:

Characterizing intrinsic local structure via an adaptive reconstruction graph.
Imposing a rank constraint on the Laplacian matrix to consider multi-cluster structure.
Employing an efficient alternative optimization algorithm for simultaneous graph and matrix learning.

Main Results:

The proposed method effectively preserves the intrinsic data structure.
Demonstrated superiority over existing algorithms in clustering tasks on benchmark datasets.
Theoretical analysis confirmed the algorithm's convergence and computational efficiency.

Conclusions:

The novel unsupervised feature selection algorithm offers a robust solution for high-dimensional data.
The method's ability to capture complex data structures enhances clustering performance.
This approach provides an efficient and effective tool for dimension reduction in unlabeled datasets.