Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Cluster Sampling Method

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

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Measures of Central Tendency

Measures of Central Tendency

The "center" of a data set is also a way of describing location. The two most widely used measures of the "center" of the data are the mean (average) and the median. The words "mean" and "average" are often used interchangeably. The substitution of one word for the other is common practice. The technical term is "arithmetic mean" and "average" is technically a center location. However, in practice among non-statisticians, "average" is commonly accepted for "arithmetic mean."

Aggregates Classification

Aggregates Classification

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

Multiple Comparison Tests

Multiple Comparison Tests

Multiple comparison test, abbreviated as MCT, is a post hoc analysis generally performed after comparing multiple samples with one or more tests. An MCT will help identify a significantly different sample among multiple samples or a factor among multiple factors.
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...

You might also read

Related Articles

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

Sort by

Same author

<i>In vitro</i> efficacy of antibiotics and bacteriophages against <i>Pseudomonas aeruginosa</i> isolates from clinically affected captive falcons in Dubai, United Arab Emirates.

One health (Amsterdam, Netherlands)·2026

Same author

Types and correlates of school absenteeism among students with intellectual disability.

Journal of intellectual disability research : JIDR·2023

Same author

Behavioural adjustment of children with intellectual disability and their sibling is associated with their sibling relationship quality.

Journal of intellectual disability research : JIDR·2023

Same author

Improved Neutron Lifetime Measurement with UCNτ.

Physical review letters·2021

Same author

The willingness of UK adults with intellectual disabilities to take COVID-19 vaccines.

Journal of intellectual disability research : JIDR·2021

Same author

GABA<sub>B</sub> Receptor Chemistry and Pharmacology: Agonists, Antagonists, and Allosteric Modulators.

Current topics in behavioral neurosciences·2021

Search research articles

Related Experiment Video

Updated: May 29, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

Cluster definition by the optimization of simple measures.

T Bailey¹, J Cowles

¹Department of Computer Science, University of Wyoming, Laramie, WY 82071.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|August 27, 2011

Summary

This study introduces graph-based clustering using edge counts to define compact and isolated subsets. A new algorithm efficiently searches for optimal clusters in low-dimensional data, proving a related problem is NP-complete.

Related Experiment Videos

Last Updated: May 29, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

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:

Graph theory
Computer science
Data mining

Background:

Clustering algorithms are essential for data analysis.
Existing methods may not efficiently handle graph-based data structures.
Defining and identifying clusters based on graph properties requires robust metrics.

Purpose of the Study:

To develop novel graph-based clustering measures: compactness and isolation.
To investigate the computational complexity of the cluster search problem.
To design an efficient algorithm for finding optimal clusters in graphs.

Main Methods:

Defined cluster compactness by internal edge counts within a subset S.
Defined cluster isolation by the negative count of external edges from subset S.
Formulated the cluster search as maximizing a linear combination of compactness and isolation.
Proved the NP-completeness of a related decision problem.
Developed a pruned search tree algorithm for efficient cluster discovery.

Main Results:

Established quantitative measures for graph-based cluster compactness and isolation.
Demonstrated that the cluster search problem is computationally challenging (NP-complete).
The pruned search tree algorithm significantly outperforms complete search for low-dimensional data.

Conclusions:

The proposed graph-based clustering measures provide a formal framework for identifying meaningful subsets.
The NP-completeness result highlights the inherent difficulty of the general cluster search problem.
The developed algorithm offers a practical and efficient solution for clustering in specific graph structures, particularly those derived from low-dimensional spaces.