English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70585/70585 (100%)
Visitors : 23295701      Online Users : 476
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51869

    Title: Techniques for finding similarity knowledge in OLAP reports
    Authors: Hsu,KC;Li,MZ
    Contributors: 資訊管理學系
    Date: 2011
    Issue Date: 2012-03-27 19:08:00 (UTC+8)
    Publisher: 國立中央大學
    Abstract: On-line analytical processing (OLAP) is a common solution that modern enterprises use to generate, monitor, share, and administrate their analysis reports. When daily, weekly, and/or monthly reports are generated or published by the OLAP operators, all analyses on the contents of reports are left for the report readers. To discover hidden rules, similar reports, or trend inside the potentially huge amount of reports, the report readers can only rely on their smart eyes to find out any rules of such kinds. Data mining is a well-developed field for finding hidden rules inside the data itself. However, there are few techniques focus on finding hidden rules, similarity, or trend using OLAP reports as the unit of analysis. In this paper, we explore how to use data mining techniques on OLAP reports in order to automatically and effectively find the similarity knowledge of OLAP reports. We also address the appropriate presentation of this similarity knowledge to OLAP users. We compare the difference between traditional data mining and finding similarity knowledge from OLAP reports. We then proposed three methods (called OLAP_MDS, OLAP_CLU, and OLAP_M+C in this paper) to explore the effectiveness of discovering similarity knowledge from OLAP reports. Finally, we compare the pros and cons of the proposed three methods with experiments and conclude that the OLAP_M+C method should be the best in most cases. (C) 2010 Elsevier Ltd. All rights reserved.
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明