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

13.1K
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...
13.1K
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

798
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
798
Sampling Continuous Time Signal01:11

Sampling Continuous Time Signal

413
In signal processing, a continuous-time signal can be sampled using an impulse-train sampling technique, followed by the zero-order hold method. Impulse-train sampling involves the use of a periodic impulse train, which consists of a series of delta functions spaced at regular intervals determined by the sampling period. When a continuous-time signal is multiplied by this impulse train, it generates impulses with amplitudes corresponding to the signal's values at the sampling points.
In the...
413
Sampling Distribution01:12

Sampling Distribution

14.6K
Given simple random samples of size n from a given population with a measured characteristic such as mean, proportion, or standard deviation for each sample, the probability distribution of all the measured characteristics is called a sampling distribution. How much the statistic varies from one sample to another is known as the sampling variability of a statistic. You typically measure the sampling variability of a statistic by its standard error. The standard error of the mean is an example...
14.6K
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

1.9K
Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
1.9K
Random Variables01:09

Random Variables

15.1K
A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
15.1K

You might also read

Related Articles

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

Sort by
Same author

High-order simulation of geological domains and effects on stochastic long-term planning of mining complexes.

Mining technology (Abingdon, Eng.)·2026
Same author

A reinforcement learning approach for selecting infill drilling locations considering long-term production planning in mining complexes with supply uncertainty.

Mining technology (Abingdon, Eng.)·2026
Same author

Joint stochastic optimisation of stope layout, production scheduling and access network.

Mining technology (Abingdon, Eng.)·2026
Same author

Predicting Haul Truck Travel Times in Underground Mines.

Mining, metallurgy & exploration·2025
Same author

A New Non-stationary High-order Spatial Sequential Simulation Method.

Mathematical geosciences·2022
Same author

High-Order Sequential Simulation via Statistical Learning in Reproducing Kernel Hilbert Space.

Mathematical geosciences·2020

Related Experiment Video

Updated: Oct 14, 2025

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.3K

Training Image Free High-Order Stochastic Simulation Based on Aggregated Kernel Statistics.

Lingqing Yao1,2, Roussos Dimitrakopoulos2, Michel Gamache1

  • 1Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montreal, QC H3T 1J4 Canada.

Mathematical Geosciences
|November 1, 2021
PubMed
Summary

This study introduces a novel training image-free simulation method for learning high-order spatial statistics from sparse data. The approach utilizes aggregated kernel statistics for robust inference and simulation, outperforming traditional methods.

Keywords:
High-order sequential simulationKernel spaceSpatial statisticsStatistical learning

More Related Videos

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning
12:06

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning

Published on: March 3, 2023

4.3K
Trajectory Data Analyses for Pedestrian Space-time Activity Study
16:14

Trajectory Data Analyses for Pedestrian Space-time Activity Study

Published on: February 25, 2013

13.7K

Related Experiment Videos

Last Updated: Oct 14, 2025

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.3K
Analyzing Mitochondrial Morphology Through Simulation Supervised Learning
12:06

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning

Published on: March 3, 2023

4.3K
Trajectory Data Analyses for Pedestrian Space-time Activity Study
16:14

Trajectory Data Analyses for Pedestrian Space-time Activity Study

Published on: February 25, 2013

13.7K

Area of Science:

  • Geostatistics
  • Spatial Statistics
  • Machine Learning

Background:

  • Traditional high-order sequential simulation methods often require extensive training image data.
  • Sparse or incomplete spatial data presents a significant challenge for accurate statistical inference and simulation.

Purpose of the Study:

  • To develop a training image-free, high-order sequential simulation method capable of handling sparse data.
  • To introduce a novel statistical learning framework using aggregated kernel statistics for efficient spatial data learning.

Main Methods:

  • A statistical learning framework in kernel space was adopted, utilizing aggregated kernel statistics for sparse data learning.
  • Data events, represented by attribute values and spatial templates, were used as training data.
  • Replicates were mapped into spatial Legendre moment kernel spaces to compute kernel statistics encapsulating high-order spatial information.
  • Aggregated kernel statistics combined elements from different kernel subspaces to utilize incomplete information from replicates.

Main Results:

  • The proposed method successfully reproduced the high-order spatial statistics of the sample data in simulations.
  • Testing on a synthetic dataset demonstrated the method's ability to learn from sparse data.
  • Comparison with a traditional high-order simulation method highlighted the proposed approach's superior generalization capacity for sparse data.

Conclusions:

  • The developed training image-free, high-order sequential simulation method effectively learns and preserves high-order spatial statistics from sparse datasets.
  • The novel aggregated kernel statistics approach offers a robust solution for spatial simulation challenges with limited data.
  • This method shows significant potential for applications requiring accurate spatial modeling with scarce available information.