Affiliations: Division of Mathematical and Computer Sciences and
Engineering, King Abdullah University of Science and Technology, P.O. Box 55455,
Jeddah 21534, Saudi Arabia. mikhail.moshkov@kaust.edu.sa | ING Bank Śl�ski S.A. 34, Sokolska St.,
Katowice 40-086, Poland. marcin.piliszczuk@ingbank.pl | Institute of Computer Science, University of Silesia
39, B�dzińska St., Sosnowiec 41-200, Poland.
beata.zielosko@us.edu.pl
Note: [] Address for correspondence: Division of Mathematical and
Computer Sciences and Engineering, King Abdullah University of Science and
Technology, P.O. Box 55455, Jeddah 21534, Saudi Arabia
Abstract: 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.
Keywords: Rough sets, information systems, weights, association rules, greedy algorithms
