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

How Data are Classified: Numerical Data00:59

How Data are Classified: Numerical Data

35.0K
Data that are countable or measurable in specific units are called numerical or quantitative data. Quantitative data are always numbers. Quantitative data are the result of counting or measuring the attributes of a population. Amount of money, pulse rate, weight, number of people living in a town, and number of students who opt for statistics are examples of quantitative data.
Quantitative data may be either discrete or continuous. All quantitative data that take on only specific numerical...
35.0K
Classification of Systems-II01:31

Classification of Systems-II

385
Continuous-time systems have continuous input and output signals, with time measured continuously. These systems are generally defined by differential or algebraic equations. For instance, in an RC circuit, the relationship between input and output voltage is expressed through a differential equation derived from Ohm's law and the capacitor relation,
385
Classification of Systems-I01:26

Classification of Systems-I

455
Linearity is a system property characterized by a direct input-output relationship, combining homogeneity and additivity.
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:
455
How Data are Classified: Categorical Data01:11

How Data are Classified: Categorical Data

39.9K
A variable, usually notated by capital letters such as X and Y, is a characteristic or measurement that can be determined for each member of a population. Data are the actual values of variables. They may be numbers, or they may be words. Datum is a single value.
Data are classified based on whether they are measurable or not. Categorical data cannot be measured; instead, it can be divided into categories. For example, if Y denotes a person's party affiliation, some examples of Y include...
39.9K
Classification of Signals01:30

Classification of Signals

1.2K
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...
1.2K
Aggregates Classification01:29

Aggregates Classification

572
Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
572

You might also read

Related Articles

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

Sort by
Same author

Generalized Legendre Transforms Have Roots in Information Geometry.

Entropy (Basel, Switzerland)·2026
Same author

Mirror Descent and Exponentiated Gradient Algorithms Using Trace-Form Entropies.

Entropy (Basel, Switzerland)·2025
Same author

Two Types of Geometric Jensen-Shannon Divergences.

Entropy (Basel, Switzerland)·2025
Same author

Fast Proxy Centers for the Jeffreys Centroid: The Jeffreys-Fisher-Rao Center and the Gauss-Bregman Inductive Center.

Entropy (Basel, Switzerland)·2025
Same author

Symplectic Bregman Divergences.

Entropy (Basel, Switzerland)·2025
Same author

Divergences Induced by the Cumulant and Partition Functions of Exponential Families and Their Deformations Induced by Comparative Convexity.

Entropy (Basel, Switzerland)·2024

Related Experiment Video

Updated: Nov 27, 2025

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.4K

Computational Information Geometry for Binary Classification of High-Dimensional Random Tensors.

Gia-Thuy Pham1, Rémy Boyer1, Frank Nielsen2,3

  • 1Laboratory of Signals and Systems (L2S), Department of Signals and Statistics, University of Paris-Sud, 91400 Orsay, France.

Entropy (Basel, Switzerland)
|December 3, 2020
PubMed
Summary

This study tackles Bayesian classification for high-dimensional random tensors, a challenging problem. Researchers derived analytical expressions for optimal error bounds, simplifying performance evaluation in signal processing.

Keywords:
Chernoff/Bhattacharyya upper boundFisher informationinformation geometrylarge random sensing matrixlarge random tensorminimal error probabilityoptimal Bayesian detection

More Related Videos

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.2K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.8K

Related Experiment Videos

Last Updated: Nov 27, 2025

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.4K
Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.2K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.8K

Area of Science:

  • Statistics
  • Machine Learning
  • Signal Processing

Background:

  • Bayesian classification in high-dimensional random tensors is difficult and under-studied.
  • Existing methods for calculating minimal Bayes' error probability are mathematically intractable.
  • Performance evaluation is crucial for understanding classification accuracy in complex data structures.

Purpose of the Study:

  • To evaluate Bayesian classification performance in high-dimensional random tensors under two specific Signal to Noise Ratio (SNR)-based scenarios.
  • To develop tractable methods for analyzing classification error probabilities.
  • To provide analytical expressions for optimal error bounds, simplifying performance assessment.

Main Methods:

  • Utilized information geometry theory to derive the Chernoff Upper Bound (CUB) for higher SNRs and Fisher information for lower SNRs.
  • Employed random matrix theory tools to obtain a simple analytical expression for the optimal error exponent (s⋆).
  • Compared the Bhattacharyya Upper Bound (BUB) with CUB, noting BUB's effectiveness at low SNRs.

Main Results:

  • Derived tractable bounds (CUB and Fisher information) for Bayes' error probability in tensor classification.
  • Provided a simplified analytical expression for s⋆ concerning SNR using random matrix theory.
  • Demonstrated that the Bhattacharyya Upper Bound (BUB) is the tightest at low SNRs, but this changes at higher SNRs.

Conclusions:

  • The study offers a significant advancement in understanding Bayesian classification for high-dimensional random tensors.
  • Analytical results simplify the evaluation of classification performance, particularly concerning error bounds.
  • Findings highlight the varying effectiveness of different error bounds (BUB vs. CUB) depending on the Signal to Noise Ratio (SNR).