Attribute Core Computation Based on Divide and Conquer Method

Authors:
Feng Hu;Guoyin Wang;Ying Xia
Affiliations:
School of Information Science and Technology, Southwest Jiaotong University, Chengdu 600031, P.R. China and Institute of Computer Science and Technology, Chongqing University of Posts and Telecomm ...;School of Information Science and Technology, Southwest Jiaotong University, Chengdu 600031, P.R. China and Institute of Computer Science and Technology, Chongqing University of Posts and Telecomm ...;School of Information Science and Technology, Southwest Jiaotong University, Chengdu 600031, P.R. China and Institute of Computer Science and Technology, Chongqing University of Posts and Telecomm ...
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 3
Cited 2

Rough set algorithms in classification problem

Rough set methods and applications
Reduction algorithms based on discernibility matrix: the ordered attributes method

Journal of Computer Science and Technology
Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems

Huge Data Mining Based on Rough Set Theory and Granular Computing

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Parallelized computing of attribute core based on rough set theory and mapreduce

RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The idea of divide and conquer method is used in developing algorithms of rough set theory. In this paper, according to the partitions of equivalence relations on attributes of decision tables, two novel algorithms for computing attribute core based on divide and conquer method are proposed. Firstly, a new algorithm for computing the positive region of a decision table is proposed, and its time complexity is O(|U|×|C|), where, |U| is the size of the set of objects and Cis the size of the set of attributes. Secondly, a new algorithm for computing the attribute core of a decision table is developed, and its time complexity is O(|U|×|C|2). Both these two algorithms are linear with |U|. Simulation experiment results show that the algorithm of computing attribute core is not only efficient, but also adapt to huge data sets.