Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/10261/2702
Full metadata record
DC FieldValueLanguage
dc.creatorPascual-Marqui, Roberto D.-
dc.creatorPascual-Montano, Alberto-
dc.creatorKochi, Kieko-
dc.creatorCarazo, José M.-
dc.date2008-01-18T08:36:32Z-
dc.date2008-01-18T08:36:32Z-
dc.date2007-08-22-
dc.date.accessioned2017-01-31T00:59:43Z-
dc.date.available2017-01-31T00:59:43Z-
dc.identifierEuropean Patent Code: EP 1353295 B1-
dc.identifierhttp://hdl.handle.net/10261/2702-
dc.identifier.urihttp://dspace.mediu.edu.my:8181/xmlui/handle/10261/2702-
dc.descriptionFiling Date: 2000-12-12.-- International Publication Number WO_2002048962 (20020620)-
dc.descriptionThis is a system for organizing n-dimensional data onto a lower dimensionality space in a non-linear and non-supervised manner. The types of methods presented here are usually known as self-organizing maps and are similar but not identical to the well known Kohonen self-organizing maps. The basic idea is a combination of data clustering and smooth projection thereof into a lower dimensional space (usually a two-dimensional grid). The proposed system consists of two modified versions of the functional of the well-known Fuzzy c-means clustering algorithm, where the cluster centers or code vectors are distributed on a low dimensional regular grid, for which a penalization term is added with the object of assuring a smooth distribution of the values of the code vectors on said grid. In one of the two cases, the faithfulness to the data is achieved by minimizing the differences between the data and the code vectors, and in the other case, the new functional is based on the probability density estimation of the input data.-
dc.format809021 bytes-
dc.formatapplication/pdf-
dc.languageeng-
dc.rightsopenAccess-
dc.titleNon-linear data mapping and dimensionality reduction system-
dc.typeArtículo-
Appears in Collections:Digital Csic

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.