# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Reduction algorithms based on discernibility matrix: The ordered attributes method. (English) Zbl 1014.68160
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:
 68T30 Knowledge representation
##### Keywords:
reduction algorithms; Pawlak reduct
##### References:
 [1] Pawlak Z. Rough Set – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dorderecht, Boston, London, 1991. [2] Skowron A, Rauszer C. The Discernibility Matrices and Functions in Information Systems. Intelligent Decision Support – Handbook of Applications and Advances of the Rough Sets Theory, Slowinski R (ed.), 1991, pp.331–362. [3] Wang J, Miao D. Analysis on attribute reduct strategies of rough set.Journal of Computer Science and Technology, 1998, 13(2): 189–193. · Zbl 0902.68049 · doi:10.1007/BF02946606 [4] Wang J, Wang R, Miao Det al. Data enriching based on rough set theory.Chinese Journal of Computers, 1998, 21(5): 393–400. [5] Wang J. Rough Sets and Their Applications in Data Mining. Fuzzy Logic and Soft Computing, Chen G (ed.), Kluwer Academic Pub., 1999, pp.195–212. [6] Quilan J. Induction of Decision Trees. Machine Learning 1, 1986, pp.81–106. [7] Utgoff P. ID5: An Incremental ID3. InProceeding of ICML-88, Ann Arbor, MI: Morgan Kaufmann 1988, pp.107–120. [8] Polkowski L, Skowron A. Rough Sets: Perspectives. Rough Sets in Knowledge Discovery 1, Polkowski L, Skowron A (eds.), Physica-Verlag, 1998, pp.1–27.