A Novel Research on Rough Clustering Algorithm

Abstract EN

The aim of this study is focusing the issue of traditional clustering algorithm subjects to data space distribution influence, a novel clustering algortihm combined with rough set theory is employed to the normal clustering.

The proposed rough clustering algorithm takes the condition attributes and decision attributes displayed in the information table as the consistency principle, meanwhile it takes the data supercubic and information entropy to realize data attribute shortcutting and discretizing.

Based on above discussion, by applying assemble feature vector addition principle computiation only one scanning information table can realize clustering for the data subject.

Experiments reveal that the proposed algorithm is efficient and feasible.