By Topic

A convex hull algorithm for neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wennmyr, E. ; Univ. of Southern California, Los Angeles, CA, USA

A convex hull algorithm for neural networks is presented. It is applicable in both two and three dimensions and has a time complexity of O(N) for the offline case, O(log N) for the online case in two dimensions, and O(hN), O(N), respectively, for three dimensions (h is the number of faces in the convex hull). The constant bounding the complexity is expected to be very small

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:36 ,  Issue: 11 )