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

13.6K
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...
13.6K
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

3.0K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
3.0K
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

887
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...
887
Multimachine Stability01:25

Multimachine Stability

274
Multimachine stability analysis is crucial for understanding the dynamics and stability of power systems with multiple synchronous machines. The objective is to solve the swing equations for a network of M machines connected to an N-bus power system.
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
274
Distributions to Estimate Population Parameter01:26

Distributions to Estimate Population Parameter

4.7K
The accurate values of population parameters such as population proportion, population mean, and population standard deviation (or variance) are usually unknown. These are fixed values that can only be estimated from the data collected from the samples. The estimates of each of these parameters are sample proportion, the sample mean, and sample standard deviation (or variance). To obtain the values of these sample statistics, data are required that have particular distribution and central...
4.7K
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

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

You might also read

Related Articles

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

Sort by
Same author

Iterative Min Cut Clustering Based on Graph Cuts.

Sensors (Basel, Switzerland)·2021
Same author

[Prediction and identification of B-cell linear epitopes of hepatitis B e antigen].

Nan fang yi ke da xue xue bao = Journal of Southern Medical University·2013
Same author

Genetic analysis of the forkhead transcriptional factor 2 gene in three Chinese families with blepharophimosis syndrome.

Molecular vision·2013
Same author

Large-scale mesoscopic transport in nanostructured graphene.

Physical review letters·2013
Same author

Myeloperoxidase activity and its corresponding mRNA expression as well as gene polymorphism in the population living in the coal-burning endemic fluorosis area in Guizhou of China.

Biological trace element research·2013
Same author

Scanning of novel cancer/testis proteins by human testis proteomic analysis.

Proteomics·2013

Related Experiment Video

Updated: Nov 10, 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.2K

Kernel Probabilistic K-Means Clustering.

Bowen Liu1, Ting Zhang1, Yujian Li2

  • 1Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China.

Sensors (Basel, Switzerland)
|April 3, 2021
PubMed
Summary
This summary is machine-generated.

A new Kernel Probabilistic k-Means (KPKM) model effectively clusters linearly inseparable data, overcoming limitations of Kernel Fuzzy c-Means (KFCM). A fast Active Gradient Projection (FAGP) algorithm accelerates processing, showing significant improvements in speed and performance.

Keywords:
fast active gradient projectionfuzzy c-meanskernel probabilistic k-meansnonlinear programming

More Related Videos

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.7K
JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.4K

Related Experiment Videos

Last Updated: Nov 10, 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.2K
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.7K
JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.4K

Area of Science:

  • Machine Learning
  • Data Mining
  • Pattern Recognition

Background:

  • Kernel Fuzzy c-Means (KFCM) enhances Fuzzy c-Means (FCM) for linearly inseparable data.
  • KFCM faces limitations with the fuzzification parameter m=1, unsolvable by Lagrangian optimization.
  • Existing methods struggle with complex, non-linear data structures.

Purpose of the Study:

  • Introduce Kernel Probabilistic k-Means (KPKM) as an equivalent model to KFCM.
  • Address the m=1 limitation in KFCM within a unified mathematical framework.
  • Develop an efficient optimization method for KPKM.

Main Methods:

  • Proposed Kernel Probabilistic k-Means (KPKM) model.
  • Utilized Active Gradient Projection (AGP), a nonlinear programming technique.
  • Developed a Fast Active Gradient Projection (FAGP) algorithm with a maximum-step strategy and iterative projection matrix updates.

Main Results:

  • KPKM successfully identified nonlinearly separable structures in synthetic datasets.
  • KPKM demonstrated superior clustering performance on at least six of ten real UCI datasets compared to KFCM, KKM, FCM, and k-means.
  • The FAGP algorithm reduced running time by 76-95% on real datasets compared to the original AGP.

Conclusions:

  • KPKM offers a robust solution for clustering linearly inseparable data, overcoming KFCM's m=1 parameter issue.
  • The FAGP algorithm significantly enhances computational efficiency for KPKM.
  • KPKM presents a promising advancement in clustering algorithms for complex datasets.