Hierarchical Clustering

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-13-artificial-intelligence/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 the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…