A) Explain the Properties of Fuzzy set. B) Interval analysis in arithmetic c) Intuition and inference methods for fuzzification. C) Discuss various approximate methods of extension. D) State and prove the Schema Theorem in Genetic Algorithm with an example.
A) Explain the Properties of Fuzzy set. B) Interval analysis in arithmetic c) Intuition and inference methods for fuzzification. C) Discuss various approximate methods of extension. D) State and prove the Schema Theorem in Genetic Algorithm with an example.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
A) Explain the Properties of Fuzzy set. B) Interval analysis in arithmetic c) Intuition and inference methods for fuzzification. C) Discuss various approximate methods of extension. D) State and prove the Schema Theorem in Genetic Algorithm with an example.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
b) Interval analysis in arithmetic (5) c) Intuition and inference methods for fuzzification. (5) [OR] 22. Discuss various approximate methods of extension.
23. a) Explain feed forward and adaptive networks (6)
b) Explain the Back Propagation Network Algorithm. (9) [OR] 24. a) Explain about Data compression application using BPN. (10) b) Explain about supervised and unsupervised learning. (5)
25. Explain about CPN Architecture and Data Processing.
[OR] 26. Construct and test a BAM network to associate letters E and F with simple bipolar input-output vectors. The target output for E is (-1 , 1 ) and for F is (1, 1). The display matrix size is 5 x 3. Input E =[1 1 1 1 –1 –1 1 1 1 1 –1 –1 1 1 1]; F=[1 1 1 1 1 1 1 -1 -1 1 –1 –1 1 -1 -1];
27. State and prove the Schema Theorem in Genetic Algorithm.
[OR] 28. a) Explain the Selection, Crossover & Mutation operation in simple Genetic algorithm with an example. (10) b) Explain about the mapping objective function to fitness form. (5)