In today's article we are going to delve into Cobweb (clustering), a topic of great relevance today. Cobweb (clustering) is an aspect that has gained importance in various areas, from politics to popular culture. Over the years, Cobweb (clustering) has been the subject of debate and analysis, and in this article we will explore its different facets and its impact on society. Throughout history, Cobweb (clustering) has played a fundamental role in shaping the world we know today, and that is why it is crucial to understand its influence in different contexts. Additionally, we will examine how Cobweb (clustering) has evolved over time and continues to generate interest today. Get ready to immerse yourself in the fascinating world of Cobweb (clustering)!
COBWEB is an incremental system for hierarchical conceptual clustering. COBWEB was invented by Professor Douglas H. Fisher, currently at Vanderbilt University.
COBWEB incrementally organizes observations into a classification tree. Each node in a classification tree represents a class (concept) and is labeled by a probabilistic concept that summarizes the attribute-value distributions of objects classified under the node. This classification tree can be used to predict missing attributes or the class of a new object.
There are four basic operations COBWEB employs in building the classification tree. Which operation is selected depends on the category utility of the classification achieved by applying it. The operations are:
COBWEB(root, record): Input: A COBWEB node root, an instance to insert record if root has no children then children := {copy(root)} newcategory(record) \\ adds child with record’s feature values. insert(record, root) \\ update root’s statistics else insert(record, root) for child in root’s children do calculate Category Utility for insert(record, child), set best1, best2 children w. best CU. end for if newcategory(record) yields best CU then newcategory(record) else if merge(best1, best2) yields best CU then merge(best1, best2) COBWEB(root, record) else if split(best1) yields best CU then split(best1) COBWEB(root, record) else COBWEB(best1, record) end if end