On Construction of Partial Association Rules

  • Authors:
  • Mikhail Ju. Moshkov;Marcin Piliszczuk;Beata Zielosko

  • Affiliations:
  • Division of Mathematical and Computer Science and Engineering, King Abdullah University of Science and Technology, Jeddah, Saudi Arabia 21534;ING Bank Śląski S.A., Katowice, Poland 40-086;Institute of Computer Science, University of Silesia, Sosnowiec, Poland 41-200

  • Venue:
  • RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.