Advanced · Data
Cobweb
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. An incremental algorithm for hierarchical conceptual clustering that organizes data into a classification tree based on attribute distributions.
Technical Definition
An incremental algorithm for hierarchical conceptual clustering that organizes data into a classification tree based on attribute distributions.
How it works
Cobweb is an incremental algorithm for hierarchical conceptual clustering. It builds a classification tree where each node represents a concept (class) defined by the probability distribution of its attributes. As new data arrives, Cobweb updates the tree structure to incorporate the observations, allowing for predictions and classification.
Related Concepts
- Clustering — An unsupervised technique that groups similar data points without using labels.
- Incremental learning — A machine learning approach where a model continuously learns from new data without forgetting previous knowledge.