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

Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Methods of Medium Optimization01:28

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

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...
Optimizing Chromatographic Separations01:15

Optimizing Chromatographic Separations

Optimizing chromatographic separations is crucial for obtaining clean separations in a minimum amount of time. Optimization is required for several factors, including kinetic effects related to band broadening, plate height, capacity factor, and separation factor.
Band broadening refers to spreading solute bands as they travel through the column. This broadening can impact resolution. Plate height (H) represents the length required for one theoretical plate. A lower plate height corresponds to...
Compacting Factor test01:22

Compacting Factor test

The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...

You might also read

Related Articles

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

Sort by
Same author

Quantitative matching of forensic evidence fragments using fracture surface topography and statistical learning.

Nature communications·2024
Same author

A practical model-based segmentation approach for improved activation detection in single-subject functional magnetic resonance imaging studies.

Human brain mapping·2023
Same author

Personalized synthetic MR imaging with deep learning enhancements.

Magnetic resonance in medicine·2022
Same author

Reduced-Rank Tensor-on-Tensor Regression and Tensor-Variate Analysis of Variance.

IEEE transactions on pattern analysis and machine intelligence·2022
Same author

Quantitative matching of forensic evidence fragments utilizing 3D microscopy analysis of fracture surface replicas.

Journal of forensic sciences·2022
Same author

Classification with the matrix-variate-<i>t</i> distribution.

Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America·2021
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Jun 26, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

Initializing partition-optimization algorithms.

Ranjan Maitra1

  • 1Department of Statistics, Iowa State University, Ames, IA 50011-1210, USA. maitra@iastate.edu

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|January 31, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel clustering initialization method to overcome limitations of existing algorithms. The staged approach finds optimal initial values, yielding excellent experimental results for diverse datasets.

More Related Videos

Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

Related Experiment Videos

Last Updated: Jun 26, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

Area of Science:

  • Data Science
  • Machine Learning
  • Computational Biology

Background:

  • Clustering is crucial for data analysis across many applications.
  • Traditional methods like k-means and expectation-maximization (EM) are sub-optimal, relying heavily on initial values.
  • These algorithms often converge to local optima, limiting their effectiveness.

Purpose of the Study:

  • To propose a novel, staged approach for specifying initial values in clustering algorithms.
  • To improve the accuracy and robustness of clustering by addressing the initialization problem.
  • To offer a superior alternative to existing initialization techniques.

Main Methods:

  • A staged approach is presented: first, identifying numerous local modes within the dataset.
  • Second, selecting representative initial values from the most spatially separated modes.
  • Comparative assessment against common initialization methods.

Main Results:

  • Experimental results demonstrate excellent performance of the proposed algorithm.
  • The new method significantly outperforms commonly-used initialization approaches.
  • The methodology is successfully applied to diurnal microarray gene expression and mercury release datasets.

Conclusions:

  • The proposed staged initialization method offers a significant improvement over existing techniques.
  • This approach enhances clustering accuracy and reliability.
  • The algorithm's applicability is validated on real-world biological and environmental datasets.