125 search results - page 23 / 25 » An efficient algorithm for incremental mining of temporal as... |
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
IJAIT
2007
13 years 7 months ago
2007
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
ICDE
2008
IEEE
15 years 7 months ago
2008
IEEE
Existing work on privacy-preserving data publishing cannot satisfactorily prevent an adversary with background knowledge from learning important sensitive information. The main cha...