Foundations of Science 25 (4):1147-1171 (2020)

Discovery of temporal association patterns, temporal association rules from temporal databases is extensively studied by academic research community and applied in various industrial applications. Temporal association pattern discovery is extended to similarity based temporal association pattern discovery from time-stamped transaction datasets by researchers Yoo and Sashi Sekhar. They introduced methods for pruning through distance bounds, and have also introduced SEQUENTIAL and SPAMINE algorithms for pattern mining that are based on snapshot data scan and lattice data scan strategies respectively. Our previous research introduced algorithms G-SPAMINE, MASTER, Z-SPAMINE for time profiled association pattern discovery. These algorithms applied distance measures SRIHASS, ASTRA, and KRISHNA SUDARSANA for similarity computations. SEQUENTIAL, SPAMINE, G-SPAMINE, MASTER, Z-SPAMINE approaches are all based on snapshot and lattice database scan strategies and prunes temporal itemsets by making use of lower bound, upper bound support time sequences and upper-lower distance bound, lower bound distance values. The major limitation of all these algorithms is their inevitability to eliminate dataset scanning process for knowing true supports of itemsets and essential need to have dataset available in memory. To eliminate the requirement of retaining dataset in main memory, algorithms VRKSHA and GANDIVA are two pioneering research contributions that introduced tree structure for time profiled temporal association mining. VRKSHA is based on snapshot tree scan technique while GANDIVA is a lattice tree scan based approach. VRKSHA and GANDIVA both apply Euclidean distance function, but they do not estimate support and distance bounds. This research introduces the pioneering work ULTIMATE that uses a novel tree structure. The tree is generated using similarity measure ASTRA. ULTIMATE uses support bound and distance bound computations for pruning temporal patterns. Experiment results showed that ULTIMATE outperforms SEQUENTIAL, SPAMINE, G-SPAMINE, MASTER, VRKSHA, GANDIVA algorithms.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/s10699-019-09594-8
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,385
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Mining Calendar-Based Periodic Patterns From Nonbinary Transactions.Jhimli Adhikari - 2014 - Journal of Intelligent Systems 23 (3):277-291.
Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
Temporal Relations.D. S. BRÉE & R. A. SMIT - 1986 - Journal of Semantics 5 (4):345-384.
Branching-Time Logics Repeatedly Referring to States.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.


Added to PP index

Total views
5 ( #1,118,386 of 2,362,028 )

Recent downloads (6 months)
1 ( #553,136 of 2,362,028 )

How can I increase my downloads?


My notes