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

Randomized Experiments01:13

Randomized Experiments

8.0K
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...
8.0K
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

444
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
444
Random Sampling Method01:09

Random Sampling Method

12.6K
Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures 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. Among the various sampling methods used by...
12.6K
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

347
Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
347
Unusual Results01:16

Unusual Results

3.3K
Unusual results are those that have a very low chance of occurring. Unusual results can be identified using probabilities and the range rule of thumb. In problems involving probability, unusual results can be observed in 2 instances – an unusually high number of successes or an unusually low number of successes.
According to the range rule of thumb, any value above or below two standard deviations, 2σ  from the mean, μ  is considered unusual.
Maximum unusual value =...
3.3K
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.3K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.3K

You might also read

Related Articles

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

Sort by
Same author

Restless reachability problems in temporal graphs.

Knowledge and information systems·2025
Same author

Regularized impurity reduction: accurate decision trees with complexity guarantees.

Data mining and knowledge discovery·2023
Same author

Scalably Using Node Attributes and Graph Structure for Node Classification.

Entropy (Basel, Switzerland)·2022
Same author

Ranking with submodular functions on a budget.

Data mining and knowledge discovery·2022
Same author

Strengthening ties towards a highly-connected world.

Data mining and knowledge discovery·2022
Same author

Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints.

Big data·2020
Same journal

Topology only pre-training: towards generalised multi-domain graph models.

Data mining and knowledge discovery·2026
Same journal

Detection and evaluation of clusters within sequential data.

Data mining and knowledge discovery·2025
Same journal

Universal representation learning for multivariate time series using the instance-level and cluster-level supervised contrastive learning.

Data mining and knowledge discovery·2025
Same journal

Missing value replacement in strings and applications.

Data mining and knowledge discovery·2025
Same journal

Robust explainer recommendation for time series classification.

Data mining and knowledge discovery·2024
Same journal

Somtimes: self organizing maps for time series clustering and its application to serious illness conversations.

Data mining and knowledge discovery·2024
See all related articles

Related Experiment Video

Updated: Sep 27, 2025

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K

Provable randomized rounding for minimum-similarity diversification.

Bruno Ordozgoiti1, Ananth Mahadevan2, Antonis Matakos1

  • 1Department of Computer Science, Aalto University, Espoo, Finland.

Data Mining and Knowledge Discovery
|April 11, 2022
PubMed
Summary
This summary is machine-generated.

This study introduces a new method for finding diverse item sets using similarity measures, overcoming computational challenges. The efficient randomized algorithm offers provably good solutions, outperforming common greedy approaches.

Keywords:
DiversificationQuadratic programmingRandomized roundingRecommender systems

More Related Videos

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.7K
An R-Based Landscape Validation of a Competing Risk Model
05:37

An R-Based Landscape Validation of a Competing Risk Model

Published on: September 16, 2022

2.2K

Related Experiment Videos

Last Updated: Sep 27, 2025

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K
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.7K
An R-Based Landscape Validation of a Competing Risk Model
05:37

An R-Based Landscape Validation of a Competing Risk Model

Published on: September 16, 2022

2.2K

Area of Science:

  • Computer Science
  • Data Science
  • Information Retrieval

Background:

  • Information retrieval often requires selecting diverse sets of items to explore various concepts.
  • Existing methods for finding diverse sets primarily use distance functions, leaving a gap for similarity-based approaches.
  • Computational challenges exist in finding sets with minimal pairwise similarities.

Purpose of the Study:

  • To address the problem of finding diverse item sets using similarity functions.
  • To formulate a flexible minimization objective for diversification tasks.
  • To develop an efficient and parallelizable randomized algorithm for diversification.

Main Methods:

  • Formulated a diversification task with a minimization objective including pairwise similarities and a relevance penalty.
  • Employed a randomized rounding strategy with independent rounding for analysis.
  • Developed a novel bound for the ratio of Poisson-Binomial densities.

Main Results:

  • An efficient randomized algorithm was designed, providing a lower-order additive approximation guarantee.
  • The independent rounding approach proved to be faster, simpler, and parallelizable.
  • The proposed method consistently outperformed traditional greedy approaches on benchmark datasets.

Conclusions:

  • The study successfully developed a novel, efficient randomized algorithm for similarity-based set diversification.
  • The method offers theoretical guarantees and practical advantages over existing techniques.
  • The findings have implications for combinatorial optimization and information retrieval.