An event is described herein as being representable by a quantified abstraction of the event. The event includes at least one predicate, and the at least one predicate has at least one constant symbol corresponding thereto. An instance of the constant symbol corresponding to the event is identified, and the instance of the constant symbol is replaced by a free variable to obtain an abstracted predicate. Thus, a quantified abstraction of the event is composed as a pair: the abstracted predicate and a mapping between the free variable and an instance of the constant symbol that corresponds to the predicate. A data mining algorithm is executed over abstracted, quantified events to ascertain a correlation between the event and another event.
Computer Sciences | Software Engineering
Software and Cyber-Physical Systems
David LO; RAMALINGAM, Ganesan; RANGANATH, Venkatesh-Prasad; and VASWANI, Kapil.
Abstracting Events for Data Mining. (2011). Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2976
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.