Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Search research articles

Related Experiment Videos

Neural tree density estimation for novelty detection.

¹Laboratoire d'Analyse et d'Architecture des Systèmes-CNRS, 31077 Toulouse, France.

IEEE Transactions on Neural Networks

|February 7, 2008

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

Ultra-fast single-crystal CVD diamonds in the particle time-of-flight (PTOF) detector for low yield burn-history measurements on the NIF (invited).

The Review of scientific instruments·2025

Same author

Barriers to early detection: Insurance denials for breast MRI screening in women with germline BRCA1/2 mutations.

Gynecologic oncology·2025

Same author

Distribution and Characteristics of Congenital Cardiac Surgery Centers within Bangladesh.

Mymensingh medical journal : MMJ·2024

Same author

Achievement of Target Gain Larger than Unity in an Inertial Fusion Experiment.

Physical review letters·2024

Same author

Lawson Criterion for Ignition Exceeded in an Inertial Fusion Experiment.

Physical review letters·2022

Same author

The fasted and post-prandial physiological responses of the Patagonian blennie Eleginops maclovinus.

Comparative biochemistry and physiology. Part A, Molecular & integrative physiology·2022

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

A novel neural competitive learning tree offers fast and adaptive density estimation and novelty detection. This computational scheme efficiently quantizes input spaces and tracks changing data distributions.

Area of Science:

Artificial Intelligence
Machine Learning
Computational Statistics

Background:

Adaptive density estimation and novelty detection are crucial for analyzing complex datasets.
Existing competitive learning algorithms can be computationally intensive and slow to adapt.

Purpose of the Study:

Introduce a neural competitive learning tree for efficient adaptive density estimation.
Develop a computationally attractive scheme for novelty detection.
Improve the speed and adaptability of competitive learning algorithms.

Main Methods:

A neural competitive learning tree architecture is proposed.
The learning rule enables equiprobable quantization of the input space.
An adaptive focusing mechanism is incorporated to track time-varying distributions.

Related Experiment Videos

Main Results:

The neural tree demonstrates effective adaptive density estimation.
The proposed method shows strong performance in novelty detection.
Simulations confirm the neural tree is significantly faster than other competitive learning algorithms.

Conclusions:

The neural competitive learning tree is a computationally efficient and effective tool.
This approach offers advantages in speed and adaptability for dynamic data analysis.
The method shows promise for real-time applications requiring density estimation and novelty detection.