Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Reduction algorithms based on discernibility matrix: The ordered attributes method

Reduction algorithms based on discernibility matrix: The ordered attributes method In this paper, we present reduction algorithms based on the principle of Skowron’s discernibility matrix — the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved. Since a discernibility matrix requires the size of the memory of |U|2,U is a universe of objects, it would be impossible to apply these algorithms directly to a massive object set. In order to solve the problem, a so-called quasi-discernibility matrix and two reduction algorithms are proposed. Although the proposed algorithms are incomplete for Pawlak reduct, their optimal paradigms ensure the completeness as long as they satisfy some conditions. Finally, we consider the problem on the reduction of distributive object sets. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Computer Science and Technology Springer Journals

Reduction algorithms based on discernibility matrix: The ordered attributes method

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/reduction-algorithms-based-on-discernibility-matrix-the-ordered-RPdXFb4Jxp

References (9)

Publisher
Springer Journals
Copyright
Copyright © Science Press, Beijing China and Allerton Press Inc. 2001
ISSN
1000-9000
eISSN
1860-4749
DOI
10.1007/bf02943234
Publisher site
See Article on Publisher Site

Abstract

In this paper, we present reduction algorithms based on the principle of Skowron’s discernibility matrix — the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved. Since a discernibility matrix requires the size of the memory of |U|2,U is a universe of objects, it would be impossible to apply these algorithms directly to a massive object set. In order to solve the problem, a so-called quasi-discernibility matrix and two reduction algorithms are proposed. Although the proposed algorithms are incomplete for Pawlak reduct, their optimal paradigms ensure the completeness as long as they satisfy some conditions. Finally, we consider the problem on the reduction of distributive object sets.

Journal

Journal of Computer Science and Technology – Springer Journals

Published: Nov 1, 2001

Keywords: rough set theory; principle of discernibility matrix; inductive machine learning

There are no references for this article.