FAST: A new sampling-based algorithm for discovering association rules

被引：0
|
作者：
Bin, C
Haas, PJ
Scheuermann, P
机构：
[1] Exelixis, Inc.
[2] Dept. of ECE, Northwestern U.
来源：
18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/ICDE.2002.994717
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A sampling-based algorithm for discovering association rules is presented. The finding associations from sampled transactions (FAST) algorithm is a refined sampling-based mining algorithm that is distinguished from other algorithms by its novel two-phase approach to sample collection. Results showed that the FAST is a promising algorithms in situations where good approximate answers suffice and the interactive, real time response is essential.
引用
收藏
页码：263 / 263
页数：1
相关论文
共 50 条
  • [21] Multi-Scaling Sampling: An Adaptive Sampling Method for Discovering Approximate Association Rules
    Cai-Yan Jia
    Xie-Ping Gao
    [J]. Journal of Computer Science and Technology, 2005, 20 : 309 - 318
  • [22] Adaptive sampling-based quadrature rules for efficient Bayesian prediction
    van den Bos, L. M. M.
    Sanderse, B.
    Bierbooms, W. A. A. M.
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2020, 417
  • [23] Multi-scaling sampling: An adaptive sampling method for discovering approximate association rules
    Jia, CY
    Gao, XP
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (03) : 309 - 318
  • [24] An algorithm research for distributed association rules mining with constraints based on sampling
    Li, Hong
    Chen, Song-qiao
    Du, Jian-feng
    Yi, Li-jun
    Xiao, Wei
    [J]. PROCEEDINGS OF THE FIFTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, VOLS 1 AND 2, 2006, : 478 - 483
  • [25] A Sampling Based Algorithm for Finding Association Rules from Uncertain Data
    Zhu Qian
    Pan Donghua
    Yang Guangfei
    [J]. ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, PT I, 2010, 6319 : 124 - 131
  • [26] Discovering association rules based on image content
    Ordonez, C
    Omiecinski, E
    [J]. IEEE FORUM ON RESEARCH AND TECHNOLOGY ADVANCES IN DIGITAL LIBRARIES, PROCEEDINGS, 1999, : 38 - 49
  • [27] An association based approach to discovering ordering rules
    Liu, Da-Zhong
    Gao, Yuan
    Zhao, Jian-Ping
    [J]. PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 202 - 205
  • [28] Discovering association rules based on image content
    Ordonez, Carlos
    Omiecinski, Edward
    [J]. Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL, 1999, : 38 - 49
  • [29] A Sampling-Based Algorithm for Planning Smooth Nonholonomic Paths
    Beretta, Carolina
    Brizzolari, Cecilia
    Tateo, Davide
    Riva, Alessandro
    Amigoni, Francesco
    [J]. 2019 EUROPEAN CONFERENCE ON MOBILE ROBOTS (ECMR), 2019,
  • [30] Sampling-based Smoothed Analysis for Network Algorithm Evaluation
    Ren, Xiaoqi
    Liu, Zhi
    Qi, Yaxuan
    Li, Jun
    Teng, Shanghua
    [J]. 2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 1538 - 1543
12345