Cluster Sampling Method
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
Vector Algebra: Graphical Method
Comparing the Survival Analysis of Two or More Groups
Collisions in Multiple Dimensions: Problem Solving
Kendall's Coefficient of Concordance
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: May 19, 2026

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
Published on: January 16, 2019
Gema Bello-Orgaz1, Héctor D Menéndez, David Camacho
1Computer Science Department, Escuela Politecnica Superior, Universidad Autónoma de Madrid, 28049, Madrid, Spain. gema.bello@uam.es
This study introduces a genetic algorithm for overlapped graph clustering, enabling automatic detection of community structures in social networks. The method effectively identifies nodes belonging to multiple groups, enhancing social network analysis.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: