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 条
  • [21] Upper bounds on the upper signed total domination number of graphs
    Shan, Erfang
    Cheng, T. C. E.
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 1098 - 1103
  • [22] UPPER BOUNDS FOR THE NUMBER OF NUMBER FIELDS WITH ALTERNATING GALOIS GROUP
    Larson, Eric
    Rolen, Larry
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2013, 141 (02) : 499 - 503
  • [23] Upper bounds for the number of spanning trees of graphs
    Bozkurt, S. Burcu
    [J]. JOURNAL OF INEQUALITIES AND APPLICATIONS, 2012,
  • [24] Some Upper Bounds Related with Domination Number
    Gu Z.
    Meng J.
    Zhang Z.
    Wan J.E.
    [J]. Journal of the Operations Research Society of China, 2013, 1 (2) : 217 - 225
  • [25] Upper bounds for ropelength as a function of crossing number
    Cantarella, J
    Faber, XWC
    Mullikin, CA
    [J]. TOPOLOGY AND ITS APPLICATIONS, 2004, 135 (1-3) : 253 - 264
  • [26] Upper bounds for the number of spanning trees of graphs
    Ş Burcu Bozkurt
    [J]. Journal of Inequalities and Applications, 2012
  • [27] Upper bounds on the paired-domination number
    Chen, Xue-gang
    Shiu, Wai Chee
    Chan, Wai Hong
    [J]. APPLIED MATHEMATICS LETTERS, 2008, 21 (11) : 1194 - 1198
  • [28] Upper bounds on the linear chromatic number of a graph
    Li, Chao
    Wang, Weifan
    Raspaud, Andre
    [J]. DISCRETE MATHEMATICS, 2011, 311 (04) : 232 - 238
  • [29] Upper bounds for the number of facets of a simplicial complex
    Herzog, J
    Hibi, T
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1997, 125 (06) : 1579 - 1583
  • [30] Upper and Lower Bounds on the Number of Disjunctive Forms
    Tatsumi, Hisayuki
    Miyakawa, Masahiro
    Mukaidono, Masao
    [J]. ISMVL 2006: 36TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, 2006, : 50 - +
12345