This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper is to consider a secondary order of clustering that is not the category to which the data row belongs, but the tree, representing a single classifier, that it is eventually clustered with. Each tree branches to store subsets of other categories, but the rows in those subsets may also be related. This paper is therefore concerned with looking at that second level of clustering between the other category subsets, to try to determine if there is any consistency over it. It is argued that Principal Components may be a related and reciprocal type of structure, and there is an even bigger question about the relation between exemplars and principal components, in general. The theory is demonstrated using the Portugal Forest Fires dataset as a case study. The Category Trees are then combined with other Self-Organising algorithms from the author and it is suggested that they all belong to the same family type, which is an Entropy-style of classifier.
翻译:本文展示了一个组群算法, 这是分类树算法的延伸 。 分类树是一种组群方法, 创建树结构, 在分类类型上分支而不是特性上分支。 本文的开发是考虑第二组群的顺序, 它不是数据行所属的类别, 而是代表一个单个分类器的树, 它最终被组合在一起。 每个树枝都存储其它类别的子集, 但是这些子集中的行也可能是相关的。 因此, 本文关注的是查看其他类别子集之间的第二组群, 以试图确定它是否具有一致性 。 本文认为, 主构件可能是相关和对应的结构类型, 一般来说, 有关外观和主要构件之间关系的问题更大。 理论是用葡萄牙森林火灾数据集作为案例研究来证明的。 分类树随后与其他作者的自操作算算算算法合并在一起, 并且建议它们都属于同一家族类型, 这是一种分类器。