✦ LIBER ✦

On the Decision Table with Maximal Number of Reducts

✍ Scribed by Hung Son Nguyen

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 562 KB
Volume: 82
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80718-7

No coin nor oath required. For personal study only.

✦ Synopsis

Searching for reducts is a basic problem for many rough set methods like rule induction, classification, etc.. Many of them can not be realized in exact way because of existing possibly exponential number of (relative) reducts in decision tables. In this paper we investigate properties of the most malicious decision tables, i.e., tables with maximal number of reducts. We show that in such systems, the number of objects must be also exponential. The presented method is based on Boolean reasoning approach.

📜 SIMILAR VOLUMES

Reduction of the decision table: A rough

Reduction of the decision table: A rough approach

✍ Shrabonti Ghosh; Ranjit Biswas; S. S. Alam 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 70 KB

In this article, we generalize Pawlak's rough approach for simplifying the decision table in an information system. We consider an information system where attribute values are not always quantitative, but are rather subjective, having vague or imprecise meanings. Some objects may have attribute val

On the maximum number of permutations wi

On the maximum number of permutations with given maximal or minimal distance

✍ Peter Frankl; Mikhail Deza 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 495 KB

The maximal number of quotient singulari

The maximal number of quotient singularities on surfaces with given numerical invariants

✍ Yoichi Miyaoka 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 571 KB

The Maximal Unramified Extensions of the

The Maximal Unramified Extensions of the Imaginary Quadratic Number Fields with Class Number Two

✍ Ken Yamamura 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 290 KB

The maximal unramified extensions of the imaginary quadratic number fields with class number two are determined explicitly under the Generalized Riemann Hypothesis.

On the number of maximal bipartite subgr

On the number of maximal bipartite subgraphs of a graph

✍ Jesper Makholm Byskov; Bolette Ammitzbøll Madsen; Bjarke Skjernaa 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ¼ O(1:8613 n ) and give an algorithm that finds all maximal

Constraints on the number of maximal ind

Constraints on the number of maximal independent sets in graphs

✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m