• DocumentCode
    276551
  • Title

    Self-organization of non-numeric data sets

  • Author

    Bradburn, David S.

  • Author_Institution
    TRW Financial Syst., Berkeley, CA, USA
  • Volume
    i
  • fYear
    1991
  • fDate
    8-14 Jul 1991
  • Firstpage
    37
  • Abstract
    A topology-preserving map can be constructed by simulated annealing. This map shares some useful properties with those generated by classical self-organization, but it does not require that the input data have numeric values. An application to mail routing is presented, showing that self-organization can be accomplished given only a local adjacency list. A string-matching application shows the extension of the algorithm to cases where a scalar distance between input points is available. The map in the latter application, like a Kohonen map, exhibits local smoothness permitting shortcuts to the nearest-neighbor search
  • Keywords
    mailing systems; neural nets; search problems; self-adjusting systems; simulated annealing; topology; local adjacency list; local smoothness; mail routing; nearest-neighbor search; nonnumeric data sets; scalar distance; self-organization; simulated annealing; string-matching application; topology-preserving map; Automation; Cost function; Databases; Interpolation; NP-hard problem; Nearest neighbor searches; Network topology; Postal services; Routing; Simulated annealing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    0-7803-0164-1
  • Type

    conf

  • DOI
    10.1109/IJCNN.1991.155145
  • Filename
    155145