High performance framework for mining association rules from hierarchical data cubes
Ahmad Taleb, Asadullah Shaikh, Todd Eavis, Nasser Taleb · International Journal of Business Intelligence and Data Mining · 2015
Online analytical processing (OLAP) is considered as a database prototype that gives a platform for the rich analysis of multidimensional data. A logical data structure known as the data cube often supports the OLAP. However, mining association rules from multidimensional data using OLAP techniques with data mining facilities is an issue of substantial complexity. In practice, the complexity is excited by the existence of dimension hierarchies that subdivide dimensions into aggregation layers of various granularity. Discovery of hierarchy-sensitive association rules can be very costly on large cubes. In this paper, we present an OLAP hierarchy-sensitive framework that supports the efficient and transparent manipulation of dimension hierarchies for extracting association rules from data cube. The experimental results show that, when compared to the alternatives, very slight overhead is required to handle streams of inter-dimensional association rules requests.