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 Experiment Videos

Nonparametric supervised learning by linear interpolation with maximum entropy.

Maya R Gupta1, Robert M Gray, Richard A Olshen

  • 1Department of Electrical Engineering, University of Washington, Seattle 98195, USA. gupta@ee.washington.edu

IEEE Transactions on Pattern Analysis and Machine Intelligence
|April 28, 2006
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

An update on recent developments in the drug treatment of tuberculous meningitis.

Expert opinion on pharmacotherapy·2026
Same author

Topological soliton frequency comb in nanophotonic lithium niobate.

Nature·2026
Same author

Two-optical-cycle pulses from nanophotonic two-color soliton compression.

Light, science & applications·2026
Same author

Mycobacterium tuberculosis overcomes phosphate starvation by extensively remodelling its lipidome with phosphorus-free lipids.

Nature communications·2025
Same author

An empirical Bayes approach for constructing confidence intervals for clonality and entropy.

Journal of applied statistics·2025
Same author

Enhanced sensitivity via non-Hermitian topology.

Light, science & applications·2024
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

Learning Shape Anchors for Holistic Indoor Scene Understanding.

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

This study introduces a learning algorithm using linear interpolation and maximum entropy (LIME) for estimating class probabilities. LIME shows practical value in classification tasks by effectively using near-neighbor data.

Area of Science:

  • Machine Learning
  • Statistical Modeling
  • Data Mining

Background:

  • Estimating class conditional probabilities is crucial for classification.
  • Nonparametric neighborhood methods offer a data-driven approach.
  • Existing methods may lack robustness or theoretical guarantees.

Purpose of the Study:

  • To propose and analyze a novel learning algorithm, LIME (Linear Interpolation and Maximum Entropy).
  • To investigate the theoretical properties and practical performance of the LIME algorithm.
  • To demonstrate the applicability of LIME in real-world classification problems.

Main Methods:

  • Utilizing nonparametric neighborhood methods based on relative frequencies of near-neighbors.
  • Implementing a learning algorithm combining linear interpolation and the principle of maximum entropy (LIME).

Related Experiment Videos

  • Analyzing theoretical properties including weight form, consistency, and robustness to noise.

    • Main Results:

    • LIME weights exhibit an exponential form, and estimates are consistent and robust to additive noise.
    • Asymptotic analysis shows near-neighbors contain the test point in their convex hull, aiding bias reduction.
    • The method demonstrated practical value on a pipeline integrity classification task.

    Conclusions:

    • The LIME algorithm provides a theoretically sound and practically valuable approach for class conditional probability estimation.
    • LIME's robustness and consistency make it a reliable tool for machine learning tasks.
    • The method's effectiveness is validated through simulations and a real-world application.