| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435264 | Science of Computer Programming | 2012 | 17 Pages |
Abstract
⺠A formalism for mining quantified binary temporal rules. ⺠A general event quantification technique to mine quantified rules. ⺠Efficient algorithms to mine quantified and unquantified binary temporal rules. ⺠An alternative approach to perform trace slicing.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
David Lo, G. Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani,