• Article
  • | |
  • Metrics
  • |
  • Reference [12]
  • |
  • Related [20]
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    Data exceptions often reflect potential problems or dangers in the management of corporation. Analysts often need to identify these exceptions from large amount of data. A recent proposed approach automatically detects and marks the exceptions for the user and reduces the reliance on manual discovery. However, the efficiency and scalability of this method are not so satisfying. According to these disadvantages, the optimizations are investigated to improve it. A new method that pushes several constraints into the mining process is proposed in this paper. By enforcing several user-defined constraints, this method first restricts the multidimensional space to a small constrained-cube and then mines exceptions on it. Experimental results show that this method is efficient and scalable.

    Reference
    [1]Han J, Chee S, Chiang J. Issues for on-line analytical mining of data warehouses. In: Haas L, Tiwary A, eds. Proceedings of the SIGMOD'98 Workshop on Research Issues on Data Mining and Knowledge Discovery. Seattle: ACM Press, 1998. 2:1~2:5.
    [2]Sarawagi S, Agrawal R, Megiddo N. Discovery-Driven exploration of OLAP data cubes. In: Schek H, Saltor F, Ramos I, Alonso G, eds. Proceedings of the 6th International Conference on Extending Database Technology. Valencia: Springer-Verlag, 1998. 168~182.
    [3]Harinarayan V, Rajaraman A, Ullman J. Implementing data cubes efficiently. In: Jagadish H, Mumick I, eds. Proceedings of the ACM-SIGMOD International Conference on Management of Data. Montreal: ACM Press, 1996. 205~216.
    [4]Liang W, Orlowska ME, Yu JX. Optimizing multiple dimensional queries simultaneously in multidimensional databases. VLDB Journal, 2000,8(3-4):319~338.
    [5]http://www.olapcouncil.org/research/APB1R2_spec.pdf. 1998.
    [6]Srikant R, Vu Q, Agrawal R. Mining association rules with item constraints. In: Heckerman D, Mannila H, Pregibon D, eds. Proceedings of the 1997 International Conference on Data Mining and Knowledge Discovery. AAAI Press, 1997. 67~73.
    [7]Bayardo R, Agrawal R, Gunopulos D. Constraint-Based rule mining on large, dense data sets. In: Papazoglou M, ed. Proceedings of the 1999 International Conference on Data Engineering. Sydney: IEEE Computer Society, 1999. 188~197.
    [8]Klemettinen M, Mannila P, Ronkainen P. Finding interesting rules from large sets of discovered association rules. In: Nicholas C, Mayfield J, eds. Proceedings of the 3rd International Conference on Information and Knowledge Management. ACM Press, 1994. 401~407.
    [9]Imielinski T, Khachiyan L, Abdulghani A. Cubegrades: Generalizing association rules. Data Mining and Knowledge Discovery, 2002,6(3):219~257.
    [10]Sarawagi S. Explaining differences in multidimensional aggregates. In: Brodie M, ed. Proceedings of the 25th International Conference on Very Large Databases. Edinburgh: Morgan Kaufmann Publishers, 1999. 42~53.
    [11]Sarawagi S. User-Adaptive exploration of multidimensional data. In: Whang K, ed. Proceedings of the 26th International Conference on Very Large Databases. Cairo: Morgan Kaufmann Publishers, 2000. 307~316.
    [12]Sathe G, Sarawagi S. Intelligent rollups in multidimensional OLAP data. In: Snodgrass R, ed. Proceedings of the 27th International Conference on Very Large Databases. Roma: Morgan Kaufmann Publishers, 2001. 531~540.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

李翠平,李盛恩,王珊,杜小勇.一种基于约束的多维数据异常点挖掘方法.软件学报,2003,14(9):1571-1577

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 22,2002
  • Revised:December 04,2002
You are the first2044989Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063