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...
DNA Microarrays02:34

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

You might also read

Related Articles

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

Sort by
Same author

EpiATLAS - a reference for human epigenomic research.

bioRxiv : the preprint server for biology·2026
Same author

Correcting spatial transcriptomics data affected by a prevalent transcript leakage problem across platforms, species, and tissues.

bioRxiv : the preprint server for biology·2026
Same author

Spatial transcriptomics in Alzheimer's disease: technologies, challenges and discoveries.

Molecular neurodegeneration advances·2026
Same author

HIRA-mediated H3.3 deposition preserves hepatocyte cell identity during liver aging.

Research square·2026
Same author

SpecEStop: Self-Supervised Hyperspectral Mixed Noise Removal via Deep Spectral Prior.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Local and High-Order Consistency Coding and Adaptation for Cross-Hypergraph Node Classification.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

DiffGRN: differential gene regulatory network analysis.

International journal of data mining and bioinformatics·2019
Same journal

Integration of multi-omics data for integrative gene regulatory network inference.

International journal of data mining and bioinformatics·2018
Same journal

The development of non-coding RNA ontology.

International journal of data mining and bioinformatics·2016
Same journal

Learning multiple distributed prototypes of semantic categories for named entity recognition.

International journal of data mining and bioinformatics·2015
Same journal

Weighted fusion regularisation and predicting microbial interactions with vector autoregressive model.

International journal of data mining and bioinformatics·2015
Same journal

Application of consensus string matching in the diagnosis of allelic heterogeneity involving transposition mutation.

International journal of data mining and bioinformatics·2015
See all related articles

Related Experiment Video

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

A semi-supervised approach to projected clustering with applications to microarray data.

Kevin Y Yip1, Lin Cheung, David W Cheung

  • 1Department of Computer Science, Yale University, New Haven, Connecticut, USA. yuklap.yip@yale.edu

International Journal of Data Mining and Bioinformatics
|July 24, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel algorithm for identifying low-dimensional clusters in datasets. Incorporating domain knowledge significantly enhances cluster detection, even with minimal relevant dimensions.

Related Experiment Videos

Last Updated: Jun 21, 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
  • Bioinformatics

Background:

  • Real-world datasets may contain clusters in extremely low-dimensional projections.
  • Existing methods may not effectively leverage domain knowledge for cluster identification.

Purpose of the Study:

  • To propose a new algorithm for identifying extremely low-dimensional projected clusters.
  • To integrate domain knowledge into the clustering and dimension selection process.
  • To demonstrate the algorithm's effectiveness in various scenarios, including microarray data analysis.

Main Methods:

  • A novel algorithm combining object clustering and dimension selection.
  • Incorporation of domain knowledge to guide the clustering process.
  • Semi-supervised approach for knowledge-guided selective clustering.

Main Results:

  • The algorithm successfully identifies extremely low-dimensional projected clusters.
  • Even a small amount of input knowledge improves cluster detection using only 1% of relevant dimensions.
  • The semi-supervised method effectively handles multiple meaningful object groupings.
  • The algorithm demonstrates efficacy in analyzing a microarray dataset.

Conclusions:

  • The proposed algorithm offers an effective method for discovering hidden low-dimensional structures in data.
  • Leveraging domain knowledge is crucial for efficient and accurate cluster identification in high-dimensional datasets.
  • The algorithm shows promise for applications in bioinformatics and other data-intensive fields.