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

Bin Chen; Peter J. Haas; Peter I Scheuermann

doi:10.1109/ICDE.2002.994717

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

Bin Chen, Peter J. Haas, Peter I Scheuermann

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

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.

Original language	English (US)
Number of pages	1
Journal	Proceedings - International Conference on Data Engineering
DOIs	https://doi.org/10.1109/ICDE.2002.994717
State	Published - Jan 1 2002

ASJC Scopus subject areas

Software
Signal Processing
Information Systems

Access to Document

10.1109/ICDE.2002.994717

Cite this

@article{28697776a61743b3a8a33f14c08cf378,

title = "FAST: A new sampling-based algorithm for discovering association rules",

abstract = "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.",

author = "Bin Chen and Haas, {Peter J.} and Scheuermann, {Peter I}",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/ICDE.2002.994717",

language = "English (US)",

journal = "Proceedings - International Conference on Data Engineering",

issn = "1084-4627",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - FAST

T2 - A new sampling-based algorithm for discovering association rules

AU - Chen, Bin

AU - Haas, Peter J.

AU - Scheuermann, Peter I

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036206372&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036206372&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2002.994717

DO - 10.1109/ICDE.2002.994717

M3 - Article

AN - SCOPUS:0036206372

SN - 1084-4627

JO - Proceedings - International Conference on Data Engineering

JF - Proceedings - International Conference on Data Engineering

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this