On construction of partial association rules

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. © 2009 Springer Berlin Heidelberg.

Citation
Moshkov, M. J., Piliszczuk, M., & Zielosko, B. (2009). On Construction of Partial Association Rules. Lecture Notes in Computer Science, 176–183. doi:10.1007/978-3-642-02962-2_22

Publisher
Springer Nature

Journal
Rough Sets and Knowledge Technology

Conference/Event Name
4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009

DOI
10.1007/978-3-642-02962-2_22

Permanent link to this record