Mining undominated association rules through interestingness measures

International Journal on Artificial Intelligence Tools

Volumn 23, Issue 4, 2014, Pages

  Bouker, Slim ^a,b,c   Saidi, Rabie ^d   Ben Yahia, Sadok ^c,e   Mephu Nguifo, Engelbert ^a,b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITÉ BLAISE PASCAL   (France)

^c FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^d EUROPEAN BIOINFORMATICS INSTITUTE   (United Kingdom)

^e TELECOM SUDPARIS   (France)

Author keywords

Association rules; dominance relationship; interestingness measures

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BENCHMARK DATASETS; DOMINANCE RELATIONSHIPS; EVALUATION RESULTS; INTERESTINGNESS MEASURES; NON-TRIVIAL;

ASSOCIATION RULES;

EID: 84906834670     PISSN: 02182130     EISSN: 17936349     Source Type: Journal    
DOI: 10.1142/S0218213014600112     Document Type: Article

References (40)

1. R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, in Proc. of ACM SIGMOD (Washington, USA, 1993), pp. 207-216.
2. H. Manilla, Methods and problems in data mining, in Proc. of 6th ICDT, LNCS, Vol. 1186 (Springer-Verlag, Delphi, Greece, 1997), pp. 41-55.
3. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo, Finding interesting rules from large sets of discovered association rules, in Proc. of ACM CIKM (Gaithersburg, Maryland, USA, 1994), pp. 401-407.
4. O. Couturier, T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo, A scalable association rule visualization towards displaying large amounts of knowledge, in Proc. of Information Visualization Conf. (2007), pp. 657-663.
5. R. Hilderman and H. Hamilton, Measuring the interestingness of discovered knowledge: A principled approach, in Intelligent Data Analysis 7(4) (2003) 347-382.
6. P. N. Tan, V. Kumar, and J. Srivastava, Selecting the right interestingness measure for association patterns, in Proc. of 8th ACM KDD (Alberta, Canada, 2002), pp. 32-41.
7. B. Vaillant, F. Lenca, and S. Lallich, A clustering of interestingness measures, in Proc. of 7th ICDS (Padova, Italy, 2004), pp. 290-297.
8. E. Suzuki, Compression-based measures for mining interesting rules, in IEA/AIE (2009), pp. 741-746.
9. M. Ohsaki, Y. Sato, S. Kitaguchi, H. Yokoi, and T. Yamaguchi, Comparison between objective interestingness measures and real human interest in medical data mining, in Proc. of 17th IEA/AIE (Ottawa, Canada, 2004), pp. 1072-1081.
10. L. Geng and H. J. Hamilton, Choosing the right lens: Finding what is interesting in data mining, in Quality Measures in Data Mining, Vol. 43 (Springer, 2007), pp. 3-24.
11. J. Blanchard, F. Guillet, R. Gras, and H. Briand, Using information-theoretic measures to assess association rule interestingness, in Proc. of IEEE ICDM (Houston, Texas, USA, 2005), pp. 66-73.
12. M. Heravi and O. Zaiane, A study on interestingness measures for associative classifiers, in Proc. of ACM SAC (Sierre, Switzerland, 2010), pp. 1039-1046.
13. P. Lenca, P. Meyer, B. Vaillant, and S. Lallich, On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid" European Journal of Operational Research 184(2) (2008) 610-626.
14. M. Maddouri and J. Gammoudi, On semantic properties of interestigness measures for extracting rules from data, in Proc. of ICANNGA, Vol. 1 (Springer-Verlag, Warsaw, Poland, 2007), pp. 148-158.
15. R. Belohlávek, D. Grissa, S. Guillaume, E. Mephu Nguifo, and J. Outrata, Boolean factors as a means of clustering of interestingness measures of association rules, Annals of Mathematics and Artificial Intelligence (2013) 1-34.
16. S. Borzsony, D. Kossmann, and K. Stocker, The skyline operator, in Proc. of 17th ICDE (Heidelberg, Germany, 2001), pp. 421-430.
17. H. Kung, F. Luccio, and F. Preparata, On finding the maxima of a set of vectors, Journal of the ACM 22(4) (1975) 469-476.
18. n, in Inform. Process. Lett. 38(5) (1991) 227-278.
19. R. Steuer, Multiple Criteria Optimization: Theory, Computation and Application (John Wiley and Sons Publishers, 1986).
20. D. Kossmann, F. Ramsak, and S. Rost, Shooting stars in the sky: An online algorithm for skyline queries, in Proc. of VLDB (Hong Kong, China, 2002), pp. 275-286.
21. K. L. Tan, P. K. Eng, and B. C. Ooi, Efficient progressive skyline computation, in Proc. of VLDB (San Francisco, CA, USA, 2001), pp. 301-310.
22. M. J. Zaki, Mining non-redundant association rules, in Data Mining and Knowledge Discovery 9(3) (2004) 223-248.
23. S. Ben Yahia, T. Hamrouni, and E. Mephu Nguifo, Frequent closed itemset based algorithms: A thorough structural and analytical survey, in SIGKDD Explorations 8(1) (2006) 93-104.
24. S. Ben Yahia, G. Gasmi, E. Mephu Nguifo, A new generic basis of "factual" and "implicative" association rules, in Intell. Data Anal. 13(4)(2009) 633-656.
25. N. Lavrac, P. A. Flach, and B. Zupan, Rule evaluation measures: A unifying view, in Proc. of ILP (Bled, Slovenia, 1999), pp. 174-185.
26. J. Pearl, Probabilistic Reasoning in Intelligent Systems (Morgan Kaufmann Publishers Inc., 1988).
27. J. Loevinger, A systemic approach to the construction and evaluation of tests of ability, Psychological Monographs 61(4) (1947).
28. A. Soulet, C. Raissi, M. Plantevit, and B. Cremilleux, Mining dominant patterns in the sky, in Proc. of IEEE ICDM (Vancouver, Canada, 2011), pp. 655-664.
29. T. Zhang, Association rules, in Proc. of 4th PAKDD (Kyoto, Japan, 2000), pp. 245-256.
30. B. Jeudy and J.-F. Boulicaut, Constraint-based discovery and inductive queries: Application to Association Rule Mining, in Proc. of PKDD (London, UK, 2002), pp. 110-124.
31. J.-F. Boulicaut and B. Jeudy, Constraint-based data mining, in Data Mining and Knowledge Discovery Handbook (2010), pp. 339-354.
32. G. I. Webb, Filtered-top-k association discovery, in Data Mining and Knowledge Discovery 1(3) (2011) 183-192.
33. P. Fournier-Viger, C.-W. Wu, and V. S. Tseng, Mining top-k association rules, in Proc. of 25th Canadian Conf. on AI (Toronto, Canada, 2012), pp. 61-73.
34. A. N. Papadopoulos, A. Lyritsis, and Y. Manolopoulos, Skygraph: An algorithm for important subgraph discovery in relational graphs, in Data Mining and Knowledge Discovery 17(1) (2008) 57-76.
35. F. Pennerath and A. Napoli, The model of most informative patterns and its application to knowledge extraction from graph databases, in Proc. of ECML/PKDD (Bled, Slovenia, 2009), pp. 205-220.
36. M. Agier, J. M. Petit, and E. Suzuki, Unifying framework for rule semantics: Application to gene expression data, in Fundam. Inform. 78(4) (2007) 543-559.
37. G. Gasmi, S. Ben Yahia, E. Mephu Nguifo, and S. Bouker, Extraction of association rules based on literalsets, in Proc. of DaWaK (2007), pp. 293-302.
38. E. Suzuki and J. M. Zytkow, Unified algorithm for undirected discovery of execption rules, in PKDD (2000), pp. 169-180.
39. T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo, Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets, Data Knowl. Eng. 68(10) (2009) 1091-1111.
40. T. Hamrouni, S. Ben Yahia, and E. Mephu Nguifo, Generalization of association rules through disjunction, in Ann. Math. Artif. Intell. 59(2) (2010) 201-222.