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.
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Algebra and Number Theory
- Theoretical Computer Science
- Information Systems