Deriving non-redundant approximate association rules from hierarchical datasets

ABSTRACT

Association rule mining plays an important job in knowledge and information discovery. However, there are still shortcomings with the quality of the discovered rules and often the number of discovered rules is huge and contain redundancies, especially in the case of multi-level datasets. Previous work has shown that the mining of non-redundant rules is a promising approach to solving this problem, with work by [6,8,9,10] focusing on single level datasets. Recent work by Shaw et. al. [7] has extended the non-redundant approaches presented in [6,8,9] to include the elimination of redundant exact basis rules from multi-level datasets. Here we propose a continuation of the work in [7] that allows for the removal of hierarchically redundant approximate basis rules from multi-level datasets by using a dataset's hierarchy or taxonomy.

REFERENCES

• 1: Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
• 2: Jiawei Han , Yongjian Fu, Mining Multiple-Level Association Rules in Large Databases, IEEE Transactions on Knowledge and Data Engineering, v.11 n.5, p.798-805, September 1999 [doi>10.1109/69.806937]
• 3: T.-P. Hong, K.-Y. Lin & B.-C. Chien, 'Mining Fuzzy Multiple-Level Association Rules from Quantitative Data', Applied Intelligence, Vol 18, pp 79--90, Jan, 2003.
• 4: M. Kaya & R. Alhajj, 'Mining multi-cross-level fuzzy weighted association rules', in 2nd International IEEE Conference on Intelligent Systems, 2004, pp 225--230.
• 5: Bing Liu , Minqing Hu , Wynne Hsu, Multi-level organization and summarization of the discovered rules, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.208-217, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347128]
• 6: Nicolas Pasquier , Rafik Taouil , Yves Bastide , Gerd Stumme , Lotfi Lakhal, Generating a Condensed Representation for Association Rules, Journal of Intelligent Information Systems, v.24 n.1, p.29-60, January 2005 [doi>10.1007/s10844-005-0266-z]
• 7: G. Shaw, Y. Xu & S. Geva, 'Eliminating Redundant Association Rules in Multi-level Datasets', in Proceedings of the 4th International Conference on Data Mining (DMIN'08), 2008, Las Vegas, USA, To appear.
• 8: Y. Xu & Y. Li, 'Mining Non-Redundant Association Rules Based on Concise Bases', International Journal of Pattern Recognition and Artificial Intelligence, Vol 21, pp 659--675, Jun, 2007.
• 9: Yue Xu , Yuefeng Li, Generating concise association rules, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, November 06-10, 2007, Lisbon, Portugal [doi>10.1145/1321440.1321549]
• 10: Y. Xu, Y. Li & G. Shaw, 'Concise Representations for Approximate Association Rules', in Proceedings of the 2008 IEEE International Conference on Systems, Man & Cybernetics (SMC'08), 2008, Singapore, To appear.
• 11: Mohammed J. Zaki, Mining Non-Redundant Association Rules, Data Mining and Knowledge Discovery, v.9 n.3, p.223-248, November 2004 [doi>10.1023/B:DAMI.0000040429.96086.c7]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.8 Database applications
          Subjects: Data mining

General Terms:
Algorithms

Keywords:
multi-level datasets, redundant association rules