Skip to main content
padlock icon - secure page this page is secure

Generalized disjunction-free representation of frequent patterns with negation

Buy Article:

$60.00 + tax (Refund Policy)

The discovery of frequent patterns is one of the main data mining problems. Frequent patterns are used for discovering association rules, episode rules, sequential patterns and clusters. The number of frequent patterns is usually huge. In order to alleviate this problem, a number of lossless representations of frequent patterns have been proposed recently. Theoretical works prove that frequent closed itemsets and models based on generalized disjunction-free sets or non-derivable itemsets are minimal representations of frequent patterns. Experiments prove further that the latter representations are by a few orders of magnitude more concise than the former one. The offered models were intended to represent only frequent patterns without negation. In this article, we offer a lossless representation based on generalized disjunction-free sets that represents frequent patterns both with and without negation. An algorithm for discovering this representation is also provided.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: Concise representations; Data mining; Frequent patterns; Knowledge discovery

Document Type: Research Article

Affiliations: Warsaw University of Technology Nowowiejska 15/19 00-665 Warsaw Poland

Publication date: January 1, 2005

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more