Ca 3 SC
Ca 3 SC
Soft computing is a branch of artificial intelligence that deals with approximate solutions to complex real-world problems
where traditional (hard) computing methods may fail. It is designed to handle imprecision, uncertainty, and
approximation rather than relying on exact, binary (0 or 1) logic.
Example Neural networks, genetic algorithms, fuzzy Traditional programming, mathematical models,
Techniques logic algorithms
Example
An Expert System is an AI-based software that mimics human experts in decision-making for specific domains. It uses
knowledge and inference rules to solve complex problems that typically require human expertise. Expert systems are a
key application of soft computing, as they deal with uncertainty and imprecision.
• Example:
o Rule: If a patient has a fever and sore throat, THEN it may be a viral infection.
• Example:
• Example:
Characteristics of ANN
1. Parallel Processing
o Processes multiple computations simultaneously, making it efficient for large-scale problems.
4. Generalization
o After training, ANNs can generalize and predict outputs for unseen data.
5. Distributed Memory
o Knowledge is stored across the entire network, preventing loss of information from a single
failure.
6. Non-linearity
o Can model complex, non-linear relationships that traditional algorithms struggle with.
Comparison Between Biological Neural Network (BNN) & Artificial Neural Network (ANN)
Processing
Slow (measured in milliseconds) Fast (measured in nanoseconds)
Speed
Interconnection Highly dense and complex connections Structured layers (input, hidden, output)
Energy Efficiency Very low power consumption High power consumption (requires GPUs/TPUs)
Concept:
• The model learns from labeled data (i.e., each input has a known correct output).
• The goal is to find a function that maps inputs to outputs.
Examples:
Common Algorithms:
• Linear Regression
• Decision Trees
• Neural Networks (MLP, CNN)
2. Unsupervised Learning
Concept:
• The model learns patterns from unlabeled data without explicit instructions.
• It finds hidden structures like clusters or associations in data.
Examples:
• Customer segmentation (grouping users based on behavior).
• Anomaly detection (e.g., fraud detection in banking).
Common Algorithms:
• K-Means Clustering
• Principal Component Analysis (PCA)
• Autoencoders
Concept:
• The model (agent) learns by interacting with the environment and receiving rewards or penalties for
its actions.
• Used for decision-making and sequential tasks.
Examples:
• Game playing (e.g., AlphaGo, Chess AI).
• Self-driving cars .
Common Algorithms:
• Q-Learning
• Deep Q-Networks (DQN)
• Policy Gradient Methods
4. Semi-Supervised Learning
Concept:
• A mix of supervised and unsupervised learning.
• Uses a small amount of labeled data and a large amount of unlabeled data to train the model.
Examples:
• Google Photos (labels only a few images and learns from the rest).
• Medical diagnosis (few labeled patient records, many unlabeled).
Common Algorithms:
• Self-training
• Graph-based models