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

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

RNA-seq

RNA-seq

RNA sequencing, or RNA-Seq, is a high-throughput sequencing technology used to study the transcriptome of a cell. Transcriptomics helps to interpret the functional elements of a genome and identify the molecular constituents of an organism. Additionally, it also helps in understanding the development of an organism and the occurrence of diseases.
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while microarray-based...

DNA Microarrays

DNA Microarrays

Microarrays are high-throughput and relatively inexpensive assays that can be automated to analyze large quantities of data at a time. They are used in genome-wide studies to compare gene or protein expression under two varied conditions, such as healthy and diseased states. Microarrays consist of glass or silica slides on which probe molecules are covalently attached through surface functionalization. Most commonly, the slides are prepared through the chemisorption of silanes to silica...

Sampling Plans

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

Combinatorial Gene Control

Combinatorial Gene Control

Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...

You might also read

Related Articles

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

Sort by

Same author

Optimal Set of Features for Leukaemia Images with Extracted Areas of Interest.

Studies in health technology and informatics·2025

Same author

Extracting Regions of Interest and Selective Feature Application in Leukaemia Image Classification.

Studies in health technology and informatics·2025

Same author

Toward quantitative super-resolution methods for cryo-CLEM.

Methods in cell biology·2024

Same author

Preoperative ultrasound study of differentiated thyroid cancer: relevant aspects for its optimal performance. Pictorial essay.

Medical ultrasonography·2023

Same author

Cluster Analysis of Endogenous HER2 and HER3 Receptors in SKBR3 Cells.

Bio-protocol·2021

Same author

A Plant Foreign Body of the Parotid Gland: The Seed That We Didn't See-Ultrasound Features and Review of the Literature.

Journal of ultrasound in medicine : official journal of the American Institute of Ultrasound in Medicine·2020

Search research articles

Related Experiment Video

Updated: Jul 9, 2026

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

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

Published on: October 19, 2021

Optimal search space for clustering gene expression data via consensus.

Michael Hirsch¹, Stephen Swift, Xiohui Liu

¹Department of Intelligent Data Analysis, Brunel University, Uxbridge, United Kingdom. Michael.Hirsch@brunel.ac.uk

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology

|December 7, 2007

Summary

This study introduces two novel greedy algorithms for consensus clustering (CC), an ensemble method. These algorithms efficiently search for optimal solutions within a specific subspace, improving data analysis.

More Related Videos

Analyzing Multifactorial RNA-Seq Experiments with DiCoExpress

Analyzing Multifactorial RNA-Seq Experiments with DiCoExpress

Published on: July 29, 2022

Related Experiment Videos

Last Updated: Jul 9, 2026

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

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

Published on: October 19, 2021

Analyzing Multifactorial RNA-Seq Experiments with DiCoExpress

Analyzing Multifactorial RNA-Seq Experiments with DiCoExpress

Published on: July 29, 2022

Area of Science:

Computational Biology
Machine Learning
Data Mining

Background:

Ensemble clustering methods simplify the selection of appropriate clustering algorithms for data analysis.
Consensus clustering (CC) is a prominent ensemble technique employing artificial intelligence to optimize fitness functions.

Purpose of the Study:

To formally prove the existence of a subspace containing all maximal fitness solutions for consensus clustering.
To propose two novel greedy algorithms for efficiently searching this identified subspace.

Main Methods:

Theoretical analysis to establish the existence of the maximal fitness solution subspace.
Development and implementation of two greedy search algorithms tailored for the CC search space.
Evaluation of the proposed algorithms using gene expression datasets and a synthetic dataset.

Main Results:

Demonstrated the existence of a specific subspace within the consensus clustering search space.
The proposed greedy algorithms effectively navigate this subspace to find maximal fitness solutions.
Comparative analysis showed competitive or improved performance against other ensemble clustering approaches.

Conclusions:

The identified subspace and proposed greedy algorithms offer a more targeted and efficient approach to consensus clustering.
These methods provide valuable tools for researchers in bioinformatics and data mining dealing with complex datasets.