GANDIVA: Temporal Pattern Tree for Similarity Profiled Association Mining

GANDIVA: Temporal Pattern Tree for Similarity Profiled Association Mining

Vangipuram Radhakrishna (VNR Vignana Jyothi Institute of Engineering and Technology, Hyderabad, India), Puligadda Veereswara Kumar (Acharya Institute of Technology, Bangalore, India) and Vinjamuri Janaki (Vaagdevi College of Engineering, Warangal, India)
DOI: 10.4018/IJITWE.2019100101

Abstract

In this research, the authors propose a novel tree structure called GANDIVA which computes true supports of all temporal itemsets by performing a tree-based scan and eliminating the database scan which is required for SPAMINE, G-SPAMINE, MASTER, and Z-SPAMINE approaches. The idea is to construct the tree called GANDIVA which determines support of all time-stamped temporal itemsets from the constructed tree. Another important advantage of the proposed approach is that it does not require the original database to be retained in the memory after a time profiled pattern tree (GANDIVA) is constructed from the original database. The significant advantage of GANDIVA over SPAMINE, G-SPAMINE, Z-SPAMINE, and MASTER is that GANDIVA requires zero database scans after the tree construction. GANDIVA is the pioneering research to propose a novel tree-based framework for seasonal temporal data mining.
Article Preview
Top

1. Introduction

Data mining deals with the discovery of useful data patterns from enormous, massive amounts of data (Nong, 2013). Data patterns discovered by applying data mining algorithms can be classified into six major types. These include a) prediction and classification patterns b) data reduction patterns c) cluster patterns d) association patterns e) anomaly patterns f) sequential and temporal patterns. Research on temporal patterns is gaining massive importance and is quickly emerging with various important applications associated with the discovery of temporal patterns. Time profiled temporal pattern mining has various applications ranging from financial analysis to healthcare. Determining and unearthing similar temporal patterns in time-stamped temporal databases is a complex and challenging task (Y. C. Chen, 2015) (Y. C. Chen, 2016). The pioneering research (Soung, 2008) (Soung, 2009) (Soung, 2012) addressed retrieval and discovery of similar temporal association patterns by introducing support estimation and pruning approaches to reduce support computations and minimize computational complexity. However, the approach to overcome the necessity of maintaining the temporal database in the memory is not addressed till today (Shadi, 2018) (Vangipuram, 2018). Also, research by (Soung, 2008) (Soung, 2009) (Soung, 2012) did not address new distance measures for time profiled association mining. Some of the previous studies (Vangipuram, 2015) (Vangipuram, 2016) (Vangipuram, 2017) (Vangipuram, 2018) addressed new distance measures SRIHASS (used in Z-SPAMINE), ASTRA (used in MASTER), and G-SPAMINE (Shadi, 2017) that uses fuzzy distance measure. The major limitation of all the above-mentioned approaches is the inevitable requirement for the database to be present in the main memory. The research embodied in this paper aims to address “…the possibility of eliminating the need for original database retention in the main memory…” Our approach has the major advantage that the original database need not be present in the memory for future computation process. To the best of our knowledge, there is no research till date w.r.t similarity profiled temporal association mining that has proposed a tree-based approach that performed the lattice-based scan. Thus, our approach is the pioneering work in this direction. We propose a new tree structure called “GANDIVA - TIME PROFILED TEMPORAL PATTERN TREE” which eliminates the huge computational overhead involved in finding supports of itemsets.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 15: 4 Issues (2020): 1 Released, 3 Forthcoming
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing