374 search results - page 59 / 75 » New Algorithms for Fast Discovery of Association Rules |
120
Voted
SSD
2001
Springer
15 years 2 months ago
2001
Springer
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
65
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
DIS
2008
Springer
14 years 11 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...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
64
Voted
AAAI
2004
14 years 11 months ago
2004
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...