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

A robust information clustering algorithm.

Qing Song1

  • 1School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798. eqsong@ntu.edu.sg

Neural Computation
|October 11, 2005
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

Abietic acid targets RAN to restrict coxsackievirus B3 infection.

Frontiers in microbiology·2026
Same author

Discovery and characterization of hinokiflavone as a potent natural CD137 inhibitor for Kawasaki disease.

Phytomedicine : international journal of phytotherapy and phytopharmacology·2026
Same author

Exosomal miR-181d-5p derived from distal airway stem cells inhibit apoptosis of pulmonary vascular endothelial cells in COPD mice by targeting PDAP1.

Stem cell research & therapy·2026
Same author

Chlorogenic Acid Ameliorates CVB3-Induced Viral Myocarditis by Suppressing Viral Replication and ZBP1-Mediated PANoptosis.

Microorganisms·2026
Same author

Effectiveness of drying in digestive endoscope reprocessing: Systematic review on residual droplets and microorganisms.

Endoscopy international open·2026
Same author

Huyan-I formula attenuates renal senescence and fibrosis by inhibiting STAT3/NF-κB/NLRP3-driven SASP.

Journal of natural medicines·2026
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

This study introduces robust information clustering (RIC) using minimax optimization of mutual information (MI). This method effectively identifies outliers and determines the optimal number of clusters for improved data analysis.

Area of Science:

  • Data Science
  • Machine Learning
  • Statistical Modeling

Background:

  • Traditional clustering methods can be sensitive to outliers and noise.
  • Determining the optimal number of clusters is a persistent challenge in data analysis.
  • Mutual Information (MI) offers a powerful framework for understanding dependencies in data.

Purpose of the Study:

  • To develop a robust information clustering (RIC) method using minimax optimization of mutual information (MI).
  • To identify and handle outliers (noisy data points) effectively within the clustering process.
  • To establish a principled approach for determining the optimal number of clusters.

Main Methods:

  • Minimax optimization of Mutual Information (MI) for clustering.
  • Identification of outliers through robust density estimation.

Related Experiment Videos

  • Estimation of VC-bound for real risk assessment.
  • Application of structural risk minimization to determine optimal cluster number.

    • Main Results:

    • The minimization of MI corresponds to empirical risk minimization (standard clustering).
    • The maximization of MI provides an upper bound on empirical risk by identifying outliers.
    • A novel nonparametric approach for robust clustering is presented.
    • The method successfully determines an optimal cluster number based on risk minimization.

    Conclusions:

    • Minimax optimization of MI offers a robust and nonparametric approach to information clustering.
    • The proposed method effectively handles outliers and determines the optimal cluster number.
    • This framework provides a theoretically sound basis for clustering with improved reliability and accuracy.