Skip to main content

On Partial Tests and Partial Reducts for Decision Tables

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3641))


In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Moshkov, M.J.: Greedy algorithm for set cover in context of knowledge discovery problems. In: Proceedings of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing (ETAPS 2003 Satellite Event), Warsaw, Poland. Electronic Notes in Theoretical Computer Science, vol. 82(4) (2003)

    Google Scholar 

  2. Moshkov, M.J.: On greedy algorithm for partial cover construction. In: Proceedings of the Fourteenth International Workshop Design and Complexity of Control Systems, Nizhny Novgorod, Russia, vol. 57 (2003) (in Russian)

    Google Scholar 

  3. Moshkov, M.J., Piliszczuk, M.: On construction of partial reducts and bounds on their complexity. In: Proceedings of the Conference Decision Support Systems, Zakopane, Poland (2004) (to appear)

    Google Scholar 

  4. Nguyen, H.S., Ślȩzak, D.: Approximate reducts and association rules - correspondence and complexity results. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Pawlak, Z.: Rough set elements. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1. Methodology and Applications (Studies in Fuzziness and Soft Computing 18), pp. 10–30. Phisica, Heidelberg (1998)

    Google Scholar 

  6. Skowron, A.: Rough sets in KDD. In: Proceedings of the 16-th World Computer Congress (IFIP 2000), Beijing, China, pp. 1–14.

    Google Scholar 

  7. Slavík, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing, pp. 435–439 (1996)

    Google Scholar 

  8. Ślȩzak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundamenta Informaticae 44, 291–319 (2000)

    MathSciNet  Google Scholar 

  9. Ślȩzak, D.: Approximate entropy reducts. Fundamenta Informaticae 53, 365–390 (2002)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moshkov, M.J., Piliszczuk, M. (2005). On Partial Tests and Partial Reducts for Decision Tables. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28653-0

  • Online ISBN: 978-3-540-31825-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics