Computing hierarchical summary from two-dimensional big data streams

Shah, Z, Mahmood, A, Barlow, M, Tari, Z, Yi, X and Zomaya, A 2018, 'Computing hierarchical summary from two-dimensional big data streams', IEEE Transactions on Parallel and Distributed Systems, vol. 29, no. 4, pp. 803-818.

Document type: Journal Article
Collection: Journal Articles

Title Computing hierarchical summary from two-dimensional big data streams
Author(s) Shah, Z
Mahmood, A
Barlow, M
Tari, Z
Yi, X
Zomaya, A
Year 2018
Journal name IEEE Transactions on Parallel and Distributed Systems
Volume number 29
Issue number 4
Start page 803
End page 818
Total pages 16
Publisher IEEE
Abstract There are many application domains, where hierarchical data is inherent, but surprisingly, there are few techniques for mining patterns from such important data. Hierarchical Heavy Hitters (HHH) and multilevel and Cross-Level Association Rules (CLAR) mining are well-known hierarchical pattern mining techniques. The problem in these techniques; however, is that they focus on capturing only global patterns from data but cannot identify local contextual patterns. Another problem in these techniques is that they treat all data items in the transaction equally and do not consider the sequential nature of the relationship among items within a transaction; hence, they cannot capture the correlation semantic within the transactions of the data items. There are many applications such as clickstream mining, healthcare data mining, network monitoring, and recommender systems, which require to identify local contextual patterns and correlation semantics. In this work, we introduce a new concept, which can capture the sequential nature of the relationship between pairs of hierarchical items at multiple concept levels and can capture local contextual patterns within the context of the global patterns. We call this notion Hierarchically Correlated Heavy Hitters (HCHH). Specifically, the proposed approach finds the correlation between items corresponding to hierarchically discounted frequency counts. We have provided formal definitions of the proposed concept and developed algorithmic approaches for computing HCHH in data streams efficiently. The proposed HCHH algorithm have deterministic error guarantees, and space bounds. It requires epsilon memory, where is a small constant, and [0,1], [0,1] are user defined parameters on upper bounds of estimation error. We have compared the proposed HCHH concept with existing hierarchical pattern mining approaches both theoretically as well as experimentally. © 1990-2012 IEEE.
Subject Distributed and Grid Systems
Keyword(s) association rules
frequent patterns
Hierarchical patterns
DOI - identifier 10.1109/TPDS.2017.2778734
Copyright notice © 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
ISSN 1045-9219
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 52 Abstract Views  -  Detailed Statistics
Created: Tue, 23 Oct 2018, 16:00:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us