Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Associative Learning

Associative Learning

Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...

Observational Learning

Observational Learning

Albert Bandura's observational learning, also known as imitation or modeling, occurs when a person observes and imitates another's behavior. It is a quicker process than operant conditioning. A well-known example is the Bobo doll study, where children who saw an adult acting aggressively towards the doll were more likely to act aggressively when left alone, compared to those who observed a nonaggressive adult. Many psychologists view observational learning as a form of latent learning because...

Avoidance Learning and Learned Helplessness

Avoidance Learning and Learned Helplessness

Avoidance learning and learned helplessness are critical concepts in understanding behavioral responses to negative stimuli.
Avoidance learning occurs when an organism learns that a specific behavior can prevent an unpleasant outcome. For example, a student who receives a bad grade may start studying harder to avoid future poor grades. This behavior persists even when the negative outcome is no longer present. Avoidance learning is powerful because it maintains behavior in the absence of the...

Cluster Sampling Method

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...

Cognitive Learning

Cognitive Learning

Cognitive learning is based on purposive behavior, incidental learning, and insight learning.
E. C. Tolman's theory of purposive behavior emphasizes that much behavior is goal-directed. He argued that to understand behavior, we must look at the entire sequence of actions leading to a goal. For instance, high school students study hard, not just due to past reinforcement but also to achieve the goal of getting into a good college.
Tolman introduced the idea that behavior is influenced by...

Generalization, Discrimination, and Extinction

Generalization, Discrimination, and Extinction

Generalization, discrimination, and extinction are key concepts in operant conditioning that influence how behaviors are learned and maintained.
Generalization occurs when a behavior reinforced in one context is performed in similar situations. For instance, a student who studies diligently for calculus and receives excellent grades might apply the same study habits to psychology and history, expecting similar results. Generalization shows how learning in one setting can influence behavior in...

You might also read

Related Articles

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

Sort by

Same author

Strategies to Improve the Impact of Artificial Intelligence on Health Equity: Scoping Review.

JMIR AI·2024

Same author

Noise can speed backpropagation learning and deep bidirectional pretraining.

Neural networks : the official journal of the International Neural Network Society·2020

Same author

Noise can speed Markov chain Monte Carlo estimation and quantum annealing.

Physical review. E·2019

Same author

Noise-boosted bidirectional backpropagation and adversarial learning.

Neural networks : the official journal of the International Neural Network Society·2019

Same author

An open challenge to advance probabilistic forecasting for dengue epidemics.

Proceedings of the National Academy of Sciences of the United States of America·2019

Same author

Noise-enhanced convolutional neural networks.

Neural networks : the official journal of the International Neural Network Society·2015

Search research articles

Related Experiment Videos

Noise-enhanced clustering and competitive learning algorithms.

Osonde Osoba¹, Bart Kosko

¹Department of Electrical Engineering, Signal and Image Processing Institute, University of Southern California, Los Angeles, CA 90089-2564, USA.

Neural Networks : the Official Journal of the International Neural Network Society

|November 10, 2012

Summary

Noise injection can accelerate convergence in clustering algorithms like k-means. This benefit extends to various competitive learning methods, as demonstrated by simulations.

Related Experiment Videos

Area of Science:

Machine Learning
Data Mining
Computational Statistics

Background:

Centroid-based clustering algorithms, including k-means, are widely used for data analysis.
The expectation-maximization (EM) algorithm is a foundational method for many clustering techniques.
Noise's impact on algorithmic convergence is an area of ongoing research.

Purpose of the Study:

To investigate the effect of noise on the convergence speed of centroid-based clustering algorithms.
To determine if the benefits of noise observed in the expectation-maximization algorithm apply to other learning paradigms.
To analyze noise's influence on competitive learning algorithms.

Main Methods:

Theoretical analysis of centroid-based clustering algorithms.
Mathematical derivation of noise benefits within the expectation-maximization framework.
Empirical validation through simulations on various competitive learning models.

Main Results:

Noise is proven to accelerate convergence in many centroid-based clustering algorithms, notably k-means.
The observed noise benefit in clustering is linked to the broader advantages of noise in expectation-maximization.
Simulations confirm that noise enhances convergence speed in stochastic unsupervised competitive learning, supervised competitive learning, and differential competitive learning.

Conclusions:

Noise injection is a viable strategy for improving the convergence rate of k-means and related clustering methods.
The positive influence of noise on convergence is a general principle applicable across different machine learning algorithms.
Competitive learning algorithms also benefit from noise, leading to faster convergence in practical applications.