메뉴 건너뛰기




Volumn 4, Issue , 2002, Pages 342-347

A new feedforward neural network pruning algorithm: SSM-Iterative pruning (SSMIP)

Author keywords

Feedforward neural networks; Iterative pruning methods (IP); Network pruning; Pattern recognition; Statistical Stepwise Method (SSM)

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ITERATIVE METHODS; PATTERN RECOGNITION; STATISTICAL METHODS;

EID: 0036971652     PISSN: 08843627     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (11)
  • 2
    • 0031142667 scopus 로고    scopus 로고
    • An iterative pruning algorithm for feed-forward neural networks
    • May
    • G. Castellano, and A. M. Fanelli, "An Iterative Pruning Algorithm for Feed-forward Neural Networks" IEEE Transactions on Neural Networks, Vol.8, No 3, May 1997.
    • (1997) IEEE Transactions on Neural Networks , vol.8 , Issue.3
    • Castellano, G.1    Fanelli, A.M.2
  • 4
    • 0035505658 scopus 로고    scopus 로고
    • A new pruning heuristic based on variance analysis of sensitivity information
    • Nov.
    • A.P. Engelbrecht, "A new pruning heuristic based on variance analysis of sensitivity information", IEEE Transactions on, Neural Networks, Volume: 12 No. 6, Nov. 2001 Pp: 1386-1399.
    • (2001) IEEE Transactions on, Neural Networks , vol.12 , Issue.6 , pp. 1386-1399
    • Engelbrecht, A.P.1
  • 5
    • 0035273020 scopus 로고    scopus 로고
    • A fast feed-forward training algorithm using a modified form of standard back-propagation algorithm
    • March
    • S. Abid, F. Fnaiech and M. Najim," A Fast Feed-Forward Training Algorithm Using A Modified Form of Standard Back-Propagation Algorithm" IEEE Transactions on Neural Network, pp. 424-430, March 2001.
    • (2001) IEEE Transactions on Neural Network , pp. 424-430
    • Abid, S.1    Fnaiech, F.2    Najim, M.3
  • 7
    • 0003194588 scopus 로고    scopus 로고
    • Feedforward neural network design with tridiagonal symmetry constraints
    • May
    • A. Dumitras, and F. Kossentini "Feedforward Neural Network Design with Tridiagonal Symmetry Constraints" IEEE Transactions on signal Processing, Vol. 48, No. 5, May 2000.
    • (2000) IEEE Transactions on Signal Processing , vol.48 , Issue.5
    • Dumitras, A.1    Kossentini, F.2
  • 8
    • 0035019899 scopus 로고    scopus 로고
    • A Prune: An algorithm for finding K shortest paths subject to multiple constraints
    • G. Liu, and K. G.Ramakrishnan "A Prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints" IEEE INFOCOM 2001.
    • (2001) IEEE INFOCOM 2001
    • Liu, G.1    Ramakrishnan, K.G.2
  • 11
    • 0027662338 scopus 로고
    • Pruning algorimms - A survey
    • Sept.
    • R. Reed, "Pruning algorimms-a survey "IEEE Transactions on Neural Networks, Volume: 4 Issue: 5, Sept. 1993 Pp: 740-747.
    • (1993) IEEE Transactions on Neural Networks , vol.4 , Issue.5 , pp. 740-747
    • Reed, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.