Related Experiment Video
Updated: Jul 7, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
Partition-based and sharp uniform error bounds
1Math and Computer Science Department, University of Richmond, Richmond, VA 23173, USA.
Abstract:
This paper develops probabilistic bounds on out-of-sample error rates for several classifiers using a single set of in-sample data. The bounds are based on probabilities over partitions of the union of in-sample and out-of-sample data into in-sample and out-of-sample data sets. The bounds apply when in-sample and out-of-sample data are drawn from the same distribution. Partition-based bounds are stronger than Vapnik-Chervonenkis (VC) bounds, but they require more computation.
Related Concept Videos
Uniform Distribution
Midpoint Rule
Improper Integrals: Discontinuous Integrands
Fineness Modulus
Consider performing sieve analysis on sand through a set of ASTM sieves. The weight of aggregate retained in each sieve and pan placed at the bottom is recorded, as given in Column B of Table 1.
To determine the fineness modulus of...
Area Problem
Application of Nonlinear Inequalities

