Skip to main content
SpringerLink
Log in

On Construction of Partial Association Rules

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

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

Included in the following conference series:

Abstract

This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during greedy algorithm work, and results of the study of association rules for the most part of binary information systems.

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., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th International Conference on Very Large Data Bases, pp. 487–499. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  2. Bazan, J.G.: Discovery of decision rules by matching new objects against data tables. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 521–528. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Feige, U.: A threshold of ln n for approximating set cover (preliminary version). In: Proc. 28th Annual ACM Symposium on the Theory of Computing, pp. 314–318. ACM Press, New York (1996)

    Google Scholar 

  4. Frequent Itemset Mining Implementations Repository, http://fimi.cs.helsinki.fi/

  5. Moshkov, M.J., Piliszczuk, M., Zielosko, B.: On partial covers, reducts and decision rules. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol. 5084, pp. 251–288. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Moshkov, M.J., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. Studies in Computational Intelligence, vol. 145. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  7. Moshkov, M.J., Skowron, A., Suraj, Z.: On minimal rule sets for almost all binary information systems. Fundamenta Informaticae 80(1–3), 247–258 (2007)

    MATH  Google Scholar 

  8. Nguyen, H.S.: Approximate Boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 344–523. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Nguyen, H.S., Ślęzak, D.: Approximate reducts and association rules. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Pawlak, Z.: Rough set elements. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1. Methodology and Applications. Studies in Fuzziness and Soft Computing, pp. 10–30. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  11. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177(1), 3–27 (2007); Rough sets: Some extensions. Information Sciences 177(1), 28–40 (2007); Rough sets and boolean reasoning. Information Sciences 177(1), 41–73 (2007)

    Google Scholar 

  12. Quafafou, M.: α-RST: a generalization of rough set theory. Information Sciences 124, 301–316 (2000)

    Article  MATH  Google Scholar 

  13. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. 29th Annual ACM Symposium on the Theory of Computing, pp. 475–484. ACM Press, New York (1997)

    Google Scholar 

  14. Rissanen, J.: Modeling by shortest data description. Automatica 14, 465–471 (1978)

    Article  MATH  Google Scholar 

  15. Skowron, A.: Rough sets in KDD. In: Shi, Z., Faltings, B., Musen, M. (eds.) Proc. 16th IFIP World Computer Congress, pp. 1–14. PUBL1 (2000)

    Google Scholar 

  16. Slavík, P.: A tight analysis of the greedy algorithm for set cover (extended abstract). In: Proc. 28th Annual ACM Symposium on the Theory of Computing, pp. 435–441. ACM Press, New York (1996)

    Google Scholar 

  17. Slavík, P.: Approximation algorithms for set cover and related problems, Ph.D. Thesis, University of New York at Buffalo (1998)

    Google Scholar 

  18. Ślȩzak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundamenta Informaticae 44, 291–319 (2000)

    Google Scholar 

  19. Ślȩzak, D.: Approximate entropy reducts. Fundamenta Informaticae 53, 365–390 (2002)

    Google Scholar 

  20. Wróblewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47, 351–360 (2001)

    MATH  Google Scholar 

  21. Ziarko, W.: Analysis of uncertain information in the framework of variable precision rough sets. Foundations of Computing and Decision Sciences 18, 381–396 (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematical and Computer Science and Engineering, King Abdullah University of Science and Technology, P.O. Box 55455, Jeddah, 21534, Saudi Arabia

    Mikhail Ju. Moshkov

  2. ING Bank Śla̧ski S.A., 34, Sokolska St., Katowice, 40-086, Poland

    Marcin Piliszczuk

  3. Institute of Computer Science, University of Silesia, 39, Bȩdzińska St., Sosnowiec, 41-200, Poland

    Beata Zielosko

Authors
  1. Mikhail Ju. Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Piliszczuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beata Zielosko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Surveying and Engineering, University of Southern Queensland, QLD 4350, Australia

    Peng Wen

  2. School of Information Technology, Queensland University of Technology, QLD 4001, Brisbane, Australia

    Yuefeng Li

  3. Institute of Mathematics, Warsaw University of Technology, Koszykowa 86, 02008, Warsaw, Poland

    Lech Polkowski

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

    Yiyu Yao

  5. Faculty of Medicine, Department of Medical Informatics, Shimane University, 89-1 Enya-cho, Izumo, 693-8501, Shimane, Japan

    Shusaku Tsumoto

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

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moshkov, M.J., Piliszczuk, M., Zielosko, B. (2009). On Construction of Partial Association Rules. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02962-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02961-5

  • Online ISBN: 978-3-642-02962-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation