Skip to main content
SpringerLink
Log in

Generate (F, ε)-Dynamic Reduct Using Cascading Hashes

  • Conference paper
Rough Set and Knowledge Technology (RSKT 2010)

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

Included in the following conference series:

  • 929 Accesses

Abstract

Dynamic reducts with large stability coefficients are good candidates for decision rules generation but it is time consuming to generate them. This paper presents an algorithm dReducts using a cascading hash function to generate (F, ε)-dynamic reducts. With the cascading hash function, an F-dynamic reduct can be generated in O(m 2 n) time with O(mn) space where m and n are total number of attributes and total number of instances of the table. Empirical results of generating (F, ε)-dynamic reducts using five of ten most popular UCI datasets are presented and they are compared to the Rough Set Exploration System (RSES).

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bazan, J.G.: A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision table. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 321–365. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  2. Bazan, J.G., Szczuka, M.S., Wróblewski, J.: A new version of rough set exploration system. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 397–404. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Hu, X., Lin, T.Y., Han, J.C.: A new rough sets model based on database systems. Fundamenta Informaticae 59, 135–152 (2004)

    MATH  MathSciNet  Google Scholar 

  4. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough sets: a tutorial. In: Pa, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization: A New Trend in Decision-Making, pp. 3–98. Springer, Telos (1999)

    Google Scholar 

  5. Kumar, A.: New techniques for data reduction in database systems for knowledge discovery applications. Journal of Intelligent Information Systems 10(1), 31–48 (1998)

    Article  Google Scholar 

  6. Miao, D., Hou, L.: A comparison of rough set methods and representative inductive learning algorithms. Fundamenta Informaticae 59, 203–219 (2004)

    MATH  MathSciNet  Google Scholar 

  7. Nguyen, S.H., Nguyen, H.S.: Some efficient algorithms for rough set methods. In: Proc. of Information Processing and Management of Uncertainty in Knowledge-Based Systems, pp. 1451–1456 (1996)

    Google Scholar 

  8. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  9. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Netherlands (1991)

    MATH  Google Scholar 

  10. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information Systems. Fundamenta Informaticae 15(2), 331–362 (1991)

    Google Scholar 

  11. Skowron, A., Bazan, J., Szczuka, M.S., Wróblewski, J.: Rough Set Exploration System (version 2.2.2), http://logic.mimuw.edu.pl/~rses/

  12. Wang, P.C.: Highly scalable rough set reducts generation. Journal of Information Science and Engineering 23, 1281–1298 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Southern Taiwan University, No.1, Nantai St., Yung-Kang City, Tainan County, 710, Taiwan

    Pai-Chou Wang

Authors
  1. Pai-Chou Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer and Information Technology, Beijing Jiaotong University, 100044, Beijing, China

    Jian Yu

  2. Faculty of Economics, University of Catania, Corso Italia, 55, 95129, Catania, Italy

    Salvatore Greco

  3. Department of Mathematics and Computing Science, Saint Mary’s University, B3H 3C3, Halifax, Nova Scotia, Canada

    Pawan Lingras

  4. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, 400065, Chongqing, China

    Guoyin Wang

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

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, PC. (2010). Generate (F, ε)-Dynamic Reduct Using Cascading Hashes. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16248-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16247-3

  • Online ISBN: 978-3-642-16248-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation