Kohonen Self Organizing Maps | Algorithm & Advanatges

Self Organizing Maps (SOM) technique was developed in 1982 by a professor, Tuevo Kohonen. Professor Kohonen worked on auto-associative memory during the 1970s and 1980s and in 1982 he presented his self-organizing map algorithm. SOMs are named as “Self-Organizing” because no supervision is required. Self-organizing maps learn on their own through unsupervised competitive learning. They […]

Continue Reading

Fuzzy T-norm and S-norm Operator

T-norm (Triangular norm) ——> Fuzzy Intersection T-norm operator: A∩B ↔ µA∩B (x) = T (µA(x), µB(x)) = µA(x) ∧ µB(x),     ∀ x ∈ X where ∧ is for T-norm operator (example, min. product) Definition of T-norm operator A T-norm operator denoted by T(a,b) is a function mapping [0,1]×[0,1] to [0,1] that satisfies the following conditions for any […]

Continue Reading

Genetic Algorithm | Advantages & Disadvantages

Genetic Algorithm (GA) Genetic Algorithms are the heuristic search and optimization techniques that mimic the process of natural evolution. A genetic algorithm is a local search technique used to find approximate solutions to Optimisation and search problems. It is an efficient, and effective techniques for both optimization and machine learning applications. It is widely-used today […]

Continue Reading

SoftComputing and HardComputing

SoftComputing It is a collection of methodologies, which aim to exploit tolerance for imprecision, uncertainty and partial truth to achieve tractability, robustness, and low solution cost. SoftComputing Main Components 1. Approximate Reasoning example: Probabilistic Reasoning, Fuzzy logic. 2. Search and Optimization example: Neural Network, Evolutionary algorithms. Problem Solving Technologies HardComputing SoftComputing Comparison between HardComputing and […]

Continue Reading