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.8K
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.8K
Optimal Foraging00:48

Optimal Foraging

13.2K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
13.2K
Elastic Collisions: Case Study01:15

Elastic Collisions: Case Study

19.9K
Elastic collision of a system demands conservation of both momentum and kinetic energy. To solve problems involving one-dimensional elastic collisions between two objects, the equations for conservation of momentum and conservation of internal kinetic energy can be used. For the two objects, the sum of momentum before the collision equals the total momentum after the collision. An elastic collision conserves internal kinetic energy, and so the sum of kinetic energies before the collision equals...
19.9K
Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

5.1K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
5.1K
Short-distance Transport of Resources02:12

Short-distance Transport of Resources

17.3K
Short-distance transport refers to transport that occurs over a distance of just 2-3 cells, crossing the plasma membrane in the process. Small uncharged molecules, such as oxygen, carbon dioxide, and water, can diffuse across the plasma membrane on their own. In contrast, ions and larger molecules require the assistance of transport proteins due to their charge or size. Transport across membranes also occurs within individual cells, playing a variety of essential roles for the plant as a whole.
17.3K
Selected Data About Geographic Locations01:25

Selected Data About Geographic Locations

211
Geographic Information Systems (GIS) rely on two core types of data: spatial data and attribute data.Spatial DataSpatial data defines the physical location of features within a coordinate system, typically expressed in terms of latitude and longitude. It provides precise positioning for elements like roads, rivers, or buildings.Attribute DataAttribute data complements spatial data by adding descriptive information about these features. For example, a road's spatial data includes its start and...
211

You might also read

Related Articles

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

Sort by
Same author

GRLT: Learning more from teachers by rethinking knowledge distillation from GNNs to MLPs.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

A Method for Data Augmentation in Vertical Federated Learning Addressing Data Heterogeneity.

IEEE transactions on neural networks and learning systems·2026
Same author

Hierarchical Causal Learning for Face Age Synthesis.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

GBFRS: Robust Fuzzy Rough Sets via Granular Ball Computing.

IEEE transactions on neural networks and learning systems·2026
Same author

A Novel Approach to GNN Explainability: Distilling Knowledge With Inter-Layer Alignment.

IEEE transactions on pattern analysis and machine intelligence·2025
Same author

FDSRM: A Feature-Driven Style-Agnostic Foundation Model for Sketch-Less Facial Image Retrieval.

IEEE transactions on neural networks and learning systems·2025
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
Same journal

CAFF-CIL: Causality-Aware Freedom Forgetting Approach for Class-Incremental Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Harmonic Autoencoding Framework for Multiple Tasks in Magnetic Particle Imaging Reconstruction.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Survey on Human-Centric Voice-Face Multimodal Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Vision-Assisted Foundation Model for Solving Multitask Vehicle Routing Problems.

IEEE transactions on neural networks and learning systems·2026
Same journal

FP3O: Enabling Proximal Policy Optimization in Multiagent Cooperation With Parameter-Sharing Versatility.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Dec 23, 2025

Mining Spatial Transcriptomics Datasets using DeepSpaceDB
10:16

Mining Spatial Transcriptomics Datasets using DeepSpaceDB

Published on: September 5, 2025

554

Mining Maximal Dynamic Spatial Colocation Patterns.

Xin Hu, Guoyin Wang, Jiangli Duan

    IEEE Transactions on Neural Networks and Learning Systems
    |April 21, 2020
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces dynamic spatial colocation patterns to capture changing relationships between geographic features. The new method efficiently finds key patterns, improving analysis of spatial data dynamics.

    More Related Videos

    Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
    11:52

    Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

    Published on: February 9, 2017

    6.3K
    Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example
    08:45

    Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

    Published on: October 24, 2012

    15.1K

    Related Experiment Videos

    Last Updated: Dec 23, 2025

    Mining Spatial Transcriptomics Datasets using DeepSpaceDB
    10:16

    Mining Spatial Transcriptomics Datasets using DeepSpaceDB

    Published on: September 5, 2025

    554
    Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
    11:52

    Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

    Published on: February 9, 2017

    6.3K
    Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example
    08:45

    Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

    Published on: October 24, 2012

    15.1K

    Area of Science:

    • Geographic Information Science
    • Spatial Data Mining
    • Computational Geography

    Background:

    • Traditional spatial colocation pattern mining struggles with dynamic feature changes (e.g., new/dead instances).
    • Existing algorithms may miss significant patterns and are inefficient due to the large number of potential patterns.

    Purpose of the Study:

    • To propose the concept of dynamic spatial colocation patterns to better represent spatial feature relationships.
    • To develop an efficient method for mining prevalent maximal dynamic spatial colocation patterns.
    • To address limitations in existing spatial colocation pattern mining techniques.

    Main Methods:

    • Introduced the concept of dynamic spatial colocation patterns.
    • Developed an algorithm for mining prevalent maximal dynamic spatial colocation patterns.
    • Proposed two pruning strategies to enhance mining efficiency.

    Main Results:

    • The proposed method successfully identifies meaningful dynamic spatial colocation patterns.
    • The approach effectively handles feature instances that increase or decrease in proportion.
    • Mining prevalent maximal patterns significantly improves efficiency.

    Conclusions:

    • The novel dynamic spatial colocation pattern approach enhances the analysis of spatial relationships.
    • The proposed algorithm and pruning strategies offer an effective and efficient solution for spatial data mining.
    • This work provides a more robust method for understanding complex spatial interactions.