Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1014.68160
Wang, Jue; Wang, Ju
Reduction algorithms based on discernibility matrix: The ordered attributes method. (English)
[J] J. Comput. Sci. Technol. 16, No.6, 489-504 (2001). ISSN 1000-9000; ISSN 1860-4749/e

Summary: 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.

MSC 2000:: *68T30 Knowledge representation

Keywords: reduction algorithms; Pawlak reduct

Cited in: Zbl 1134.68508

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]