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

Classification of Systems-I01:26

Classification of Systems-I

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:
Classification of Systems-II01:31

Classification of Systems-II

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,
Aggregates Classification01:29

Aggregates Classification

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...
Classification of Signals01:30

Classification of Signals

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...
How Data are Classified: Categorical Data01:11

How Data are Classified: Categorical Data

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...
Classification of Illness01:17

Classification of Illness

The meaning of illness is individualized to each person who experiences an alteration in health. In contrast, disease is a medical term indicating a pathological change in the structure and function of the body or mind. It is a condition that has specific symptoms and boundaries.
An illness is a response to a disease in which the person's level of functioning is changed compared with a previous level. The general classification of illness includes acute and chronic.
Acute illness is severe and...

You might also read

Related Articles

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

Sort by
Same author

Finding trajectories of feature points in a monocular image sequence.

IEEE transactions on pattern analysis and machine intelligenceยท2011
See all related articles

Related Experiment Video

Updated: May 29, 2026

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

Hierarchical classifier design using mutual information.

I K Sethi1, G P Sarvarayudu

  • 1Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur 721 302, India.

IEEE Transactions on Pattern Analysis and Machine Intelligence
|August 27, 2011
PubMed
Summary

This study introduces a new nonparametric algorithm for hierarchical feature space partitioning. It efficiently creates decision trees for pattern recognition by maximizing information gain, ensuring high accuracy.

More Related Videos

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
12:18

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

Published on: January 11, 2020

Related Experiment Videos

Last Updated: May 29, 2026

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

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
12:18

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

Published on: January 11, 2020

Area of Science:

  • Computer Science
  • Machine Learning
  • Pattern Recognition

Background:

  • Hierarchical partitioning is crucial for complex pattern recognition.
  • Existing methods may lack efficiency or adaptability for multifeature problems.

Purpose of the Study:

  • To present a novel nonparametric algorithm for hierarchical feature space partitioning.
  • To address multifeature, multicategory pattern recognition challenges.
  • To develop an efficient partitioning tree based on average mutual information.

Main Methods:

  • Developed a nonparametric algorithm utilizing average mutual information.
  • Implemented a hierarchical partitioning strategy for feature spaces.
  • Optimized decision tree generation by maximizing information gain at each step.

Main Results:

  • The algorithm generates efficient partitioning trees for pattern recognition.
  • Demonstrated effectiveness in multifeature, multicategory problems.
  • Successfully applied to handprinted numeral recognition with a specified error probability.

Conclusions:

  • The presented algorithm offers an effective approach for hierarchical feature space partitioning.
  • Maximizing average mutual information gain leads to efficient classifier construction.
  • The method shows promise for various pattern recognition applications.