Abstracting Events for Data Mining
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,...
Saved in:
Main Authors: | David LO, RAMALINGAM, Ganesan, RANGANATH, Venkatesh-Prasad, VASWANI, Kapil |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2976 https://ink.library.smu.edu.sg/context/sis_research/article/3976/viewcontent/US20110087700.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation
by: LO, David, et al.
Published: (2009) -
Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation
by: LO, David, et al.
Published: (2012) -
Data pre-processing for event data mining using Java
by: Chang, Lai Yan.
Published: (2010) -
Data Mining for Software Engineering
by: XIE, Tao, et al.
Published: (2009) -
Mining Software Specifications: Methodologies and Applications
by: David LO,, et al.
Published: (2011)