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

Search research articles

Related Experiment Video

Updated: Jul 4, 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

Online clustering algorithms.

Wesam Barbakh¹, Colin Fyfe

¹The University of Paisley, Scotland, UK. wesam.barbakh@paisley.ac.uk

International Journal of Neural Systems

|July 3, 2008

Summary

This summary is machine-generated.

Related Concept Videos

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

Evolutionary Relationships through Genome Comparisons

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...

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

Sampling Plans

Sampling Plans

Sampling is a crucial step in analytical chemistry, allowing researchers to collect representative data from a large population. Common sampling methods include random, judgmental, systematic, stratified, and cluster sampling.
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...

Distance Problem

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...

Modern Molecular Taxonomy

Modern Molecular Taxonomy

Advancements in molecular biology have revolutionized the identification and characterization of bacteria, with multiple methods leveraging DNA sequencing for enhanced precision. As sequencing technologies improve and costs decline, these approaches are increasingly used in clinical, environmental, and evolutionary studies.Multilocus Sequence Typing (MLST) examines several housekeeping genes, essential chromosomal genes encoding cellular functions, to distinguish strains. Approximately...

You might also read

Related Articles

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

Sort by

Same author

Novel Machine Learning HIV Intervention for Sexual and Gender Minority Young People Who Have Sex With Men (uTECH): Protocol for a Randomized Comparison Trial.

JMIR research protocols·2024

Same author

Introduction.

International journal of neural systems·2010

Same author

Topological mappings of video and audio data.

International journal of neural systems·2009

Same author

Two forms of immediate reward reinforcement learning for exploratory data analysis.

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

Same author

A canonical correlation neural network for multicollinearity and functional data.

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

Same author

Twinned principal curves.

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

New clustering algorithms avoid K-means local optima by using online learning and latent spaces. These methods find global solutions, overcoming sensitivity to initial conditions for improved data analysis.

Area of Science:

Computer Science
Machine Learning
Data Mining

Background:

K-means clustering is widely used but sensitive to initial conditions, often converging to local optima.
This limitation hinders the discovery of globally optimal cluster assignments in datasets.

Purpose of the Study:

Introduce novel clustering algorithms designed to overcome K-means' local optimum problem.
Develop online learning methods for improved convergence and explore latent space extensions for topology preservation.

Main Methods:

Designed a new performance function for clustering algorithms to ensure global optimum convergence.
Derived online learning algorithms to demonstrate convergence to optimal solutions.
Extended algorithms with a latent space for topology-preserving mapping.

More Related Videos

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

Related Experiment Videos

Last Updated: Jul 4, 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

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

Main Results:

Algorithms demonstrated convergence to global optima where K-means failed.
Visualisation results on standard datasets confirmed the effectiveness of the proposed methods.
The latent space extension enabled topology-preserving mappings.

Conclusions:

The proposed clustering algorithms offer a robust alternative to K-means, effectively addressing local optima issues.
Online learning and latent space integration enhance clustering performance and data representation.