• DocumentCode
    2846374
  • Title

    An improved algorithm of Neural Networks with Cubic Spline Weight Function

  • Author

    Keyuan, Liu ; Haibin, Li ; Yan, He ; Zhixin, Duan

  • Author_Institution
    Sci. Coll., Inner Mongolia Univ. of Technol., Hohhot, China
  • fYear
    2010
  • fDate
    26-28 May 2010
  • Firstpage
    2673
  • Lastpage
    2677
  • Abstract
    The paper proposes an improved Neural Networks construction with Cubic Spline Weight Function and its algorithm for the characteristic of the poor extending ability of the Neural Networks with Cubic Spline Weight Function. The Weight Function is divided into two parts by the improved algorithm. The Weight Function is trained by the three Cubic Spline Weight Function of the original algorithm and the constant coefficient of the Weight Function is trained by the grad dropping method. Because the new algorithm combines the merits of the Cubic Spline Weight Function Neural Networks with the merits of the traditional Neural Networks, the problems of the traditional dropping algorithm, such as the local minimum, slow convergence rate and initial value sensitivity, are not existed and the extending ability is better. The results of the simulation shows that compared to the traditional algorithm, the algorithm has high precision, fast speed and the extending ability remarkably improved compared to the unimproved algorithm.
  • Keywords
    learning (artificial intelligence); neural nets; splines (mathematics); cubic spline weight function; grad dropping method; improved neural networks; Convergence; Educational institutions; Electronic mail; Feedforward neural networks; Helium; Neural networks; Neurons; Paper technology; Spline; Transfer functions; Extending Ability; Liner Neural Networks; Neural Networks with Cubic Spline Weight Function; Weight Function;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference (CCDC), 2010 Chinese
  • Conference_Location
    Xuzhou
  • Print_ISBN
    978-1-4244-5181-4
  • Electronic_ISBN
    978-1-4244-5182-1
  • Type

    conf

  • DOI
    10.1109/CCDC.2010.5498738
  • Filename
    5498738