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

12.0K
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.0K
Aggregates Classification01:29

Aggregates Classification

356
Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
356
Kendall's Coefficient of Concordance01:20

Kendall's Coefficient of Concordance

448
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...
448
Comparing the Survival Analysis of Two or More Groups01:20

Comparing the Survival Analysis of Two or More Groups

234
Survival analysis is a cornerstone of medical research, used to evaluate the time until an event of interest occurs, such as death, disease recurrence, or recovery. Unlike standard statistical methods, survival analysis is particularly adept at handling censored data—instances where the event has not occurred for some participants by the end of the study or remains unobserved. To address these unique challenges, specialized techniques like the Kaplan-Meier estimator, log-rank test, and...
234
Associative Learning01:27

Associative Learning

474
Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
474
Survival Tree01:19

Survival Tree

126
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
126

You might also read

Related Articles

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

Sort by
Same author

Hierarchical feature based dual contrastive multiview clustering.

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

Nano-vectors for CRISPR/Cas9-Mediated Genome Editing.

Nano today·2026
Same author

Unsupervised feature selection via row-sparse local preserving projection.

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

Transparent EMI shielding and a thermal insulating optical window based on a randomized metallic mesh and ITO-based coating.

Applied optics·2026
Same author

Colossal Photovoltaic Current in Ferroelectric Oxide by Constructing Defect Band.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation.

IEEE transactions on pattern analysis and machine intelligence·2026

Related Experiment Video

Updated: Aug 4, 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.0K

Fast Clustering via Maximizing Adaptively Within-Class Similarity.

Jingjing Xue, Feiping Nie, Rong Wang

    IEEE Transactions on Neural Networks and Learning Systems
    |April 6, 2023
    PubMed
    Summary

    This study introduces three novel clustering models that enhance data grouping by maximizing within-class similarity. These fast algorithms offer superior performance on various datasets, improving data structure insights.

    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.6K
    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.5K

    Related Experiment Videos

    Last Updated: Aug 4, 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.0K
    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.6K
    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.5K

    Area of Science:

    • Computer Science
    • Data Science
    • Machine Learning

    Background:

    • Clustering algorithms group similar data points and separate dissimilar ones.
    • Traditional methods may not fully capture complex data structures.
    • Maximizing within-class similarity is a key objective in clustering.

    Purpose of the Study:

    • To propose three novel, fast clustering models.
    • To improve the instinct clustering structure of data.
    • To leverage dual information between rows and columns through co-clustering.

    Main Methods:

    • A pseudo label propagation algorithm divides samples into initial subclasses.
    • Three co-clustering models merge these subclasses into final clusters.
    • The models are motivated by maximizing the sum of within-class similarity.
    • The pseudo label propagation algorithm constructs anchor graphs with linear time complexity.

    Main Results:

    • Experimental results on synthetic and real-world datasets demonstrate superior performance.
    • The proposed models effectively capture inherent data structures.
    • FMAWS2 generalizes FMAWS1, and FMAWS3 generalizes the other two models.

    Conclusions:

    • The novel clustering models offer significant improvements over traditional methods.
    • The approach effectively preserves local information and utilizes dual data information.
    • The pseudo label propagation algorithm provides an efficient method for anchor graph construction.