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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

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...

Sequence Networks of Rotating Machines

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Principle of Moments: Problem Solving

Principle of Moments: Problem Solving

The principle of moments is a fundamental concept in physics and engineering. It refers to the balancing of forces and moments around a point or axis, also known as the pivot. This principle is used in many real-life scenarios, including construction, sports, and daily activities like opening doors and pushing objects.
One such scenario involves a pole placed in a three-dimensional system with a cable attached. When a tension is applied to the cable, the moment about the z-axis passing through...

Distributed Loads: Problem Solving

Distributed Loads: Problem Solving

Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...

You might also read

Related Articles

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

Sort by

Same author

A fast iterative nearest point algorithm for support vector machine classifier design.

IEEE transactions on neural networks·2008

Same author

Improvements to the SMO algorithm for SVM regression.

IEEE transactions on neural networks·2008

Same author

Efficient tuning of SVM hyperparameters using radius/margin bound and iterative algorithms.

IEEE transactions on neural networks·2008

Same author

Parallel sequential minimal optimization for the training of support vector machines.

IEEE transactions on neural networks·2006

Same author

A simple and efficient algorithm for gene selection using sparse logistic regression.

Bioinformatics (Oxford, England)·2003

Same author

SMO algorithm for least-squares SVM formulations.

Neural computation·2003

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

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

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

Published on: February 15, 2017

A stochastic connectionist approach for global optimization with application to pattern clustering.

G P Babu¹, N M Murty, S S Keerthi

¹Technol. Deployment Int. Inc., Santa Clara, CA.

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|February 5, 2008

Summary

This summary is machine-generated.

A novel stochastic connectionist approach effectively solves real-valued function optimization problems, avoiding local optima. This method demonstrates robustness and parallelization capabilities for complex tasks like clustering.

Related Experiment Videos

Last Updated: Jul 7, 2026

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

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

Published on: February 15, 2017

Area of Science:

Artificial Intelligence
Computational Science
Machine Learning

Background:

Function optimization problems with real-valued parameters are common in various scientific domains.
Traditional methods can get stuck in local optima, limiting their effectiveness.
Connectionist networks offer potential for complex problem-solving with enhanced node capabilities.

Purpose of the Study:

To propose a novel stochastic connectionist approach for solving real-valued function optimization problems.
To demonstrate the approach's ability to overcome local optima and handle a broader class of problems.
To evaluate the approach's performance in clustering tasks and compare it with existing algorithms.

Main Methods:

A stochastic search technique is employed within a connectionist network framework.
The approach assumes increased processing capability for individual nodes.
The squared-error criterion (SEC) for partitional clustering is formulated as a function optimization problem.

Main Results:

The proposed stochastic connectionist approach successfully avoids local optima.
Robustness was demonstrated across multi-modal functions with varying numbers of variables.
Clustering results using the SEC criterion were comparable to K-means and simulated annealing (SA).

Conclusions:

The stochastic connectionist approach is a viable and robust method for function optimization.
The approach's amenability to parallelization allows for efficient utilization of parallel hardware.
This method offers a promising alternative for complex optimization and clustering tasks.