Tight upper bounds on the number of candidate patterns

被引：14
|
作者：
Geerts, F
Goethals, B
Van den Bussche, J
机构：
[1] Univ Edinburgh, Sch Informat, Lab Fdn Comp Sci, Edinburgh EH8 9LE, Midlothian, Scotland
[2] Univ Helsinki, FIN-00014 Helsinki, Finland
[3] Limburgs Univ Ctr, Dept WNI, B-3590 Diepenbeek, Belgium
来源：
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2005年 / 30卷 / 02期
关键词：
algorithms; performance; theory; data mining; frequent patterns; upper bounds;
D O I：
10.1145/1071610.1071611
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing tight upper bounds, derived from a combinatorial result from the sixties by Kruskal and Katona. Our result is useful to secure existing algorithms from a combinatorial explosion of the number of candidate patterns.
引用
收藏
页码：333 / 363
页数：31
相关论文
共 50 条
  • [1] A tight upper bound on the number of candidate patterns
    Geerts, F
    Goethals, B
    Van den Bussche, J
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 155 - 162
  • [2] Tight upper bounds on the number of invariant components on translation surfaces
    Naveh, Yoav
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2008, 165 (01) : 211 - 231
  • [3] Tight upper bounds on the number of invariant components on translation surfaces
    Yoav Naveh
    [J]. Israel Journal of Mathematics, 2008, 165 : 211 - 231
  • [4] THE UPPER ENVELOPE OF PIECEWISE LINEAR FUNCTIONS - TIGHT BOUNDS ON THE NUMBER OF FACES
    EDELSBRUNNER, H
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (04) : 337 - 343
  • [5] Tight Bounds on the Clique Chromatic Number
    Joret, Gwenael
    Micek, Piotr
    Reed, Bruce
    Smid, Michiel
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (03):
  • [6] Tight upper tail bounds for cliques
    Demarco, B.
    Kahn, J.
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2012, 41 (04) : 469 - 487
  • [7] Upper bounds on the coalition number
    Haynes, Teresa W.
    Hedetniemi, Jason T.
    Hedetniemi, Stephen T.
    Mcrae, Alice A.
    Mohan, Raghuveer
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2021, 80 : 442 - 453
  • [8] UPPER AND LOWER BOUNDS FOR THE NUMBER OF CONJUGATED PATTERNS IN CARBOCYCLIC AND HETEROCYCLIC-COMPOUNDS
    MORIKAWA, T
    [J]. ZEITSCHRIFT FUR NATURFORSCHUNG SECTION A-A JOURNAL OF PHYSICAL SCIENCES, 1994, 49 (10): : 973 - 976
  • [9] Upper Bounds on the Total Domination Number
    Haynes, Teresa W.
    Henning, Michael A.
    [J]. ARS COMBINATORIA, 2009, 91 : 243 - 256
  • [10] Improved Upper Bounds on the Crossing Number
    Dujmovic, Vida
    Kawarabayashi, Ken-ichi
    Mohar, Bojan
    Wood, David R.
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08), 2008, : 375 - 384
12345