Open Access
2014 A Novel Research on Rough Clustering Algorithm
Tao Qu, Jinyu Lu, Hamid Reza Karimi, E Xu
Abstr. Appl. Anal. 2014: 1-6 (2014). DOI: 10.1155/2014/205062


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.


Download Citation

Tao Qu. Jinyu Lu. Hamid Reza Karimi. E Xu. "A Novel Research on Rough Clustering Algorithm." Abstr. Appl. Anal. 2014 1 - 6, 2014.


Published: 2014
First available in Project Euclid: 2 October 2014

zbMATH: 07021922
Digital Object Identifier: 10.1155/2014/205062

Rights: Copyright © 2014 Hindawi

Vol.2014 • 2014
Back to Top