Title: Mining frequent arrangements and sequencing of events for diseases prognosis using reference event-based temporal relations

Authors: V. Uma; G. Aghila

Addresses: Department of Computer Science, School of Engineering and Technology, Pondicherry University, Puducherry, India ' Department of Computer Science and Engineering, NIT Puducherry, Karaikal, India

Abstract: Mining temporal patterns has been an active research area in AI. Mining patterns of temporally correlated events called arrangements is required in many scientific domains, especially in the medical domain. Key events of the domain defined as reference events are used in describing the arrangements. In this work, mining events in arrangements (MENSA) algorithm is proposed to mine frequent arrangements and to generate sequential rules that can be used in early forecasting of probable diseases and symptoms and hence facilitate decision support related tasks. The MENSA algorithm has excellent scale-up property with respect to the size of the sequences. Temporal relations between events are defined using the contextual reference event-based temporal (REseT) relations. These relations can provide more useful knowledge about the order of events within an arrangement in comparison with Allen's relations and the effectiveness, applicability of these relations in prognosis is demonstrated using PREDICT algorithm with Percent_Similarity as the performance measure. The performance of the proposed algorithms is evaluated and they outperform other existing approaches when experimented on real finance dataset and synthetic medical dataset.

Keywords: temporal data mining; temporal patterns; sequential pattern mining; Allen interval relations; reference event; sequential rules; linear ordering; prognosis; event ordering; knowledge representation; interval relations; frequent arrangements; disease prognosis; diseases; medical symptoms; disease forecasting; healthcare technology.

DOI: 10.1504/IJICT.2016.077680

International Journal of Information and Communication Technology, 2016 Vol.9 No.1, pp.17 - 42

Received: 31 Jul 2013
Accepted: 20 Apr 2014

Published online: 13 Jul 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article