Fast Discovery of Representative Association Rules
AbstractDiscovering association rules among items in a large database is an important database mining problem. The number of association rules may be huge. To alleviate this problem, we introduced in  a notion of representative association rules. Representative association rules are a least set of rules that covers all association rules satisfying certain user specified constraints. The association rules, which are not representative ones, may be generated by means of a cover operator without accessing a database. In this paper, we investigate properties of representative association rules and offer a new efficient algorithm computing such rules.
|Book||Polkowski Lech, Skowron Andrzej (eds.): Rough Sets and Current Trends in Computing, Lecture Notes In Computer Science, vol. LNAI 1424, 1998, Springer, ISBN 3-540-64655-8, 625 p., DOI:10.1007/3-540-69115-4|
|Keywords in English||Artificial Intelligence (incl. Robotics), Computation by Abstract Devices, Image Processing and Computer Vision, Mathematical Logic and Formal Languages|
|Citation count*||40 (2018-02-17)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.