Pushing tougher constraints in frequent pattern mining (Articolo in rivista)

Type
Label
  • Pushing tougher constraints in frequent pattern mining (Articolo in rivista) (literal)
Anno
  • 2005-01-01T00:00:00+01:00 (literal)
Alternative label
  • Bonchi F.; Lucchese C. (2005)
    Pushing tougher constraints in frequent pattern mining
    in Lecture notes in computer science
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Bonchi F.; Lucchese C. (literal)
Pagina inizio
  • 114 (literal)
Pagina fine
  • 124 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • 9th Advances in Knowledge Discovery and Data Mining, Pacific-Asia Conference (Hanoi, Vietnam, May 18-20, 2005). Proceedings. Ho, Tu Bao and Cheung, David (eds.). Springer, 2005. (literal)
Note
  • ISI Web of Science (WOS) (literal)
Titolo
  • Pushing tougher constraints in frequent pattern mining (literal)
Abstract
  • In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-monotone constraints, and we deeply characterize them by showing that they are a superclass of convertible anti-monotone constraints (e.g. constraints on average or median) and that they model tougher constraints (e.g. constraints on variance or standard deviation). Then we show how these constraints can be exploited in a level-wise Apriori-like computation by means of a new data-reduction technique: the resulting algorithm outperforms previous proposals for convertible constraints, and it is to treat much tougher constraints with the same effectiveness of easier ones. (literal)
Prodotto di
Insieme di parole chiave

Incoming links:


Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it