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 Experiment Videos

Dimensionality reduction of clustered data sets.

Guido Sanguinetti1

  • 1Department of Computer Science, University of Sheffield, Sheffield, UK. guido@dcs.shef.ac.uk

IEEE Transactions on Pattern Analysis and Machine Intelligence
|January 16, 2008
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Scalable, fast and accurate differential gene expression testing from millions of cells of multiple patients.

Nature communications·2026
Same author

CRAK-Velo: chromatin accessibility kinetics integration improves RNA velocity estimation.

Genome biology·2026
Same author

Extending differential gene expression testing to handle genome aneuploidy in cancer.

PLoS computational biology·2026
Same author

Interpretable learning of temporal cellular dynamics from single-cell data.

Cell reports methods·2026
Same author

Machine learning for RNA secondary structure prediction: a review of current methods and challenges.

RNA (New York, N.Y.)·2026
Same author

Modelling transcription with explainable AI uncovers context-specific epigenetic gene regulation at promoters and gene bodies.

PLoS genetics·2025
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This study introduces a new probabilistic model for linear dimensionality reduction in clustered data. Its maximum likelihood solution generalizes linear discriminant analysis, offering a novel approach to classification.

Area of Science:

  • Machine Learning
  • Statistical Modeling
  • Data Analysis

Background:

  • Dimensionality reduction is crucial for analyzing high-dimensional data.
  • Clustered data presents unique challenges for traditional methods.
  • Linear Discriminant Analysis (LDA) is a widely used classification algorithm.

Purpose of the Study:

  • To develop a novel probabilistic latent variable model for linear dimensionality reduction.
  • To generalize Linear Discriminant Analysis (LDA) in an unsupervised manner.
  • To provide a new computational approach for classification tasks.

Main Methods:

  • Developed a probabilistic latent variable model.
  • Proved the maximum likelihood solution as an unsupervised generalization of LDA.

Related Experiment Videos

  • Applied the model to real and artificial datasets for performance evaluation.

    • Main Results:

    • The proposed model effectively performs linear dimensionality reduction on clustered data.
    • The maximum likelihood solution unifies unsupervised and supervised approaches.
    • Demonstrated superior or comparable performance on various datasets.

    Conclusions:

    • The novel probabilistic model offers a powerful new tool for dimensionality reduction and classification.
    • This work provides a theoretical and practical advancement in unsupervised learning.
    • The generalized LDA approach enhances the applicability of established classification algorithms.