318 search results - page 34 / 64 » Efficient Mining of Generalized Negative Association Rules |
IDEAL
2003
Springer
14 years 28 days ago
2003
Springer
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
PKDD
1998
Springer
13 years 12 months ago
1998
Springer
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
KDD
1999
ACM
13 years 12 months ago
1999
ACM
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
CIKM
2001
Springer
13 years 11 months ago
2001
Springer
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...