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

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

738
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...
738
Cluster Sampling Method01:20

Cluster Sampling Method

12.9K
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...
12.9K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

104
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...
104
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

425
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
425
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

340
Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
340
Kendall's Coefficient of Concordance01:20

Kendall's Coefficient of Concordance

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

You might also read

Related Articles

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

Sort by
Same author

Association of Global Longitudinal Strain With Left Ventricular Remodeling and Left Ventricular Hypertrophy in Patients With Acute Myocardial Infarction After PCI: A Small Single-Center Prospective Observational Study.

Health science reports·2026
Same author

Cardiovascular-diabetes-stroke multimorbidity patterns are differentially associated with cognitive trajectories in older Chinese adults.

Scientific reports·2026
Same author

Microglial states associate with lesion dynamics in multiple sclerosis.

Cell reports·2026
Same author

CD300ld on pathologically activated neutrophils promotes tumor immune suppression by binding phosphatidylserine on CD8<sup>+</sup> T cells.

Nature cancer·2026
Same author

Physician Awareness of FDA's Relaxation of REMS-Required Laboratory Testing Requirements and Changes in Prescribing Practices During the COVID-19 Pandemic.

Drug safety·2026
Same author

Chronic HIV infection complicated by pancreatitis, pancreatic tail pseudocyst and atraumatic splenic rupture: a case report.

AIDS research and therapy·2026
Same journal

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

IEEE transactions on neural networks and learning systems·2026
Same journal

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

IEEE transactions on neural networks and learning systems·2026
Same journal

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systems·2026
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Sep 19, 2025

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

7.1K

Near-Optimal Algorithms for Instance-Level Constrained k-Center Clustering.

Longkun Guo, Chaoqi Jia, Kewen Liao

    IEEE Transactions on Neural Networks and Learning Systems
    |June 17, 2025
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces efficient algorithms for constrained k-center clustering, incorporating background knowledge like must-link and cannot-link constraints to enhance data analysis and improve clustering results.

    More Related Videos

    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

    8.3K
    Spatial Separation of Molecular Conformers and Clusters
    10:37

    Spatial Separation of Molecular Conformers and Clusters

    Published on: January 9, 2014

    9.1K

    Related Experiment Videos

    Last Updated: Sep 19, 2025

    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

    7.1K
    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

    8.3K
    Spatial Separation of Molecular Conformers and Clusters
    10:37

    Spatial Separation of Molecular Conformers and Clusters

    Published on: January 9, 2014

    9.1K

    Area of Science:

    • Data Mining
    • Machine Learning
    • Computational Geometry

    Background:

    • Instance-level background knowledge is crucial for improving clustering results in practical applications.
    • Existing clustering methods often struggle to effectively integrate this background knowledge.
    • The k-center clustering algorithm is a widely adopted technique that can be enhanced with constraints.

    Purpose of the Study:

    • To formulate and address the constrained k-center problem by incorporating must-link (ML) and cannot-link (CL) constraints.
    • To develop efficient approximation algorithms for the constrained k-center problem.
    • To validate the performance of the proposed algorithms empirically.

    Main Methods:

    • Formulation of the constrained k-center problem using ML and CL sets.
    • Development of an approximation algorithm using linear programming (LP)-rounding technology with an approximation ratio of 2.
    • Design of a parallelizable greedy algorithm, also achieving an approximation ratio of 2, without relying on LP.

    Main Results:

    • An efficient approximation algorithm for constrained k-center clustering with an approximation ratio of 2 was derived using LP-rounding.
    • A novel, efficiently parallelizable greedy algorithm was developed, matching the approximation ratio of 2 with improved runtime complexity.
    • Empirical evaluations on real datasets demonstrated the superiority of the proposed algorithms over baselines in terms of clustering cost, quality, and runtime.

    Conclusions:

    • The developed algorithms provide efficient and effective solutions for instance-level constrained k-center clustering.
    • The greedy algorithm offers a practical advantage due to its lower runtime complexity and parallelizability.
    • These advancements enable better utilization of background knowledge for improved clustering outcomes in real-world applications.