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...
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...
Sampling Plans01:23

Sampling Plans

Sampling is a crucial step in analytical chemistry, allowing researchers to collect representative data from a large population. Common sampling methods include random, judgmental, systematic, stratified, and cluster sampling.
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...
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...
Fisher's Exact Test01:08

Fisher's Exact Test

Fisher's exact test is a statistical significance test widely used to analyze 2x2 contingency tables, particularly in situations where sample sizes are small. Unlike the chi-squared test, which approximates P-values and assumes minimum expected frequencies of at least five in each cell, Fisher's exact test calculates the exact probability (P-value) of observing the data or more extreme results under the null hypothesis. This feature makes it especially valuable when the assumptions of the...
F Distribution01:19

F Distribution

The F distribution was named after Sir Ronald Fisher, an English statistician. The F statistic is a ratio (a fraction) with two sets of degrees of freedom; one for the numerator and one for the denominator. The F distribution is derived from the Student's t distribution. The values of the F distribution are squares of the corresponding values of the t distribution. One-Way ANOVA expands the t test for comparing more than two groups. The scope of that derivation is beyond the level of this...

You might also read

Related Articles

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

Sort by
Same author

Advanced Acoustic Monitoring Using Psychoacoustic Heatmap Machine Learning Models for Noise Impact Prediction in Air-Conditioned Building Environments.

Sensors (Basel, Switzerland)·2026
Same author

Open-world electrocardiogram classification via domain knowledge-driven contrastive learning.

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

Residual Sketch Learning for a Feature-Importance-Based and Linguistically Interpretable Ensemble Classifier.

IEEE transactions on neural networks and learning systems·2023
Same author

KAT: A Knowledge Adversarial Training Method for Zero-Order Takagi-Sugeno-Kang Fuzzy Classifiers.

IEEE transactions on cybernetics·2020
Same author

Network Together: Node Classification via Cross-Network Deep Network Embedding.

IEEE transactions on neural networks and learning systems·2020
Same author

Recognition of Multiclass Epileptic EEG Signals Based on Knowledge and Label Space Inductive Transfer.

IEEE transactions on neural systems and rehabilitation engineering : a publication of the IEEE Engineering in Medicine and Biology Society·2019

Related Experiment Video

Updated: Jun 26, 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

Generalized fuzzy C-means clustering algorithm with improved fuzzy partitions.

Lin Zhu1, Fu-Lai Chung, Shitong Wang

  • 1School of Information Technology, Southern Yangtze University, Wuxi 214036, China.

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society
|January 29, 2009
PubMed
Summary

A new generalized fuzzy c-means clustering algorithm (GIFP-FCM) enhances clustering effectiveness by optimizing the fuzziness index, outperforming existing methods in robustness and accuracy, particularly for noisy image texture segmentation.

Related Experiment Videos

Last Updated: Jun 26, 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:

  • Data Science
  • Machine Learning
  • Computer Vision

Background:

  • The fuzziness index (m) significantly impacts fuzzy clustering results.
  • Traditional fuzzy c-means (FCM) algorithms often fix 'm' at 2, limiting their application.
  • Improved fuzzy partitions FCM (IFP-FCM) offers advancements but retains limitations.

Purpose of the Study:

  • To extend IFP-FCM and propose a generalized algorithm (GIFP-FCM).
  • To enhance fuzzy clustering effectiveness and robustness.
  • To address the limitations of fixed fuzziness index values in clustering.

Main Methods:

  • Introduction of a novel membership constraint function.
  • Construction of a new objective function for GIFP-FCM.
  • Analysis of robustness and convergence using L(p) norm distance and competitive learning.

Main Results:

  • GIFP-FCM demonstrates superior clustering and robustness compared to FCM and IFP-FCM.
  • The proposed algorithm shows effectiveness in noisy image texture segmentation.
  • FCM and IFP-FCM are identified as special cases of GIFP-FCM.

Conclusions:

  • GIFP-FCM offers a more effective and robust fuzzy clustering approach.
  • The generalized algorithm overcomes limitations of fixed fuzziness indices.
  • The method shows promise for applications like image analysis.