Location of Repository

A Pareto Self-Organizing Map

By Andrew Hunter and Richard Lee Kennedy


Abstract. Self Organizing Features Maps are used for a variety of tasks in visualization and clustering, acting to transform data from a highdimensional original feature space to a (usually) two-dimensional grid.\ud SOFMs use a similarity metric in the input space, and this composes individual feature differences in a way that is not always desirable. This paper introduces the concept of a Pareto SOFM, which partitions features into groups, defines separate metrics in each partition, and retrieves\ud a set of prototypes that trade off matches in different partitions. It is suitable for a wide range of exploratory tasks, including visualization and clustering. . .

Topics: G730 Neural Computing
Year: 2002
OAI identifier: oai:eprints.lincoln.ac.uk:1893
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.lincoln.ac.uk/1... (external link)
  • http://www.ii.uam.es/icann2002... (external link)
  • http://eprints.lincoln.ac.uk/1... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.