Discovering Surprising Instances of Simpson's Paradox in Hierarchical Multidimensional Data

Discovering Surprising Instances of Simpson's Paradox in Hierarchical Multidimensional Data

Carem C. Fabris (CPGEI, CEFET-PR, Brazil) and Alex A. Freitas (University of Kent, UK)
Copyright: © 2006 |Pages: 23
DOI: 10.4018/jdwm.2006010102
OnDemand PDF Download:
$37.50

Abstract

This paper focuses on the discovery of surprising unexpected patterns based on a data mining method that consists of detecting instances of Simpson’s paradox. By its very nature, instances of this paradox tend to be surprising to the user. Previous work in the literature has proposed an algorithm for discovering instances of that paradox, but it addressed only flat data stored in a single relation. This work proposes a novel algorithm that considerably extends that previous work by discovering instances of Simpson’s paradox in hierarchical multidimensional data — the kind of data typically found in data warehouse and OLAP environments. Hence, the proposed algorithm can be regarded as integrating the areas of data mining and data warehousing by using an adapted data mining technique to discover surprising patterns from data warehouse and OLAP environments.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2017): Forthcoming, Available for Pre-Order
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing