A data mining approach to knowledge discovery from multidimensional cube structures

Usman, M., Pears, R. and Fong, A.C.M. (2013) A data mining approach to knowledge discovery from multidimensional cube structures. Knowledge-Based Systems, 40, pp. 36-49. (doi: 10.1016/j.knosys.2012.11.008)

Full text not currently available from Enlighten.

Abstract

In this research we present a novel methodology for the discovery of cubes of interest in large multi-dimensional datasets. Unlike previous research in this area, our approach does not rely on the availability of specialized domain knowledge and instead makes use of robust methods of data reduction such as Principal Component Analysis and Multiple Correspondence Analysis to identify a small subset of numeric and nominal variables that are responsible for capturing the greatest degree of variation in the data and are thus used in generating cubes of interest. Hierarchical clustering was integrated with the use of data reduction in order to gain insights into the dynamics of relationships between variables of interests at different levels of data abstraction. The two case studies that were conducted on two real word datasets revealed that the methodology was able to capture regions of interest that were significant from both the application and statistical perspectives.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Fong, Dr Alvis Cheuk Min
Authors: Usman, M., Pears, R., and Fong, A.C.M.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Knowledge-Based Systems
Publisher:Elsevier
ISSN:0950-7051

University Staff: Request a correction | Enlighten Editors: Update this record