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

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

68
Pharmacokinetic models are mathematical constructs that represent and predict the time course of drug concentrations in the body, providing meaningful pharmacokinetic parameters. These models are categorized into compartment, physiological, and distributed parameter models.
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...
68
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

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

Cluster Sampling Method

11.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...
11.9K
Model Approaches for Pharmacokinetic Data: Compartment Models01:14

Model Approaches for Pharmacokinetic Data: Compartment Models

91
Compartmental analysis is a widely adopted approach to characterizing drug pharmacokinetics. It uses compartment models that conceptualize the body as a collection of reversibly communicating compartments, each representing a group of tissues exhibiting similar drug distribution characteristics. The movement rate of the drug between these compartments is typically described by first-order kinetics.
Two primary types of compartment models are recognized: mammillary and catenary. The more...
91
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

185
Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures...
185
Midrange01:07

Midrange

3.6K
A somewhat easy to compute quantitative estimate of a data set’s central tendency is its midrange, which is defined as the mean of the minimum and maximum values of an ordered data set.
Simply put, the midrange is half of the data set’s range. Similar to the mean, the midrange is sensitive to the extreme values and hence the prospective outliers. However, unlike the mean, the midrange is not sensitive to all the values of the data set that lie in the middle. Thus, it is prone to...
3.6K

You might also read

Related Articles

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

Sort by
Same author

Variance-constrained multi-view ensemble broad network for imbalanced data.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

Learning to Super-Resolve Face Images via Dual-Domain Multi-scale Feature Interaction.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

A rare solid tumor frequently misdiagnosed as lymphoma: primary colonic Epstein-Barr virus-positive inflammatory follicular dendritic cell sarcoma.

Virchows Archiv : an international journal of pathology·2026
Same author

Effectiveness of heterologous mRNA vaccine boosters during an Omicron wave of COVID-19: a cross-sectional study in Macao (China).

Journal of thoracic disease·2026
Same author

Fast BCIs: Leveraging Dual-Scale Time Windows with Test-Time Adaptation to Enhance Accuracy.

IEEE transactions on bio-medical engineering·2026
Same author

FRE-GAN : Full-resolution efficient convolutional generative adversarial network for retinal vessel segmentation.

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

Related Experiment Video

Updated: Jun 25, 2025

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.5K

IFKMHC: Implicit Fuzzy K-Means Model for High-Dimensional Data Clustering.

Zhaoyin Shi, Long Chen, Weiping Ding

    IEEE Transactions on Cybernetics
    |May 30, 2024
    PubMed
    Summary

    This study introduces an implicit fuzzy k-means model to improve graph-based fuzzy clustering for high-dimensional data. The new method effectively handles redundant information and enhances clustering accuracy, outperforming existing techniques.

    More Related Videos

    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.0K
    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

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

    Published on: January 16, 2019

    11.4K

    Related Experiment Videos

    Last Updated: Jun 25, 2025

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    2.5K
    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.0K
    ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
    05:12

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

    Published on: January 16, 2019

    11.4K

    Area of Science:

    • Data Science
    • Machine Learning
    • Artificial Intelligence

    Background:

    • Graph-information-based fuzzy clustering shows promise but struggles with high-dimensional data due to redundancy and sensitivity to similarity matrix design.
    • Existing methods often require explicit similarity matrix construction, leading to performance limitations.

    Purpose of the Study:

    • To propose an implicit fuzzy k-means (FKMs) model to enhance graph-based fuzzy clustering for high-dimensional datasets.
    • To address challenges of redundant information and similarity matrix sensitivity in graph-enhanced fuzzy clustering.

    Main Methods:

    • Developed an implicit FKMs model that generates a similarity matrix from the fuzzy partition result, bypassing explicit design.
    • Utilized a projection-based technique to manage redundant information without feature extraction.
    • Formulated the fuzzy clustering model based on the similarity matrix derived from the membership matrix.

    Main Results:

    • The implicit FKMs model effectively mitigates issues related to initial values and random fluctuations.
    • The proposed approach significantly enhances the performance of graph-enhanced fuzzy clustering for high-dimensional data.
    • Experimental comparisons demonstrate superior performance against state-of-the-art methods.

    Conclusions:

    • The implicit FKMs model offers a robust and effective solution for graph-enhanced fuzzy clustering in high-dimensional spaces.
    • This method improves clustering stability and accuracy by leveraging implicit similarity matrix generation.
    • The approach presents a competitive advancement in handling complex, high-dimensional datasets.