Skip to main content
SpringerLink
Log in

FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute

  • Chapter
Transactions on Rough Sets IX

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 5390))

Abstract

In this paper, we present our Fun algorithm for discovering minimal sets of conditional attributes functionally determining a given dependent attribute. In particular, the algorithm is capable of discovering Rough Sets certain, generalized decision, and membership distribution reducts. Fun can operate either on partitions of objects or alternatively on stripped partitions, which do not store singleton groups. It is capable of using functional dependencies occurring among conditional attributes for pruning candidate dependencies. In this paper, we offer further reduction of stripped partitions, which allows correct determination of minimal functional dependencies provided optional candidate pruning is not carried out. In the paper we consider six variants of Fun, including two new variants using reduced stripped partitions. We have carried out a number of experiments on benchmark data sets to test the efficiency of all variants of Fun. We have also tested the efficiency of the Fun’s variants against the Rosetta and RSES toolkits’ algorithms computing all reducts and against Tane, which is one of the most efficient algorithms computing all minimal functional dependencies. The experiments prove that Fun is up to 3 orders of magnitude faster than the the Rosetta and RSES toolkits’ algorithms and faster than Tane up to 30 times.

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. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in KDD, pp. 307–328. AAAI, Menlo Park (1996)

    Google Scholar 

  2. Armstrong, W.W.: Dependency Structures of Data Based Relationships. In: Proceedings of IFIP Congress, Geneva, Switzerland, pp. 580–583 (1974)

    Google Scholar 

  3. Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decision Tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS (LNAI), vol. 869, pp. 346–355. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  4. Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Rough Set Methods and Applications, pp. 49–88. Physica-Verlag, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Bazan, J.G., Szczuka, M.S.: RSES and RSESlib - A Collection of Tools for Rough Set Computations. In: Rough Sets and Current Trends in Computing, pp. 106–113 (2000)

    Google Scholar 

  6. Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

  7. Jelonek, J., Krawiec, K., Stefanowski, J.: Comparative study of feature subset selection techniques for machine learning tasks. In: Proceedings of IIS, Malbork, Poland, pp. 68–77 (1998)

    Google Scholar 

  8. Kryszkiewicz, M.: Algorytmy Redukcji Wiedzy w Systemach Informacyjnych, Ph.D. Thesis, Warsaw University of Technology (1994)

    Google Scholar 

  9. Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. Intl. Journal of Intelligent Systems 16(1), 105–120 (2001)

    Article  MATH  Google Scholar 

  10. Kryszkiewicz, M.: Certain, Generalized Decision, and Membership Distribution Reducts versus Functional Dependencies in Incomplete Systems. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 162–174. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

  12. Kryszkiewicz, M., Lasek, P.: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS, vol. 4585, pp. 320–331. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Lin, T.Y.: Rough Set Theory in Very Large Databases. In: Proceedings of CESA IMACS, Lille, France, vol. 2, pp. 936–941 (1996)

    Google Scholar 

  14. Lopes, S., Petit, J.-M., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Nguyen, S.H., Skowron, A., Synak, P., Wroblewski, J.: Knowledge Discovery in Databases: Rough Set Approach. In: Proceedings of IFSA, Prague, vol. 2, pp. 204–209 (1997)

    Google Scholar 

  16. Ohrn, A.: Discernibility and Rough Sets in Medicine: Tools and Applications, PhD thesis, Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway. NTNU report 1999:133, IDI report 1999:14

    Google Scholar 

  17. Pancerz, K., Suraj, Z.: Rough sets for discovering concurrent system models from data tables. In: Rough Computing: Theories, Technologies and Applications, pp. 239–268. Idea Group, Inc. (2007)

    Google Scholar 

  18. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, vol. 9. Kluwer Academic Publishers, Dordrecht (1991)

    Book  MATH  Google Scholar 

  19. Pawlak, Z.: Concurrent versus sequential the rough sets perspective. Bulletin of the EATCS 48, 178–190 (1992)

    MATH  Google Scholar 

  20. Shan, N., Ziarko, W., Hamilton, H.J., Cercone, N.: Discovering Classification Knowledge in Databases Using Rough Sets. In: Proceedings of KDD, pp. 271–274 (1996)

    Google Scholar 

  21. Skowron, A.: Boolean Reasoning for Decision Rules Generation. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 295–305. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  22. Skowron, A., Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. In: Proceedings of KDD, Montreal, Canada, pp. 288–293 (1995)

    Google Scholar 

  23. Slezak, D.: Approximate Reducts in Decision Tables. In: Proceedings of IPMU, Granada, Spain, vol. 3, pp. 1159–1164 (1996)

    Google Scholar 

  24. Slezak, D.: Searching for Frequential Reducts in Decision Tables with Uncertain Objects. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS, vol. 1424, pp. 52–59. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  25. Slezak, D.: Association Reducts: Complexity and Heuristics. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS, vol. 4259, pp. 157–164. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Slowinski, R. (ed.): Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, vol. 11. Kluwer Academic Publishers, Dordrecht (1992)

    MATH  Google Scholar 

  27. Stepaniuk, J.: Approximation Spaces, Reducts and Representatives. In: Rough Sets in Data Mining and Knowledge Discovery. Springer, Berlin (1998)

    Google Scholar 

  28. Suraj, Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes. In: Rough set methods and applications. New developments in knowledge discovery in information systems (Studies in fuzziness and soft computing), pp. 379–488. Physica-Verlag, Heidelberg (2000)

    Google Scholar 

  29. Wroblewski, J.: Finding Minimal Reducts Using Genetic Algorithms. In: Proceedings of JCIS, Wrightsville Beach, NC, September/October 1995, pp. 186–189 (1995)

    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

    Marzena Kryszkiewicz & Piotr Lasek

Authors
  1. Marzena Kryszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Lasek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Manitoba, R3T 5V6, Winnipeg, Manitoba, Canada

    James F. Peters

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

    Andrzej Skowron

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

    Henryk Rybiński

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kryszkiewicz, M., Lasek, P. (2008). FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. In: Peters, J.F., Skowron, A., Rybiński, H. (eds) Transactions on Rough Sets IX. Lecture Notes in Computer Science, vol 5390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89876-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89876-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89875-7

  • Online ISBN: 978-3-540-89876-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation