关键词: 粗糙集, 聚类, 分类效用, 核心, 最佳归约集

Abstract: An efficient algorithm CRSC(a Clustering Algorithm Based On Rough Set and Cobweb) was proposed. Aiming at the shortage of Cobweb and according to some correlative theories, the theory of rough set was imported to solve a best reduced set of attribute-value pairs, and then it was combined with Cobweb algorithm to construct a hierarchical tree. Our experiment study shows that it greatly advances efficiency without losing accuracy compared with previous methods.

Key words: rough set, clustering, CU, core, best reduced set