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

Classifying Matter by Composition03:35

Classifying Matter by Composition

89.8K
Matter: Pure Substances and Mixtures
According to its composition, the matter can be classified into two broad categories — pure substances and mixtures. 
A pure substance is a form of matter that has a constant composition throughout with uniform properties. For example, any sample of sucrose has the same composition and same physical properties, such as melting point, color, and sweetness, regardless of the source from which it is isolated. 
A mixture is composed of two or...
89.8K
Classifying Matter by State02:49

Classifying Matter by State

102.7K
Chemistry is the study of matter and the changes it undergoes. Matter is anything that has mass and occupies space. Matter is all around us; the air, water, soil, mountains, even our bodies are all examples of matter. Matter is divided into three states — solid, liquid, and gas — that are commonly found on earth. The fourth state of matter, plasma, occurs naturally in the interiors of stars. 
102.7K
How Data are Classified: Numerical Data00:59

How Data are Classified: Numerical Data

37.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...
37.0K
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

399
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
399
How Data are Classified: Categorical Data01:11

How Data are Classified: Categorical Data

43.0K
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...
43.0K
Fixed Action Patterns01:06

Fixed Action Patterns

17.5K
A fixed action pattern (FAP) is a specific, hard-wired sequence of behaviors that occurs in response to an external stimulus, called a sign stimulus. The behavior is “fixed” because it is essentially unchangeable—proceeding similarly across individuals of a species every time it occurs.
17.5K

You might also read

Related Articles

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

Sort by
Same author

ϵ-Approximation of Adaptive Leaning Rate Optimization Algorithms for Constrained Nonconvex Stochastic Optimization.

IEEE transactions on neural networks and learning systems·2022
Same author

Appropriate Learning Rates of Adaptive Learning Rate Optimization Algorithms for Training Deep Neural Networks.

IEEE transactions on cybernetics·2021
Same author

Riemannian Adaptive Optimization Algorithm and its Application to Natural Language Processing.

IEEE transactions on cybernetics·2021
Same author

Incremental and Parallel Machine Learning Algorithms With Automated Learning Rate Adjustments.

Frontiers in robotics and AI·2021

Related Experiment Video

Updated: Jan 22, 2026

Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm
06:53

Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm

Published on: July 23, 2020

6.1K

Stochastic Fixed Point Optimization Algorithm for Classifier Ensemble.

Hideaki Iiduka

    IEEE Transactions on Cybernetics
    |June 28, 2019
    PubMed
    Summary

    This study introduces a new algorithm for classifier ensembles, optimizing sparsity and diversity. The stochastic fixed point optimization algorithm demonstrates high classification accuracy and converges effectively with various step sizes.

    Area of Science:

    • Machine Learning
    • Optimization Theory

    Background:

    • Classifier ensemble methods are crucial in machine learning for improving predictive performance.
    • Integrating sparsity and diversity learning presents a significant challenge in ensemble optimization.
    • Existing methods may not fully address the complexities of convex stochastic optimization in this domain.

    Purpose of the Study:

    • To formulate the classifier ensemble problem with sparsity and diversity as a convex stochastic optimization problem.
    • To propose a novel algorithm, the stochastic fixed point optimization algorithm, for solving this problem.
    • To analyze the convergence properties of the proposed algorithm under different step-size strategies.

    Main Methods:

    • Formulation of the classifier ensemble problem as a convex stochastic optimization problem over a fixed point set.

    More Related Videos

    Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro
    06:22

    Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro

    Published on: August 28, 2019

    5.5K
    A Workflow for Lipid Nanoparticle LNP Formulation Optimization using Designed Mixture-Process Experiments and Self-Validated Ensemble Models SVEM
    13:54

    A Workflow for Lipid Nanoparticle LNP Formulation Optimization using Designed Mixture-Process Experiments and Self-Validated Ensemble Models SVEM

    Published on: August 18, 2023

    5.8K

    Related Experiment Videos

    Last Updated: Jan 22, 2026

    Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm
    06:53

    Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm

    Published on: July 23, 2020

    6.1K
    Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro
    06:22

    Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro

    Published on: August 28, 2019

    5.5K
    A Workflow for Lipid Nanoparticle LNP Formulation Optimization using Designed Mixture-Process Experiments and Self-Validated Ensemble Models SVEM
    13:54

    A Workflow for Lipid Nanoparticle LNP Formulation Optimization using Designed Mixture-Process Experiments and Self-Validated Ensemble Models SVEM

    Published on: August 18, 2023

    5.8K
  • Development of the stochastic fixed point optimization algorithm.
  • Convergence analysis of the algorithm with constant, decreasing, and line-search-computed step sizes.

    • Main Results:

    • The classifier ensemble problem is successfully mapped to a convex stochastic optimization problem.
    • The proposed stochastic fixed point optimization algorithm demonstrates convergence under various step-size conditions.
    • Numerical comparisons show superior classification accuracies compared to conventional algorithms.

    Conclusions:

    • The stochastic fixed point optimization algorithm provides an effective solution for classifier ensembles incorporating sparsity and diversity.
    • The algorithm's convergence is robust across different step-size strategies, including constant and decreasing step sizes.
    • The proposed approach achieves high classification accuracy, outperforming existing methods in numerical evaluations.