Training of SOM

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/MP-SET-COMPUTER-SCIENCE/unit-10-artificial-intelligence/artificial-intelligence-artificial-neural-networks/self-organizing-maps-som/asset-training-of-som after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper - 1 | Unit - 1 | Teaching Aptitude: Concept and Objectives of Teaching / शिक्षण की अवधारणा एवं उद्देश्य, Levels of Teaching / शिक्षण के स्तर, Learner's Characteristics / शिक्षार्थी की विशेषताएँ, Learning: Nature and Theories / अधिगम: प्रकृति एवं सिद्धांत, Cognition, Memory and Metacognition / संज्ञान, स्मृति एवं अधिसंज्ञान, Factors Affecting Teaching / शिक्षण को प्रभावित करने वाले कारक, Effective Teaching and the Teacher / प्रभावी शिक्षण एवं शिक्षक, Instructional Objectives and Lesson Planning / अनुदेशनात्मक उद्देश्य एवं पाठ नियोजन, Methods of Teaching / शिक्षण विधियाँ, Offline and Online Teaching Methods / ऑफ़लाइन एवं ऑनलाइन शिक्षण विधियाँ, Teaching Support System / शिक्षण सहायक प्रणाली, Evaluation Systems / मूल्यांकन प्रणाली
  2. Paper - 1 | Unit - 2 | Research Aptitude: Research: Meaning, Features and Scientific Method / अनुसंधान: अर्थ, लक्षण व वैज्ञानिक विधि, Research Paradigms and Approaches / अनुसंधान के प्रतिमान एवं उपागम, Types of Research / अनुसंधान के प्रकार, Variables and Measurement / चर एवं मापन, Methods of Research / अनुसंधान की विधियाँ, Steps of Research / अनुसंधान के चरण, Sampling / प्रतिचयन, Tools and Methods of Data Collection / आँकड़ा संग्रह के उपकरण एवं विधियाँ, Data Analysis and Statistics in Research / आँकड़ा विश्लेषण एवं शोध सांख्यिकी, Thesis and Article Writing / शोध-प्रबंध एवं लेख लेखन, Application of ICT in Research / अनुसंधान में ICT का अनुप्रयोग, Research Ethics / शोध नैतिकता
  3. Paper - 1 | Unit - 3 | Comprehension: Literal Comprehension, Vocabulary and Language in Context, Inferential Comprehension, Critical Comprehension, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions)
  4. Paper - 1 | Unit - 4 | Communication: Communication: Meaning, Nature and Process / संचार: अर्थ, प्रकृति एवं प्रक्रिया, Types and Levels of Communication / संचार के प्रकार एवं स्तर, Verbal and Non-verbal Communication / मौखिक एवं अमौखिक संचार, Semiotics and Meaning / संकेत विज्ञान एवं अर्थ, Models and Theories of Communication / संचार के मॉडल एवं सिद्धांत, Effective Communication / प्रभावी संचार, Barriers to Communication / संचार की बाधाएँ, Classroom Communication / कक्षा संचार, Mass Media: Types and Evolution / जनसंचार माध्यम: प्रकार एवं विकास, Mass Media and Society / जनसंचार एवं समाज, Digital and New Media / डिजिटल एवं नव माध्यम, General Awareness (Legacy Paper 1) / सामान्य जागरूकता (पुराना पेपर 1)
  5. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: Number System and Simplification / संख्या पद्धति एवं सरलीकरण, Algebra and Ages / बीजगणित एवं आयु, Percentage / प्रतिशतता, Ratio, Proportion, Partnership and Mixtures / अनुपात, समानुपात, साझेदारी एवं मिश्रण, Averages / औसत, Profit, Loss and Discount / लाभ, हानि एवं बट्टा, Simple and Compound Interest / साधारण एवं चक्रवृद्धि ब्याज, Time and Work / समय एवं कार्य, Speed, Time and Distance / चाल, समय एवं दूरी, Mensuration and Geometry / क्षेत्रमिति एवं ज्यामिति, Series / श्रेणी, Coding-Decoding / कूटलेखन-कूटवाचन, Relationships, Directions and Ranking / संबंध, दिशा एवं क्रम, Arrangements, Puzzles, Clock and Calendar / व्यवस्था, पहेलियाँ, घड़ी एवं कैलेंडर, Mathematical Foundations, Analysis
  6. Paper - 1 | Unit - 6 | Logical Reasoning: Structure of Arguments / युक्ति की संरचना, Terms, Definitions and Uses of Language / पद, परिभाषा एवं भाषा के उपयोग, Categorical Propositions / निरुपाधिक प्रतिज्ञप्तियाँ, Categorical Syllogism / निरुपाधिक न्यायवाक्य, Venn Diagrams / वेन आरेख, Deduction, Induction and Analogy / निगमन, आगमन एवं सादृश्यता, Fallacies / तर्कदोष, Indian Logic: Pramanas / भारतीय तर्कशास्त्र: प्रमाण, Anumana and Vyapti / अनुमान एवं व्याप्ति, Hetvabhasa / हेत्वाभास, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Aristotle / अरस्तू, Western Schools of Philosophy / पाश्चात्य दर्शन की विचारधाराएँ, Kant / कांट, Sadhana Paada / साधनपाद, Vaiśeṣika / वैशेषिक
  7. Paper - 1 | Unit - 7 | Data Interpretation: Data and Graphical Representation / आँकड़े एवं आलेखीय निरूपण, Data Interpretation: Tables / आँकड़ा निर्वचन: तालिका
  8. Paper - 1 | Unit - 8 | Information and Communication Technology: Computer Fundamentals and Hardware, Memory, Storage and Data Representation, Computer Software, Office Applications, Multimedia and File Formats, Computer Networks, Internet and World Wide Web, Email and Online Communication, Cyber Security, Digital Ethics, IPR and Society, Cloud and Distributed Computing, Emerging Technologies, ICT in Education and Governance, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services, Protection of Geographical Indications / भौगोलिक संकेतों का संरक्षण
  9. Paper - 1 | Unit - 9 | People Development and Environment: Ecosystems and Biodiversity / पारितंत्र और जैव विविधता, Human and Environment Interaction / मानव और पर्यावरण की अंतःक्रिया, Development and Environment / विकास और पर्यावरण, Natural Resources – Forests, Water and Soil / प्राकृतिक संसाधन: वन, जल और मृदा, Energy Resources / ऊर्जा संसाधन, Air Pollution / वायु प्रदूषण, Water Pollution and Treatment / जल प्रदूषण और उपचार, Noise Pollution / ध्वनि प्रदूषण, Waste Management / अपशिष्ट प्रबंधन, Environmental Health and Toxicology / पर्यावरणीय स्वास्थ्य और विषविज्ञान, Climate Change and Global Environmental Issues / जलवायु परिवर्तन और वैश्विक पर्यावरणीय समस्याएँ, Natural Hazards and Disaster Management / प्राकृतिक प्रकोप और आपदा प्रबंधन, Indian Environmental Laws and Policies / भारतीय पर्यावरण कानून और नीतियाँ, International Environmental Agreements / अंतर्राष्ट्रीय पर्यावरण समझौते, Environment / पर्यावरण, Geography / भूगोल, Factory and Industry Systems / कारखाना और उद्योग व्यवस्थाएँ, Earth Materials, Surface Features and Processes, Communicable Diseases and Immunization / संक्रामक रोग और प्रतिरक्षण
  10. Paper - 1 | Unit - 10 | Higher Education System: Education in Ancient India / प्राचीन भारत में शिक्षा, Ancient Centres of Higher Learning / प्राचीन भारत के उच्च शिक्षा केंद्र, Colonial Education Policies and Commissions / औपनिवेशिक काल की शिक्षा नीतियाँ और आयोग, Colonial Colleges, Universities and Reformers / औपनिवेशिक कॉलेज, विश्वविद्यालय व सुधारक, Education Commissions and Policies after Independence / स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ, National Education Policy 2020 / राष्ट्रीय शिक्षा नीति 2020, Types of Higher Education Institutions / उच्च शिक्षा संस्थानों के प्रकार, Learning Programmes and Academic Credits / अधिगम कार्यक्रम और अकादमिक क्रेडिट, Professional, Technical and Skill-Based Education / व्यावसायिक, तकनीकी और कौशल आधारित शिक्षा, Value Education and Environmental Education / मूल्य शिक्षा और पर्यावरण शिक्षा, Governance, Administration and Financing / शासन, प्रशासन और वित्तपोषण, Regulation, Accreditation and Ranking / उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग, Indian Polity and Governance (Legacy Unit 10) / भारतीय राजव्यवस्था और शासन (पुराना यूनिट 10)
  11. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization, Markov Chains
  12. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  13. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java
  14. Paper 2 | Unit 4 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Unit 7 | Data Structures and Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Paper 2 | Unit 8 | Theory of Computation and Compilers: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  19. Paper 2 | Unit 9 | Data Communication and Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cloud Computing, Mobile Computing
  20. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Full Notes: Paper 1 Full Notes
  22. Paper 1 | Full Mock Tests:
  23. Paper 2 | Full Mock Tests:
  24. Paper 1 | Previous Year Papers:
  25. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a detailed, step-by-step explanation of the training process for a Self-Organizing Map (SOM), focusing on the algorithmic mechanics of weight updates and cluster selection. It begins with an introduction to SOMs as a type of unsupervised learning technique developed by Teuvo Kohonen, emphasizing their use in creating topology-preserving maps through lateral inhibition and neighborhood constraints. The core of the lecture centers on calculating Euclidean distances between input vectors and cluster weight vectors to determine the winning neuron—i.e., the cluster with the closest weights. For each input vector, such as [0 1 1] or [0 0 1], the video demonstrates how to compute distances D1 and D2 for two clusters, compare them, and identify the winning cluster based on minimum distance. Once identified, a weight update rule is applied: w_ij(new) = w_ij(old) + η(x_i - w_ij(old)), where η is the learning rate. The update is applied not only to the winning cluster but also to its neighbors, although in this example, the neighborhood is limited to just the winning neuron (j = 1). The video includes multiple worked examples with specific numerical values, such as initial weights like W1,1 = 0.2 and input components like x1 = 0, to illustrate the iterative process. Each update step is shown in detail, with calculations for W1,1 = 0.2 + 0.5[0 - 0.2] = 0.1, and similar updates for other weights. The updated weight matrix is displayed after each iteration, showing progressive convergence toward optimal cluster representations. In addition to the SOM training process, the video briefly presents multiple-choice questions from UGC NET exams on related topics—such as arranging K-means steps and identifying classification algorithms—to contextualize the material within a test preparation framework. The visual content includes handwritten annotations in red ink, diagrams of SOM architecture with input and output units connected by weights, and on-screen text that reinforces key formulas and concepts. The teaching flow progresses from foundational definitions to concrete calculations, ensuring students understand both the theoretical underpinnings and practical implementation of SOMs.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video introduces the training process of a Self-Organizing Map (SOM), focusing on calculating Euclidean distances between input vectors and cluster weight vectors to determine the winning neuron. It presents an example with two clusters, where weights are initialized randomly and updated based on the nearest cluster. The process includes comparing distances to select the winning cluster and applying weight updates using a learning rate. On-screen text shows initialization of weights (Wij) randomly between 0 and 1, with an example input vector X = [0 1 1]. The Euclidean distance is calculated as D1 = (0.2-0)^2 + (0.4-0)^2 + (0.6-1)^2 + (0.8-1)^2 = 0.4 and D2 = (0.9-0)^2 + (0.7-0)^2 + (0.5-1)^2 + (0.3-1)^2 = 2.04, leading to the conclusion that D1 is the winning cluster since D1 < D2. The weight update rule is applied to the winning cluster, with on-screen text stating 'Apply weight updation on the winning cluster and neighborhood weights (we have j = 1)'.

  2. 2:00 – 5:00 02:00-05:00

    The video continues the SOM training demonstration, showing step-by-step calculations for a new input vector [0 0 1 1]. It reiterates the process of computing Euclidean distances D1 and D2, with values calculated as D1 = (0.2-0)^2 + (0.4-0)^2 + (0.6-1)^2 + (0.8-1)^2 = 0.4 and D2 = (0.9-0)^2 + (0.7-0)^2 + (0.5-1)^2 + (0.3-1)^2 = 2.04, again identifying D1 as the winning cluster due to its smaller value. The weight update formula is applied, with W1,1 = 0.2 + 0.5[0 - 0.2] = 0.1, and similar updates for other weights in the winning cluster. The instructor uses red handwritten annotations to highlight key steps, such as 'Since D1 < D2 thus D1 is the winning cluster' and 'Apply weight updation on the winning cluster', guiding focus to critical parts of the derivation. On-screen text reinforces these steps, including initialization of weights and application of the weight update rule.

  3. 5:00 – 10:00 05:00-10:00

    The video demonstrates the iterative weight update process in a Self-Organizing Map (SOM), focusing on updating weights for the winning cluster and its neighbors. It shows calculations using a learning rate and Euclidean distance to adjust weights, culminating in an updated weight matrix. The example includes initializing weights and computing distances for input vectors to determine the winning neuron. On-screen text displays the weight update formula Wij = Wij(0) + η(xi - Wij(0)), with specific values used in calculations such as W1,1 = 0.2 + 0.5[0 - 0.2] = 0.1, W2,1 = 0.4 + 0.5[0 - 0.4] = 0.2, W3,1 = 0.6 + 0.5[0 - 0.6] = 0.8, and W4,1 = 0.8 + 0.5[0 - 0.8] = 0.9, resulting in the updated weight matrix [0.1, 0.9]. The instructor uses red ink to emphasize formulas and calculations, with handwritten labels like 'Euclidean distance' and 'weight update' clarifying concepts. The video also presents a general weight update rule w_ij(new) = w_ij(old) + η(x_i - w_ij(old)) and introduces an example with four input vectors and two clusters to be formed.

  4. 10:00 – 12:56 10:00-12:56

    The video presents a question on arranging the steps for K-means clustering, followed by an explanation of Self-Organizing Maps (SOM). The instructor discusses the concept of lateral inhibition in neural networks and introduces SOM as a technique developed by Teuvo Kohonen, emphasizing its use of neighborhood constraints and topology-preserving maps. The visual content includes a diagram illustrating the SOM architecture with input units, output units, and connections between them. The instructor explains how neurons organize themselves through lateral inhibition and mentions the historical context of SOM's development by Teuvo Kohonen. The video also includes a multiple-choice question about classification algorithms, asking which among logistic regression, back propagation, and linear regression are classification algorithms. The correct answer is (a) A and C only, with options listed as (A) Logistic regression, (B) Back propagation, (C) Linear regression, and (D) Forward propagation. The question references a previous UGC NET paper, indicating it is part of a test preparation context.

The video systematically teaches the training mechanism of Self-Organizing Maps (SOMs), beginning with foundational concepts such as lateral inhibition and the historical development by Teuvo Kohonen, then progressing to detailed algorithmic steps. It emphasizes the core process of determining a winning neuron via Euclidean distance calculation and applying weight updates using a learning rate, with multiple worked examples illustrating the iterative refinement of cluster weights. The visual presentation supports this progression through on-screen equations, numerical examples, and red-ink annotations that highlight key transitions. The inclusion of UGC NET-style multiple-choice questions situates the material within an academic assessment context, reinforcing both conceptual understanding and practical application. The lecture effectively bridges theory and computation, using consistent examples to demonstrate how SOMs preserve topological structure through neighborhood-based learning. The absence of audio and transcript limits full contextual understanding, but the sampled screenshots provide sufficient evidence to reconstruct a coherent educational narrative focused on algorithmic implementation and conceptual grounding.

Loading lesson…