Skip to main navigation Skip to search Skip to main content

Tight upper bounds on the number of candidate patterns

  • F Geerts
  • , B Goethals
  • , J Van den Bussche

Research output: Contribution to journalArticleScientificpeer-review

Original languageEnglish
JournalACM Transactions on Database Systems
Volume30
Issue number2
Pages (from-to)333-363
Number of pages31
ISSN0362-5915
DOIs
Publication statusPublished - Jun 2005
MoE publication typeA1 Journal article-refereed

Fields of Science

  • algorithms
  • performance
  • theory
  • data mining
  • frequent patterns
  • upper bounds
  • ALGORITHM
  • GENERATION
  • 113 Computer and information sciences

Cite this