Course Details

Subject {L-T-P / C} : EE6243 : Soft Computing Techniques { 3-0-0 / 3}

Subject Nature : Theory

Coordinator : Ananyo Sengupta

Syllabus

Module 1: Optimization Techniques (12 Hours)
- Preliminary Mathematics: Matrix Calculus, Taylor Series Expansion, Convex Set and Convex Function
- Convex Optimization:
- Unconstrained Optimization by Steepest Descent Method
- Newton’s Method and LMDN Method
- Conjugate Gradient Method
- Constrained Optimization
- Nonconvex Optimization:
- Genetic Algorithm (GA)
- Particle Swarm Optimization (PSO)

-

Module 2: Introduction to Machine Learning (22 Hours)
- Regression:
- Linear and Polynomial Regression
- Classification by Logistic Regression
- Artificial Neural Network:
- Supervised Learning:
- Input-Output Mapping and Classification by Adaptive Linear Model
- Multi-Layer Perceptron: Back-Propagation Learning
- Radial Basis Function Neural Network
- Unsupervised Learning:
- Clustering by Self-Organizing Maps
- Support Vector Machine

-

Module 3: Principal Component Analysis (PCA) (4 Hours)
- Dimension Reduction by PCA

Course Objectives

Course Outcomes

At the end of the course, students will be able to

CO1: Analyze different types of optimization problems and apply appropriate optimization techniques to solve them.

CO2: Implement single and multi-layer perceptrons for input-output mapping and classification problems.

CO3: Apply clustering techniques to categorize datasets based on patterns and relationships.

CO4: Utilize Principal Component Analysis (PCA) for dimensionality reduction in large-scale data processing.

CO5: Develop and evaluate machine learning models for real-world industrial applications.

Essential Reading

Supplementary Reading