Input selection using binary particle swarm optimization

CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...

Volumn , Issue , 2006, Pages 159-

  Amonchanchaigul, Thavit ^a   Kreesuradej, Worapoj ^a  

^a KING MONGKUT'S INSTITUTE OF TECHNOLOGY LADKRABANG   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; COMPUTATIONAL COMPLEXITY; NEURAL NETWORKS; SET THEORY;

BINARY PARTICLE SWARM OPTIMIZATION; MODELING COMPLEX RELATIONSHIPS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 38849136039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIMCA.2006.127     Document Type: Conference Paper

References (5)

1. J. M. Zurada, M. Aleksander and C. Ian, "Sensitivity Analysis for Minimization of Input Data Dimension for Feedforward Neural Network," IEEE Symposium on Circuits and Systems, pages 447-450, 1994.
2. J. Kennedy and R. Eberhart, "Particle Sarm Optimization," Proc. IEEE int'l confi on Neural Networks, pp. 1942-1948, 1995.
3. R. Reed, "Pruning Algorithms-A Survey," IEEE Transactions on Neural Networks, Vol. 4, pp. 740-747, Sep 1993.
4. P. E. Andries, "A New Pruning Heuristic Based on Variance Analysis of Sensitivity Information," IEEE Transactions on Neural Networks, Vol. 12, No. 6, pp. 1386-1399, Nov 2001.
5. R. Battiti, "Using Mutual Information for Selecting Features in Supervised Neural Net Learning," IEEE Transactions on Neural Networks, Vol. 5, No. 4, pp. 537-550, July 1994.