Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Hyperborders in the Voronoi-Diabram-Based Neural Net for Pattern Classification

Published

Author(s)

Camillo A. Gentile, M Sznaier

Abstract

We propose a neural network to answer a point query in Rn partitioned based on the Voronoi diagram. Our novel design offers the potential to reduce both the number of neurons and connection weights of previous designs, employing a cost function which enables a tradeoff between the two to suit a specific implementation. Our simplified structure requires neither delay weights nor complex neurons, while retaining the main advantage of previous designs to furnish precise values for the neurons and connection weights, as opposed to trial and error iterations or ad-hoc parameters.
Citation
International Joint Conference on Neural Networks

Keywords

Neural networks, Pattern classification, Voronoi diagrams

Citation

Gentile, C. and Sznaier, M. (2002), Hyperborders in the Voronoi-Diabram-Based Neural Net for Pattern Classification, International Joint Conference on Neural Networks, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151100 (Accessed October 15, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created May 20, 2002, Updated February 19, 2017
Was this page helpful?