arXiv · 1512.04509
On non-iterative training of a neural classifier
Abstract
Recently an algorithm, was discovered, which separates points in n-dimension by planes in such a manner that no two points are left un-separated by at least one plane{[}1-3{]}. By using this new algorithm we show that there are two ways of classification by a neural network, for a large dimension feature space, both of which are non-iterative and deterministic. To demonstrate the power of both these methods we apply them exhaustively to the classical pattern recognition problem: The Fisher-Anderson's, IRIS flower data set and present the results. It is expected these methods will now be widely used for the training of neural networks for Deep Learning not only because of their non-iterative and deterministic nature but also because of their efficiency and speed and will supersede other classification methods which are iterative in nature and rely on error minimization.
Explore related subjects
Keep this discovery
K. Eswaran, K. Damodhar Rao. 2015-12-20. On non-iterative training of a neural classifier. https://arxiv.org/abs/1512.04509
Cite the original work for its findings. Save a collection to share your selection of sources.