Hierarchical Clustering

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/current-trends-technologies/artificial-intelligence-artificial-neural-networks/unsupervised-learning-and-clustering/asset-hierarchical-clustering after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | 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 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces Hierarchical Clustering, defining it as a method that creates clusters with a predetermined ordering from top to bottom. It covers two main strategies: Agglomerative (bottom-up) and Divisive (top-down). The instructor explains the iterative merging process, the concept of a dendrogram, and provides a visual example using data points A-F to demonstrate how clusters form and merge. She notes that while agglomerative is common, divisive is rarely done in practice.

Chapters

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

    The lecture begins by defining Hierarchical Clustering as a method that creates clusters with a predetermined ordering from top to bottom. The instructor uses the analogy of files and folders on a hard disk to illustrate this hierarchy. She introduces two primary strategies: Agglomerative and Divisive. The focus initially falls on Agglomerative clustering, described on the slide as a 'bottom-up' approach. In this method, each observation begins in its own individual cluster. As the process moves up the hierarchy, pairs of clusters are merged. The instructor writes 'True' on the screen and sketches a simple tree diagram to visualize the structure, emphasizing that this approach builds complexity from individual data points upwards.

  2. 2:00 – 3:53 02:00-03:53

    The explanation shifts to the second strategy, Divisive clustering, defined on the slide as a 'top-down' approach. Here, all observations start in a single cluster, and splits are performed recursively as one moves down the hierarchy. The instructor outlines the iterative steps: identifying the two closest clusters and merging the two most similar ones until all are combined. The main output is identified as a dendrogram, which visualizes the hierarchical relationships. A concrete example is presented using data points labeled A through F. The instructor draws a diagram showing how points like A and B, or E and F, are grouped based on proximity. Finally, a slide on the Divisive Approach shows a tree structure splitting from a root node 'ABCDEF' down to individual leaves, contrasting it with the agglomerative method.

The lesson effectively contrasts the two main types of hierarchical clustering. Agglomerative clustering builds a hierarchy by merging smaller clusters into larger ones, starting from individual data points. Conversely, Divisive clustering breaks down a single large cluster into smaller sub-clusters. The instructor uses a visual example with points A-F to demonstrate the merging process, showing how proximity dictates cluster formation. The resulting structure is visualized using a dendrogram, a tree-like diagram that maps the relationships between clusters at different levels of granularity. This visual tool is crucial for understanding the nested nature of the data organization. The lecture concludes by briefly showing the reverse process of divisive clustering, reinforcing the concept of hierarchical organization in data science.

Loading lesson…