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

Binomial Probability Distribution01:15

Binomial Probability Distribution

10.2K
A binomial distribution is a probability distribution for a procedure with a fixed number of trials, where each trial can have only two outcomes.
The outcomes of a binomial experiment fit a binomial probability distribution. A statistical experiment can be classified as a binomial experiment if the following conditions are met:
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n denotes the number of trials.
There are only two possible outcomes,...
10.2K
Factorial Design02:01

Factorial Design

13.0K
Factorial Analysis is an experimental design that applies Analysis of Variance (ANOVA) statistical procedures to examine a change in a dependent variable due to more than one independent variable, also known as factors. Changes in worker productivity can be reasoned, for example, to be influenced by salary and other conditions, such as skill level. One way to test this hypothesis is by categorizing salary into three levels (low, moderate, and high) and skills sets into two levels (entry level...
13.0K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

40
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...
40
Randomized Experiments01:13

Randomized Experiments

6.7K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
6.7K
Probability in Statistics01:14

Probability in Statistics

12.4K
Probability is the likelihood of an event occurring. The term event is defined as a collection of results of a procedure. An event is a simple event when an outcome cannot be divided into simpler parts.
An example of a simple event is a coin toss. The result of a coin toss is either a head or a tail. Here, head and tail are two simple events. These two simple events make up the sample space. Further, the probability of an event occurring falls within the range of 0 to 1. The probability of an...
12.4K
Decision Making: P-value Method01:09

Decision Making: P-value Method

5.3K
The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim  is also stated. These statements can act as null and alternative hypotheses:  a null hypothesis would be a neutral statement while the alternative hypothesis can...
5.3K

You might also read

Related Articles

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

Sort by
Same journal

DARUMA: a gateway to fast and easy prediction of intrinsically disordered regions.

PeerJ. Computer science·2026
Same journal

Alzheimer's disease detection using a quantum deep neural network with Haralick feature extraction and simulated annealing optimization.

PeerJ. Computer science·2026
Same journal

Network anomaly detection using Deep Autoencoder and parallel Artificial Bee Colony algorithm-trained neural network.

PeerJ. Computer science·2026
Same journal

An anomaly detection model for multivariate time series with anomaly perception.

PeerJ. Computer science·2026
Same journal

Retraction: A wormhole attack detection method for tactical wireless sensor networks.

PeerJ. Computer science·2026
Same journal

Evaluation of mental disorder with prioritization of its type by utilizing the bipolar complex fuzzy decision-making approach based on Schweizer-Sklar prioritized aggregation operators.

PeerJ. Computer science·2026
See all related articles

Related Experiment Video

Updated: Jun 5, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.4K

Probability-boosting technique for combinatorial optimization.

Sanpawat Kantabutra1

  • 1Department of Computer Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai, Chang Wat Chiang Mai, Thailand.

Peerj. Computer Science
|December 9, 2024
PubMed
Summary
This summary is machine-generated.

This study introduces a faster randomized strategy for combinatorial optimization problems, significantly improving the efficiency of finding specific sets of items compared to deterministic methods.

Keywords:
Algorithm design and analysisRandomized algorithms

More Related Videos

Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology
06:24

Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology

Published on: December 15, 2017

10.0K
High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method
07:51

High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method

Published on: May 21, 2018

11.7K

Related Experiment Videos

Last Updated: Jun 5, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.4K
Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology
06:24

Generic Protocol for Optimization of Heterologous Protein Production Using Automated Microbioreactor Technology

Published on: December 15, 2017

10.0K
High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method
07:51

High-throughput Identification of Synergistic Drug Combinations by the Overlap2 Method

Published on: May 21, 2018

11.7K

Area of Science:

  • Computer Science
  • Algorithm Analysis
  • Discrete Mathematics

Background:

  • Combinatorial optimization problems often require identifying a specific subset of k items from a larger set of n items that satisfy certain properties.
  • Deterministic algorithms for these problems can be inefficient, requiring extensive verification of item sets.
  • Randomized approaches can also be computationally expensive, with verification costs growing rapidly with set size.

Purpose of the Study:

  • To introduce a novel, faster randomized strategy for solving combinatorial optimization problems.
  • To enhance the probability of successfully identifying a target set of k items.
  • To demonstrate the applicability and superiority of this probability boosting technique in practical scenarios.

Main Methods:

  • Development of a probability boosting technique to amplify the likelihood of selecting the desired set of k items.
  • Application of this technique to three distinct combinatorial optimization problems.
  • Comparative analysis of the new randomized algorithms against their deterministic counterparts.

Main Results:

  • The proposed randomized strategy significantly accelerates the process of finding the target set of k items.
  • The probability boosting technique demonstrably increases the chances of successful identification.
  • Algorithms employing this technique exhibit superior performance over deterministic algorithms in all tested applications.

Conclusions:

  • The probability boosting technique offers a more efficient approach to solving a class of combinatorial optimization problems.
  • This randomized strategy provides a powerful alternative to traditional deterministic methods.
  • The method shows broad applicability and significant performance gains across various optimization tasks.