Skip to main content
SpringerLink
Log in

Parallel Computation of Reducts

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

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

Included in the following conference series:

Abstract

The paper addresses the problem of reduct generation, one of the key issues in the rough set theory. A considerable speed up of computations may be achieved by decomposing the original task into subtasks and executing these as parallel processes. This paper presents an effective method of such a decomposition. The presented algorithm is an adaptation of the reduct generation algorithm based on the notion of discernibility matrix. The practical behaviour of the parallel algorithm is illustrated with a computational experiment conducted for a real-life data set.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dash M. & Liu H. ‘Feature Selection for Classification’, Intelligent Data Analysis (on-line journal), Vol. 1, No 3, (1997), http://www-east.elsevier.com/ida.

  2. Jaja J. An Introduction to Parallel Algorithms, Addison Wesley, (1992).

    Google Scholar 

  3. Jelonek J., Krawiec K. & Slowinski R. ‘Rough set reduction of attributes and their domains for neural networks’, Computational Intelligence, Vol. 11, No 2, (1995), pp. 339–347.

    Article  Google Scholar 

  4. Kryszkiewicz M. & Rybinski H. ‘Finding Reducts in Composed Information Systems’, Fundamenta Informaticae, Vol. 2, No 2/3, (1996), pp. 183–196.

    MathSciNet  Google Scholar 

  5. Orlowska M. & Orlowski M. ‘Maintenance of Knowledge in Dynamic Information Systems’, In: Slowinski R., (ed.), Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, Kluwer Academic Publishers, Dordrecht, (1992), pp. 315–330.

    Google Scholar 

  6. Romanski S. ‘Operations on Families of Sets for Exhaustive Search Given a Monotonic Function’, In: Beeri, C., Smith, J.W., Dayal, U., (eds), Proceedings of the 3rd International Conference on Data and Knowledge Bases, Jerusalem, Israel, (1988), pp. 28–30.

    Google Scholar 

  7. Skowron A. & Rauszer C. ‘The Discernibility Matrices and Functions in Information Systems’, In: Slowinski R., (ed.), Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, Kluwer Academic Publishers, Dordrecht, (1992), pp. 331–362.

    Google Scholar 

  8. Slowinski K., Stefanowski J., Antczak A. and Kwias Z. ‘Rough Set Approach to the Verification of Indications for Treatment of Urinary Stones by Extracorporeal Shock Wave Lithotripsy (ESWL)’, In: Lin T.Y., Wildberger A.M., (eds.), Soft Computing, Society for Computer Simulation, San Diego, California, (1995), pp. 142–145.

    Google Scholar 

  9. Ziarko W. & Shan N. ‘Data-Based Acquisition and Incremental Modification of Classification Rules’, Computational Intelligence, Vol. 11, No 2, (1995), pp. 357–370.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Poznań University of Technology, Piotrowo 3A, 60-965, Poznań, Poland

    Robert Susmaga

Authors
  1. Robert Susmaga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-665, Warszawa, Poland

    Lech Polkowski

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Susmaga, R. (1998). Parallel Computation of Reducts. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation