By Topic

Clustering noisy data by a principal feature extraction unsupervised neural network

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

2 Author(s)
Vacca, F. ; Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari, Italy ; Chiarantoni, E.

Principal feature classification is based on a sequential procedure for finding the principal features from an assigned data set. This paper presents an unsupervised neural network which is able to find principal features, based on neural units sensitive to density of the data space. These units adopt a modified competitive learning law, which utilizes only local information to specialize toward a single cluster. It is shown that the network presented is able to automatically select the number of units as in the rival penalized competitive network, and also to correctly detect features when the number of clusters exceed the number of units. Simulations on IRIS data set are provided and it is shown that the proposed network presents property of robust noise rejection and is suitable for features extraction in noise data sets

Published in:

Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Joint Conference on  (Volume:3 )

Date of Conference:

4-9 May 1998