Computing Hierarchical Summary from Two-Dimensional Big Data Streams

• Published in: IEEE transactions on parallel and distributed systems 2018-04, Vol.29 (4), p.803-818
• Main Authors: Shah, Zubair, Mahmood, Abdun Naser, Barlow, Michael, Tari, Zahir, Xun Yi, Zomaya, Albert Y.
• Format: Article
• Language: English
• Subjects: Algorithm design and analysis; Algorithms; association rules; Computation; Correlation; Data management; Data mining; Data transmission; Domains; Footwear; frequent patterns; Hierarchical patterns; IP networks; Monitoring; Parameter estimation; Pattern analysis; Recommender systems; Semantics; Upper bounds
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2017.2778734

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 O(η/ϵ p ϵ s ) memory, where h is a small constant, and ϵ p ∈ [0,1], ϵ s ∈ [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.