IDEAS home Printed from https://ideas.repec.org/a/igg/jdwm00/v2y2006i4p27-48.html
   My bibliography  Save this article

Navigation Rules for Exploring Large Multidimensional Data Cubes

Author

Listed:
  • Navin Kumar

    (University of Maryland, Baltimore County, USA)

  • Aryya Gangopadhyay

    (University of Maryland, Baltimore County, USA)

  • George Karabatis

    (University of Maryland, Baltimore County, USA)

  • Sanjay Bapna

    (Morgan State University, USA)

  • Zhiyuan Chen

    (University of Maryland, Baltimore County, USA)

Abstract

Navigating through multidimensional data cubes is a nontrivial task. Although On-Line Analytical Processing (OLAP) provides the capability to view multidimensional data through rollup, drill-down, and slicing-dicing, it offers minimal guidance to end users in the actual knowledge discovery process. In this article, we address this knowledge discovery problem by identifying novel and useful patterns concealed in multidimensional data that are used for effective exploration of data cubes. We present an algorithm for the DIscovery of Sk-NAvigation Rules (DISNAR), which discovers the hidden interesting patterns in the form of Sk-navigation rules using a test of skewness on the pairs of the current and its candidate drill-down lattice nodes. The rules then are used to enhance navigational capabilities, as illustrated by our rule-driven system. Extensive experimental analysis shows that the DISNAR algorithm discovers the interesting patterns with a high recall and precision with small execution time and low space overhead.

Suggested Citation

  • Navin Kumar & Aryya Gangopadhyay & George Karabatis & Sanjay Bapna & Zhiyuan Chen, 2006. "Navigation Rules for Exploring Large Multidimensional Data Cubes," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 2(4), pages 27-48, October.
    • Handle: RePEc:igg:jdwm00:v:2:y:2006:i:4:p:27-48
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdwm.2006100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdwm00:v:2:y:2006:i:4:p:27-48. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.