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

Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
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

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...
Ranks01:02

Ranks

Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...

You might also read

Related Articles

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

Sort by
Same author

First Report of Anthracnose Caused by Colletotrichum lupini on Yellow Lupin in Korea.

Plant disease·2019
Same author

First Report of Powdery Mildew Caused by Podosphaera xanthii on Verbena brasiliensis in Korea.

Plant disease·2019
Same author

First Report of Black Stem Caused by Botryosporium longibrachiatum on Statice in Korea.

Plant disease·2019
Same author

First Report of Leaf Spot Caused by Cercospora fukushiana on New Guinea Impatiens in Korea.

Plant disease·2019
Same author

First Report of Choanephora Rot Caused by Choanephora cucurbitarum on Hosta plantaginea in Korea.

Plant disease·2019
Same author

Coculture With Ischemia/Reperfusion-Preconditioned Hepatocytes Improves Islet Function and Survival.

Transplantation proceedings·2018
Same journal

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Mixture of Global and Local Experts with Diffusion Transformer for Controllable Face Generation.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

Related Experiment Video

Updated: May 29, 2026

Computer Vision-Based Biomass Estimation for Invasive Plants
08:47

Computer Vision-Based Biomass Estimation for Invasive Plants

Published on: February 9, 2024

A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition.

B S Kim1, S B Park

  • 1Department of Medical Information Management, College of Medicine, Hanyang University, 17 Haengdangdong, Seong-dong-ku, Seoul 133, Korea.

IEEE Transactions on Pattern Analysis and Machine Intelligence
|August 27, 2011
PubMed
Summary
This summary is machine-generated.

We introduce a fast nearest neighbor search algorithm called ordered partition. This method efficiently finds neighbors by ordering and partitioning data, achieving constant expected time complexity for k-nearest neighbors.

Related Experiment Videos

Last Updated: May 29, 2026

Computer Vision-Based Biomass Estimation for Invasive Plants
08:47

Computer Vision-Based Biomass Estimation for Invasive Plants

Published on: February 9, 2024

Area of Science:

  • Computer Science
  • Machine Learning
  • Data Mining

Background:

  • Nearest neighbor search is fundamental in machine learning and data mining.
  • Existing algorithms can be computationally expensive, especially with large datasets.

Purpose of the Study:

  • To propose a novel, fast algorithm for nearest neighbor finding.
  • To achieve constant expected time complexity for k-nearest neighbor search.

Main Methods:

  • The proposed algorithm, 'ordered partition', utilizes ordered lists of training samples for each projection axis.
  • It employs ordering to bound the search region and partitioning to efficiently reject samples without distance computation.

Main Results:

  • The ordered partition algorithm is proven to find k nearest neighbors in constant expected time.
  • Simulations demonstrate the algorithm is distribution-free.
  • On average, only 4.6 distance calculations were needed to find a nearest neighbor among 10,000 samples from a bivariate normal distribution.

Conclusions:

  • The ordered partition algorithm offers a significant speedup for nearest neighbor searches.
  • Its distribution-free nature and efficiency make it broadly applicable in various data mining tasks.