Mining fuzzy temporal patterns from process instances with weighted temporal graphs
This paper presents an algorithm for mining fuzzy temporal patterns from a given process instance. The fuzzy representation of time intervals embedded between the activities is used for this purpose. Initially, the activities are portrayed with their temporal relationships through temporal graphs and then, the defined data structures are used to retrieve the data suitable for the proposed algorithm. Similar to the familiar k-itemsets and k-dim sequences, their counterparts are introduced in this work. The proposed process-instance level data structure generates an optimum number of temporal itemsets. The proposed algorithm differs from the other existing algorithms on this topic in the representation of the mined data and patterns. An example is provided to demonstrate the algorithm.
Volume (Year): 1 (2008)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=282|
When requesting a correction, please mention this item's handle: RePEc:ids:injdan:v:1:y:2008:i:1:p:60-77. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.