• DocumentCode
    3472529
  • Title

    On the stationary state of topologically ordered competitive learning

  • Author

    Lemmon, Michael

  • Author_Institution
    Dept. of Electr. Eng., Notre Dame Univ., IN, USA
  • fYear
    1991
  • fDate
    11-13 Dec 1991
  • Firstpage
    871
  • Abstract
    The author proposes a competitive learning algorithm for learning nonparametric representations of unknown probability density functions. The proposed algorithm is shown to generate a reversible Markov chain whose invariant distribution is explicitly computed. The computed distribution is used to derive a nonparametric density estimate of unknown density functions. This fact allows the use of the algorithm´s representation in estimating the modes of the unknown density function
  • Keywords
    Markov processes; learning (artificial intelligence); neural nets; probability; invariant distribution; nonparametric density estimate; nonparametric representations; reversible Markov chain; stationary state; topologically ordered competitive learning; unknown probability density functions; Biological systems; Biology computing; Character generation; Density functional theory; Distributed computing; Lattices; Neurons; Probability density function; Prototypes; Stationary state;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1991., Proceedings of the 30th IEEE Conference on
  • Conference_Location
    Brighton
  • Print_ISBN
    0-7803-0450-0
  • Type

    conf

  • DOI
    10.1109/CDC.1991.261442
  • Filename
    261442