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

Cluster Sampling Method01:20

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...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
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...
Kendall's Coefficient of Concordance01:20

Kendall's Coefficient of Concordance

Kendall's Coefficient of Concordance (W), also known as Kendall's W, is a non-parametric statistical measure used to assess the agreement or concordance between multiple raters or judges when they rank a set of items. It is often used when you have ordinal data (ranks) and you want to see if there is consistency or consensus among the raters. It is widely applied in research areas such as psychology, medicine, and social sciences, where multiple judges are asked to rank or rate subjects or...
Region of Convergence of Laplace Tarnsform01:20

Region of Convergence of Laplace Tarnsform

The Region of Convergence (ROC) is a fundamental concept in signal processing and system analysis, particularly associated with the Laplace transform. The ROC represents an area in the complex plane where the Laplace transform of a given signal converges, determining the transform's applicability and utility.
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...
Collisions in Multiple Dimensions: Introduction01:05

Collisions in Multiple Dimensions: Introduction

It is far more common for collisions to occur in two dimensions; that is, the initial velocity vectors are neither parallel nor antiparallel to each other. Let's see what complications arise from this. The first idea is that momentum is a vector. Like all vectors, it can be expressed as a sum of perpendicular components (usually, though not always, an x-component and a y-component, and a z-component if necessary). Thus, when the statement of conservation of momentum is written for a problem,...

You might also read

Related Articles

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

Sort by
Same author

Balanced Mix Design and Performance Analysis of High-Modulus Asphalt Mixtures.

Materials (Basel, Switzerland)·2026
Same author

The effect of acute fatigue on somatosensory function differs between trained and untrained individuals.

Scientific reports·2026
Same author

Macromolecular crowding reshapes the conformational landscapes of intrinsically disordered proteins: mechanisms, cellular contexts, and functional consequences.

Current opinion in structural biology·2026
Same author

Force Field Evaluation for an Intrinsically Disordered Domain: MD-NMR-FCS Benchmarking of Protein 4.1G Headpiece Ensembles.

Journal of chemical information and modeling·2026
Same author

Hydrogen-bonded Organic Frameworks Decorated Polymeric High Internal Phase Emulsions as Adsorbents for Solid-Phase Extraction of Estrogens.

Journal of separation science·2026
Same author

Profiling of porcine B-cell receptor heavy-chain repertoires indicates the development of a wide public pseudorabies virus-specific immune response after vaccination and challenge.

Discovery immunology·2026

Related Experiment Video

Updated: Jun 7, 2026

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

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

Published on: February 15, 2017

Optimized data fusion for K-means Laplacian clustering.

Shi Yu1, Xinhai Liu, Léon-Charles Tranchevent

  • 1Signals, Identification, System Theory and Automation, Department of Electrical Engineering, Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium. shiyu@uchicago.edu

Bioinformatics (Oxford, England)
|October 29, 2010
PubMed
Summary

This study introduces Optimized Kernel Laplacian Clustering (OKLC), a novel algorithm for clustering analysis. OKLC automatically optimizes kernel and Laplacian coefficients, significantly outperforming existing methods in data fusion applications.

Related Experiment Videos

Last Updated: Jun 7, 2026

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

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:

  • Machine Learning
  • Data Mining
  • Computational Statistics

Background:

  • Clustering analysis often requires careful selection and combination of kernels and Laplacians.
  • Existing methods may not optimally leverage multiple data sources or automatically tune parameters.
  • Data fusion applications present challenges in integrating diverse information for robust clustering.

Purpose of the Study:

  • To develop a novel algorithm for clustering that automatically optimizes the combination of multiple kernels and Laplacians.
  • To improve clustering performance in data fusion tasks by optimizing kernel and Laplacian coefficients.
  • To provide a method for estimating the optimal number of clusters from the eigenspectrum.

Main Methods:

  • Formulation of a novel algorithm based on a Rayleigh quotient objective function.
  • Solution via a bi-level alternating minimization procedure.
  • Development of three variants of the Optimized Kernel Laplacian Clustering (OKLC) algorithm.

Main Results:

  • The proposed OKLC algorithms demonstrate significantly superior performance compared to existing methods in real-life data fusion applications.
  • Optimized coefficients show a correlation with individual data source performance ranks.
  • The optimal cluster number can be consistently estimated from the eigenspectrum of the combined kernel Laplacian matrix.

Conclusions:

  • OKLC offers an effective approach for combining multiple kernels and Laplacians in clustering.
  • The algorithm provides automatic optimization of crucial parameters, enhancing clustering accuracy.
  • OKLC facilitates robust data fusion and offers a method for determining the optimal number of clusters.