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

The Availability Heuristic01:08

The Availability Heuristic

7.1K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
7.1K
The Representativeness Heuristic02:13

The Representativeness Heuristic

16.8K
The representative heuristic describes a biased way of thinking, in which you unintentionally stereotype someone or something. For example, you may assume that your professors spend their free time reading books and engaging in intellectual conversation, because the idea of them spending their time playing volleyball or visiting an amusement park does not fit in with your stereotypes of professors.
16.8K
The Anchoring-and-Adjustment Heuristic01:25

The Anchoring-and-Adjustment Heuristic

7.8K
In order to make good decisions, we use our knowledge and our reasoning. Often, this knowledge and reasoning is sound and solid. However, sometimes, we are swayed by biases or by others manipulating a situation. For example, let’s say you and three friends wanted to rent a house and had a combined target budget of $1,600. The realtor shows you only very run-down houses for $1,600 and then shows you a very nice house for $2,000. Might you ask each person to pay more in rent to get the...
7.8K
Heuristics01:21

Heuristics

744
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
744
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

322
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
322
Theory of Attribution II: Kelley's Covariation Theory01:29

Theory of Attribution II: Kelley's Covariation Theory

638
Attribution theory plays a crucial role in social psychology, helping to explain how individuals interpret the causes of behavior. One prominent model within this field is Harold Kelley's covariation theory, which provides a systematic approach to determining whether internal traits or external circumstances drive a person's actions. The model posits that individuals rely on three key types of information—consensus, consistency, and distinctiveness—to make these judgments.Consensus:...
638

You might also read

Related Articles

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

Sort by
Same author

Prediction of outcome from spatial Protein profiling of triple-negative breast cancers.

Communications medicine·2026
Same author

Multicenter Histology Image Integration and Multiscale Deep Learning Support Machine Learning-Enabled Pediatric Sarcoma Classification.

Cancer research·2026
Same author

Emerging AI approaches for cancer spatial omics.

GigaScience·2025
Same author

Emerging AI Approaches for Cancer Spatial Omics.

ArXiv·2025
Same author

Multicenter Histology Image Integration and Multiscale Deep Learning for Machine Learning-Enabled Pediatric Sarcoma Classification.

medRxiv : the preprint server for health sciences·2025
Same author

Computational immune synapse analysis reveals T-cell interactions in distinct tumor microenvironments.

Communications biology·2024
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Feb 12, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.7K

Heuristic algorithms for feature selection under Bayesian models with block-diagonal covariance structure.

Ali Foroughi Pour1, Lori A Dalton2,3

  • 1Department of Electrical and Computer Engineering, The Ohio State University, 2015 Neil Avenue, Columbus, Ohio, 43210, USA. foroughipour.1@osu.edu.

BMC Bioinformatics
|March 29, 2018
PubMed
Summary
This summary is machine-generated.

New heuristic algorithms improve feature selection for identifying cancer biomarkers, outperforming existing methods on synthetic and real-world data. These tools enhance biomarker discovery and gene interaction analysis in high-dimensional datasets.

Keywords:
Bayesian learningBiomarker discoveryFeature selectionHeuristic search algorithms

More Related Videos

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
07:15

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

Published on: August 16, 2020

7.6K
Author Spotlight: An Accurate and Quantitative Approach to Study Visual Feature Selectivity of the Optokinetic Reflex in Mice
09:28

Author Spotlight: An Accurate and Quantitative Approach to Study Visual Feature Selectivity of the Optokinetic Reflex in Mice

Published on: June 23, 2023

3.8K

Related Experiment Videos

Last Updated: Feb 12, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.7K
Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
07:15

Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

Published on: August 16, 2020

7.6K
Author Spotlight: An Accurate and Quantitative Approach to Study Visual Feature Selectivity of the Optokinetic Reflex in Mice
09:28

Author Spotlight: An Accurate and Quantitative Approach to Study Visual Feature Selectivity of the Optokinetic Reflex in Mice

Published on: June 23, 2023

3.8K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Bioinformatics studies often seek features to distinguish between groups, especially when individual markers are weak or gene interactions are key.
  • Hierarchical Bayesian frameworks offer a prior for feature selection and label-conditioned distributions, but optimal algorithms are computationally intractable.
  • Previous work introduced the 2MNC-Robust algorithm to address computational barriers in Bayesian feature selection.

Purpose of the Study:

  • To develop and evaluate novel heuristic algorithms for feature selection within a hierarchical Bayesian framework.
  • To improve upon the performance of existing methods, including 2MNC-Robust, in identifying relevant biological markers.
  • To explore the utility of these algorithms in biomarker discovery and the analysis of gene interactions.

Main Methods:

  • Development of three new heuristic algorithms for feature selection.
  • Evaluation of algorithms on synthetic datasets to compare performance against 2MNC-Robust and other popular methods.
  • Application of algorithms to real-world cancer datasets (breast cancer, colon cancer, leukemia) for enrichment analysis.

Main Results:

  • The proposed heuristic algorithms demonstrated superior performance compared to 2MNC-Robust and other feature selection algorithms on synthetic data.
  • Enrichment analysis of real cancer data revealed that the algorithms identified known cancer-related genes and pathways.
  • One algorithm, SPM, effectively outputs blocks of correlated genes, aiding in the study of gene interactions.

Conclusions:

  • Bayesian feature selection is a powerful framework for high-dimensional, small-sample data, particularly for biomarker discovery.
  • The developed algorithms successfully identified known cancer biomarkers and potential new ones in real cancer datasets.
  • The SPM algorithm's ability to identify gene blocks is valuable for studying gene interaction networks and biological pathways.