Tree expressions for information systems

Authors:
Min Zhao;Su-Qing Han;Jue Wang
Affiliations:
NEC Research China, Beijing, China;Department of Mathematics, Taiyuan Normal University, Taiyuan, China;Institute of Automation, Chinese Academy of Sciences, Beijing, China
Venue:
Journal of Computer Science and Technology
Year:
2007

Citing 6
Cited 2

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Reduction algorithms based on discernibility matrix: the ordered attributes method

Journal of Computer Science and Technology
Induction of Decision Trees

Machine Learning
Multilevel data summarization from information systems: a "rule + exception" approach

AI Communications - Special issue on Artificial intelligence advances in China
Reduct and attribute order

Journal of Computer Science and Technology
Inconsistency classification and discernibility-matrix-based approaches for computing an attribute core

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing

Stability analysis on rough set based feature evaluation

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
An improved generalized tree layout algorithm

CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The discernibility matrix is one of the most important approaches to computing positive region, reduct, core and value reduct in rough sets. The subject of this paper is to develop a parallel approach of it, called "tree expression". Its computational complexity for positive region and reduct is O(m2 × n) instead of O(m × n2) in discernibility-matrix-based approach, and is not over O(n2) for other concepts in rough sets, where m and n are the numbers of attributes and objects respectively in a given dataset (also called an "information system" in rough sets). This approach suits information systems with n ≫ m and containing over one million objects.