Skip to main content
SpringerLink
Log in

Association Reducts: Boolean Representation

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

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

Included in the following conference series:

Abstract

We investigate association reducts, which extend previously studied information and decision reducts in capability of expressing compound, multi-attribute dependencies in data. We provide Boolean, discernibility-based representation for most informative association reducts.

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 assocation rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)

    Google Scholar 

  2. Baldi, P., Hatfield, W.G.: DNA Microarrays and Gene Expression: From Experiments to Data Analysis and Modeling. Cambridge University Press, Cambridge (2002)

    Book  Google Scholar 

  3. Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough Set Algorithms in Classification Problem. In: Rough Set Methods and Applications, pp. 49–88. Physica Verlag (2000)

    Google Scholar 

  4. Brown, E.M.: Boolean reasoning. Kluwer, Dordrecht (1990)

    MATH  Google Scholar 

  5. Grużdź, A., Ihnatowicz, A., Ślȩzak, D.: Interactive gene clustering – a case study of breast cancer microarray data. In: Information Systems Frontiers 8, pp. 21–27. Springer, Heidelberg (2006)

    Google Scholar 

  6. Kloesgen, W., Żytkow, J.M. (eds.): Handbook of Data Mining and Knowledge Discovery. Oxford University Press, Oxford (2002)

    MATH  Google Scholar 

  7. Nguyen, H.S., Nguyen, S.H.: Rough Sets and Association Rule Generation. Fundamenta Informaticae 40(4), 310–318 (1999)

    Google Scholar 

  8. Pawlak, Z.: Rough sets – Theoretical aspects of reasoning about data. Kluwer, Dordrecht (1991)

    MATH  Google Scholar 

  9. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 311–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  10. Ślȩzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53(3-4), 365–390 (2002)

    MathSciNet  Google Scholar 

  11. Ślȩzak, D.: Association Reducts: A Framework for Mining Multi-attribute Dependencies. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 354–363. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Ślȩzak, 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 (LNAI), vol. 4259, Springer, Heidelberg (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, S4S 0A2, Canada

    Dominik Ślęzak

  2. Polish-Japanese Institute of Information Technology, Koszykowa 86, 02-008, Warsaw, Poland

    Dominik Ślęzak

Authors
  1. Dominik Ślęzak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science and Technology, Chongqing, University of Posts and Telecommunication, 400065, Chongqing, P.R. China

    Guo-Ying Wang

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

    James F. Peters

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

    Andrzej Skowron

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

    Yiyu Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ślęzak, D. (2006). Association Reducts: Boolean Representation. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_44

Download citation

  • DOI: https://doi.org/10.1007/11795131_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation