Skip to main content
SpringerLink
Log in

Attribute Set Dependence in Reduct Computation

  • Chapter
Transactions on Computational Science II

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 5150))

Abstract

In the paper we propose a novel approach to finding rough set reducts in information systems. Our method combines an apriori-like scheme of space traversing with an efficient pruning condition based on attribute set dependence. Moreover, we discuss theoretical and implementational aspects of our pruning procedure, including adopting a bst and a trie tree for storing set collections. Operation number and execution time tests have been performed in order to demonstrate the efficiency of our approach.

The research has been partially supported by grant No 3 T11C 002 29 received from Polish Ministry of Education and Science.

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

  • Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  • Bailey, J., Manoukian, T., Ramamohanarao, K.: Fast algorithms for mining emerging patterns. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 39–50. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  • Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough set algorithms in classification problem. Rough set methods and applications: new develop. in knowl. disc. in inf. syst., 49–88 (2000)

    Google Scholar 

  • Newman, D.J., Hettich, S., Merz, C.: UCI repository of machine learning databases (1998)

    Google Scholar 

  • Fan, H., Ramamohanarao, K.: Efficiently mining interesting emerging patterns. In: Dong, G., Tang, C.-j., Wang, W. (eds.) WAIM 2003. LNCS, vol. 2762, pp. 189–201. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  • Fan, H., Ramamohanarao, K.: Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers. IEEE Transactions on Knowledge and Data Engineering 18(6), 721–737 (2006)

    Article  Google Scholar 

  • Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp. 1–12. ACM Press, New York (2000)

    Google Scholar 

  • Hu, X., Lin, T.Y., Han, J.: A new rough sets model based on database systems. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 114–121. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  • Kryszkiewicz, M.: The Algorithms of Knowledge Reduction in Information Systems. PhD thesis, Warsaw University of Technology (1994)

    Google Scholar 

  • Kryszkiewicz, M., Cichon, K.: Towards scalable algorithms for discovering rough set reducts. In: Peters, J.F., Skowron, A., GrzymaÅ‚a-Busse, J.W., Kostek, B.z., Åšwiniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 120–143. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Lin, T.: Rough set theory in very large databases. In: Proc. of CESA IMACS 1996, Lille, France, vol. 2, pp. 936–941 (1996)

    Google Scholar 

  • Nguyen, H.S.: Scalable Classification Method Based on Rough Sets (2002)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Semeniuk-Polkowska, M., Polkowski, L.: Conjugate information systems: Learning cognitive concepts in rough set theory. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 255–258. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  • Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support, pp. 331–362. Kluwer, Dordrecht (1992)

    Chapter  Google Scholar 

  • Swiniarski, R.W.: Rough set methods in feature reduction and classification. International Journal of Applied Mathematics and Computer Science 11(3), 565–582 (2001)

    MathSciNet  MATH  Google Scholar 

  • Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters 24(6), 833–849 (2003)

    Article  MATH  Google Scholar 

  • Terlecki, P., Walczak, K.: On the relation between rough set reducts and jumping emerging patterns. Information Sciences (2006) (to be published)

    Google Scholar 

  • Wang, Y.: On cognitive informatics. icci 00, 34 (2002)

    Google Scholar 

  • Wroblewski, J.: Finding minimal reducts using genetic algorithm. In: Proc. of the 2nd Annual Join Conference on Information Sciences, pp. 186–189 (1995)

    Google Scholar 

  • Wu, Q., Bell, D.A., McGinnity, T.M.: Multiknowledge for decision making. Knowl. Inf. Syst. 7(2), 246–266 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Pawel Terlecki & Krzysztof Walczak

Authors
  1. Pawel Terlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Walczak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., Calgary, T2N 1N4, AB, Canada

    Marina L. Gavrilova

  2. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  3. Schulich School of Engineering, Department of Electrical and Computer Engineering, University of Calgary, 2500 University Drive, T2N 1N4, NW Calgary, AB, Canada

    Yingxu Wang

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Yiyu Yao

  5. School of Information Science & Technology, Southwest Jiaotong University, 610031, Chengdu, China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Terlecki, P., Walczak, K. (2008). Attribute Set Dependence in Reduct Computation. In: Gavrilova, M.L., Tan, C.J.K., Wang, Y., Yao, Y., Wang, G. (eds) Transactions on Computational Science II. Lecture Notes in Computer Science, vol 5150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87563-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87563-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87562-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation