Representative association rules
AbstractDiscovering association rules between items in a large database is an important database mining problem. The number of association rules may be huge. In this paper, we define a cover operator that logically derives a set of association rules from a given association rule. Representative association rules are defined as a least set of rules that covers all association rules satisfying certain user specified constraints. A user may be provided with a set of representative association rules instead of the whole set of association rules. The association rules, which are not representative ones, may be generated on demand by means of the cover operator. In this paper, we offer an algorithm computing representative association rules.
|Book||Wu Xindong, Kotagiri Ramamohanarao, Korb Kevin B. (eds.): Research and Development in Knowledge Discovery and Data Mining, Lecture Notes In Computer Science, no. 1394, 1998, Springer Berlin Heidelberg, ISBN 978-3-540-64383-8, 978-3-540-69768-8|
|Keywords in English||Artificial Intelligence (incl. Robotics), Business Information Systems, cover operator, Information Storage and Retrieval, k-rule, Multimedia Information Systems, representative association rules|
|Citation count*||103 (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.