Soft Computing Notes
₹200.00

SOFT COMPUTING NOTES
Soft Computing
Click Below to Download the Sample Notes
Download
Soft Computing is the semester 8 subject of IT engineering offered by Mumbai Universities. Prerequisite for these subject are NIL, Probability and Statistics, C++/Java. Programming. Course Objective for the subject Soft Computing are as follows Students will try to familiarize with soft computing concepts.
To introduce the fuzzy logic concepts, fuzzy principles and relations. To Basics of ANN and Learning Algorithms. Ann as function approximation. Genetic Algorithm and its applications to soft computing. Hybrid system usage, application and optimization. Course Outcomes for the subject Soft Computing are as follows Students will be able to List the facts and outline the different process carried out in fuzzy logic, ANN and Genetic Algorithms. Explain the concepts and metacognitive of soft computing. Apply Soft computing techniques the solve character recognition, pattern classification, regression and similar problems. Outline facts to identify process/procedures to handle real world problems using soft computing. Evaluate various techniques of soft computing to defend the best working solutions. Design hybrid system to revise the principles of soft computing in various applications.
Module Fuzzy Set Theory consists of the following subtopic as follows Fuzzy Sets: Basic definition and terminology, Basic concepts of fuzzy sets, Fuzzy set operations, Fuzzy relations: Cardinality of fuzzy relations, operations on fuzzy relations, properties of fuzzy relations, Fuzzy composition Fuzzification and Defuzzification: Features of the membership Functions, Fuzzification, LambdaCuts for Fuzzy Sets, LambdaCuts for Fuzzy Relations, Defuzzification methods.
Module Fuzzy Rules, Reasoning, and Inference System consists of the following subtopic as follows Fuzzy Rules: Fuzzy IfThen Rules, Fuzzy Reasoning Fuzzy Inference System ( FIS): Mamdani FIS, Sugeno FIS, Comparison between , Mamdani and Sugeno FIS.
Module Neural NetworkI consists of the following subtopic as follows Introduction: What is a Neural network? Fundamental Concepts, Basic Models of Artificial Neural Networks, Arificial Intelligence and Neural Networks, McCullochPitts Neuron Learning: ErrorCorrection Learning, Memory based Learning, Hebbian learning, Competitive Learning, Boltzmann Learning Perceprton: Perceprton Learning Rule, Perceptron Learning Algorithm, Perceprton Convergence Theorem, Perceptron learning and Nonseparable sets.
Module Neural Networks –II consists of the following subtopic as follows Back propaggation: Multilayered Network Architecture, Back porpagation Algorithm, Practical Consideration in impin Implementing the Back propagation Algorithm. Back propagation and XOR problem. Adaptive resonance Theory: NoiseSaturation Dilemma, Solving the NoiseSaturation Dilemma, Recurrent OncenterOffsurround Networks, Building blocks of Adaptive Resonance, Substrate of resonance, Structural details of the resonance Model, Adaptive Resonance Theory I (ART I), Neurophysiological Evidence for ART Mechanism Character Recognition: Introduction, General Algorithm Architecture for Character Recognition: Binarization, Preprocessing, Filters, Smoothing, Skew Detection and Correction, Slant Correction, Character Normalization, Thinning, Segmentation, Multilingual OCR by RuleBased Approach and ANN. RuleBased Approach: Classification, Tests, Rules Artificial Neural Network: Inputs, Outputs, Identification Results of Multilingual OCR.
Module Genetic Algorithm consists of the following subtopic as follows An Introduction to genetic Algorithms: What Are Genetic Algorithms? Robustness of Traditional Optimization and Search Methods, The Goals of Optimization, How Are Genetic Algorithms Different from Traditional Methods?, A Simple Genetic Algorithm Genetic Algorithms at Work—a Simulation by hand, Grist for the Search Mill—Important Similarities, Similarity Templates (Schemata), Learning the Lingo. Genetic Algorithms: Mathematical Foundations Who Shall Live and Who Shall Die? The Fundamental Theorem, Schema Processing at Work: An Example by Hand Revisited, The Twoarmed and йarmed Bandit Problem, How Many Schemata Are Processed Usefully? The Building Block Hypothesis, Another Perspective: The Minimal Deceptive Problem, Schemata Revisited: Similarity Templates as Hyperplanes, Implementation of a Genetic Algorithm: Data Structures, Reproduction, Crossover, and Mutation, A Time to Reproduce, a Time to Cross, Get with the Main Program, How Well Does it Work? Mapping Objective Functions to Fitness Form, Fitness Scaling, Codings, A Multiparameter, Mapped, FixedPoint Coding, Discretization, Constraints. Algorithm for Handwriting Recognition Using GA Generation of Graph, Fitness Function of GA: Deviation between Two Edges, Deviation of a Graph, Crossover: Matching of Points, Generate Adjacency Matrix, Find Paths, Removing and Adding Edges, Generation of Graph Results of Handwriting Recognition: Effect of Genetic Algorithms, Distance Optimization, Style Optimization.
Module Hybrid Computing consists of the following subtopic as follows Introduction, NeuroFuzzy Hybrid Systems, Adaptive NeuroFuzzy Inference System (ANIFS): Introduction, ANFS Architecture, Hybrid Learning Algorithm, ANFIS as a Universal Approximator, Simulation Examples: Twoinput Sinc Function and Three Input Nonlinear Function Genetic NeuroHybrid Systems: Properties of Genetic NeuroHybrid Systems, genetic Algorithm based Backpropagation Network, Advantages of NeuroGenetic Hybrids, Genetic Fuzzy Hybrid and Fuzzy Genetic Hybrid Systems Genetic Fuzzy Rule based Systems, Advantages of Genetic Fuzzy Hybrids.
Suggested Text Books for these subject Soft Computing by Mumbai University are as follows S.N. Sivanandan and S.N. Deepa, Principles of Soft Computing, Wiley India, 2007, ISBN: 10: 81 26510757. J.S. R. Jang, C. T. Sun, E. Mizutani, NeuroFuzzy and Soft Computing, A Computational Approach to Learning and Machine Intelligence, PHI Learning Private Limited2014. Neural Networks: A Classroom Approach, Satish Kumar, Tata McGrawHill Education, 2004/2007. Simon Haykin, Neural Networks A Comprehensive Foundation, Second Edition, Pearson Education2004. David E. Goldberg, Genetic Algorithms, in search, optimization and Machine Learning, Pearson.
Suggested Reference Books for these subject Soft Computing by Mumbai University are as follows Anupam Shukla, Ritu Tiwari, Rahul Kala, Real Life Applications of Soft Computing, CRC Press, Taylor & Francis Group, 2010.Genetic Algorithms and Genetic Programming Modern Concepts and Practical Applications 2009 Michael Affenzeller, Stephan Winkler, Stefan Wagner, and Andreas Beham, CRC Press Laurene V. Fausett, Fundamentals of Neural Networks: Architectures, Algorithms and Applications, Pearson.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placementpreparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
Course Features
 Lectures 4
 Quizzes 0
 Skill level All levels
 Language English
 Students 9
 Certificate No
 Assessments Yes