• DocumentCode
    3099866
  • Title

    A New Improved Maxnet Based on a Hybrid Neural Network That Does Not Need to be Trained

  • Author

    da Fonseca, José Barahona

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., New Univ. of Lisbon, Monte de Caparica
  • fYear
    2006
  • fDate
    Nov. 28 2006-Dec. 1 2006
  • Firstpage
    138
  • Lastpage
    138
  • Abstract
    The maximum of a set is the element that is greater or equal to all the remaining ones. This seams obvious but it is this idea that is behind our Maxnet based on an hybrid neural network with multiplication units. Although this approach does not need training it implies N hard limit perceptrons, N analog switches units and one linear neuron for a set of N elements. In a first approach we consider the simpler case where we only want to get the order of the input variable(s) that is/are the maximum(s), in a second approach we consider the case where we want to get the value(s) of the maximum(s), in a third approach we solve the same problem but with only one output introducing mutual inhibitio and finally we solve the same problem without mutual inhibition and introducing a division unit to divide the sum of all maximums by the number of maximums. Finally we compare our Maxnet with the recent published proposals and we show the great advantages of our approach either for software implementation or hardware realization.
  • Keywords
    neural nets; set theory; N hard limit perceptrons; hardware realization; hybrid neural network; improved Maxnet; software implementation; Acceleration; Computational intelligence; Convergence; Decision making; Hardware; Neural networks; Neurons; Pattern recognition; Proposals; Switches;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence for Modelling, Control and Automation, 2006 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on
  • Conference_Location
    Sydney, NSW
  • Print_ISBN
    0-7695-2731-0
  • Type

    conf

  • DOI
    10.1109/CIMCA.2006.20
  • Filename
    4052768