Greedy algorithms withweights for construction of partial association rules

Mikhail Moshkov, Marcin Piliszczu, Beata Marta Zielosko

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.
Original languageEnglish (US)
Pages (from-to)101-120
Number of pages20
JournalFundamenta Informaticae
Issue number1
StatePublished - Sep 10 2009

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Algebra and Number Theory
  • Theoretical Computer Science
  • Information Systems


Dive into the research topics of 'Greedy algorithms withweights for construction of partial association rules'. Together they form a unique fingerprint.

Cite this