245 search results - page 36 / 49 » Using Finite State Automata for Sequence Mining |
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
We consider the problem of mining high-utility plans from historical plan databases that can be used to transform customers from one class to other, more desirable classes. Tradit...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
IANDC
2006
13 years 7 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...