Аннотация

Computer Science/Data Structures and Algorithms We address the problem of the usefulness and the relevance of the set of discovered association rules. Using the frequent closed itemset groundwork, we propose to generate bases for association rules, that are non-redundant generating sets for all association rules.

Линки и ресурсы

тэги

сообщество

  • @francesco.k
  • @dblp
@francesco.k- тэги данного пользователя выделены