On the robustness of association rules

2006 IEEE Conference on Cybernetics and Intelligent Systems

Volumn , Issue , 2006, Pages

  Lenca, Philippe ^a   Vaillant, Benoît ^b   Lallich, Stéphane ^c  

^a ECOLE DES MINES DE NANTES   (France)

^b UNIVERSITÉ BRETAGNE SUD   (France)

^c UNIVERSITÉ LUMIÈRE LYON 2   (France)

Author keywords

Association rules; Robustness

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; ROBUSTNESS (CONTROL SYSTEMS); CYBERNETICS; INTELLIGENT SYSTEMS; QUALITY CONTROL;

ASSOCIATION RULES DISCOVERY; INTERESTINGNESS MEASURES;

ASSOCIATION RULES;

ASSOCIATION RULES DISCOVERY; DECISION AIDING; INTERESTINGNESS; INTERESTINGNESS MEASURES; KNOWLEDGE DISCOVERY IN DATA BASIS; NUMERICAL INFORMATION; OBJECTIVE MEASURE; THRESHOLD SENSITIVITY;

EID: 84894214243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIS.2006.252282     Document Type: Conference Paper

References (33)

1. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, P. Buneman and S. Jajodia, Eds., Washington, D.C., 1993, pp. 207-216.
2. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proceedings of the 20th Very Large Data Bases Conference, J. B. Bocca, M. Jarke, and C. Zaniolo, Eds. Morgan Kaufmann, 1994, pp. 487-499.
3. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, Advances in knowledge discovery and data mining. AAAI, 1996, ch. Fast discovery of association rules, pp. 307-328.
4. H. Toivonen, "Sampling large databases for association rules," in In Proc. 1996 Int. Conf. Very Large Data Bases, T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, Eds. Morgan Kaufman, 1996, pp. 134-145.
5. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, "Dynamic itemset counting and implication rules for market basket data," in SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, USA, J. Peckham, Ed. ACM Press, 05 1997, pp. 255-264.
6. D.-I. Lin and Z. M. Kedem, "Pincer Search: A new algorithm for discovering the maximum frequent set," in Proceedings of the 6th International Conference on Extending Database Technology, ser. Lecture Notes in Computer Science, H.-J. Schek, F. Saltor, I. Ramos, and G. Alonso, Eds., vol. 1377. Springer-Verlag, 1998, pp. 105-119.
7. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering frequent closed itemsets for association rules," in Database Theory - ICDT '99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings, ser. Lecture Notes in Computer Science, C. Beeri and P. Buneman, Eds., vol. 1540. Springer, 1999, pp. 398-416.
8. T. Brijs, K. Vanhoof, and G. Wets, "Defining interestingness for association rules," International journal of information theories and applications, vol. 10, no. 4, pp. 370-376, 2003.
9. G. Piatetsky-Shapiro, "Discovery, analysis and presentation of strong rules," in Knowledge Discovery in Databases, G. Piatetsky-Shapiro and W. Frawley, Eds. AAAI/MIT Press, 1991, pp. 229-248.
10. A. Silberschatz and A. Tuzhilin, "What makes patterns interesting in knowledge discovery systems," IEEE Transactions On Knowledge And Data Engineering, vol. 8, no. 6, pp. 970-974, 1996.
11. A. Freitas, "On rule interestingness measures," Knowledge-Based Systems journal, pp. 309-315, 1999.
12. P. Lenca, P. Meyer, B. Vaillant, and P. Picouet, "Aide multicritère à la décision pour évaluer les indices de qualité des connaissances - modélisation des préférences de l'utilisateur," RSTI-RIA (EGC 2003), vol. 1, no. 17, pp. 271-282, 2003.
13. R. J. Bayardo and R. Agrawal, "Mining the most interesting rules," in KDD 1999, Proceedings ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, august 1999, pp. 145-154.
14. N. Lavrac, P. Flach, and B. Zupan, "Rule evaluation measures: A unifying view," in Ninth International Workshop on Inductive Logic Programming (ILP'99), LNAI 1634, S. Dzeroski and P. Flach, Eds. Springer-Verlag, June 1999, pp. 174-185.
15. R. Hilderman and H. Hamilton, "Applying objective interestingness measures in data mining systems," in In Fourth European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD'2000). Springer Verlag, 2000, pp. 432-439.
16. P.-N. Tan and V. Kumar, "Interestingness measures for association patterns: A perspective," University of Minnesota, Department of Computer Science, Tech. Rep. TROO-036, 2000.
17. R. Hilderman and H. Hamilton, "Evaluation of interestingness measures for ranking discovered knowledge," in In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'01). Springer Verlag, 2001, pp. 247-259.
18. R. J. Hilderman and H. J. Hamilton, Knowledge Discovery and Measures of Interest. Kluwer Academic Publishers, 2001.
19. R. Hilderman and H. Hamilton, "Measuring the interestingness of discovered knowledge: A principled approach," Intelligent Data Analysis, vol. 7, no. 4, pp. 347-382, 2003.
20. S. Lallich and O. Teytaud, "Évaluation et validation de l'intérêt des règles d'association," Revue des Nouvelles Technologies de l'Information (Mesures de Qualité pour la Fouille de Données), no. RNTI-E-1, pp. 193-217, 2004.
21. P. Lenca, P. Meyer, B. Vaillant, P. Picouet, and S. Lallich, "Évaluation et analyse multicritère des mesures de qualité des règles d'association," Revue des Nouvelles Technologies de l'Information (Mesures de Qualité pour la Fouille de Données), no. RNTI-E-1, pp. 219-246, 2004.
22. P. Lenca, P. Meyer, B. Vaillant, and S. Lallich, "A multicriteria decision aid for interestingness measure selection," Département LUSSI, ENST Bretagne, Technical Report LUSS1-TR-2004-01-EN, 2004.
23. B. Vaillant, P. Lenca, and S. Lallich, "A clustering of interestingness measures," in Discovery Science, ser. Lecture Notes in Artificial Intelligence, vol. 3245. Springer-Verlag, 2004, pp. 290-297.
24. P.-N. Tan, V. Kumar, and J. Srivastava, "Selecting the right interestingness measure for association patterns," in Proceedings of the Eighth ACM SIGKDD International Conference on KDD, 2002, pp. 32-41.
25. J.-G. Ganascia, "Charade: A rule system learning system," in 10th IJCAI, Milan, 1987.
26. P. Jaccard, "Nouvelles recherches sur la distribution florale," Bulletin Society Vaud Science National, no. 44, pp. 223-270, 1908.
27. I. J. Good, "The estimation of probabilities: An essay on modern bayesian methods," The MIT Press, Cambridge, MA, 1965.
28. J. Azé and Y. Kodratoff, "Evaluation de la résistance au bruit de quelques mesures d'extraction de règles d'assocation," Extraction des connaissances et apprentissage (EGC 2002), vol. 1, no. 4, pp. 143-154, 2002.
29. S. Brin, R. Motwani, and C. Silverstein, "Beyond market baskets: generalizing association rules to correlations," in ACM SIGMOD/PODS '97 Joint Conference, 1997, pp. 265-276.
30. J. Loevinger, "A systemic approach to the construction and evaluation of tests of ability," Psychological monographs, vol. 61, no. 4, 1947.
31. M. Sebag and M. Schoenauer, "Generation of rules with certainty and confidence factors from incomplete and incoherent learning bases," in Proc. of the European Knowledge Acquisition Workshop (EKAW'88), J. Boose, B. Gaines, and M. Linster, Eds. Gesellschaft für Mathematik und Datenverarbeitung mbH, 1988, pp. 28-1 - 28-20.
32. S. Lallich, B. Vaillant, and P. Lenca, "Parametrised measures for the evaluation of association rule interestingness," in The XIth International Symposium on Applied Stochastic Models and Data Analysis, Brest, France, May 2005, pp. 220-229.
33. J. Blanchard, F. Guillet, H. Briand, and R. Gras, "IPEE: Indice probabiliste décart à l'équilibre pour l'évaluation de la qualité des règles," in Atelier Qualité des Données et des Connaissances (EGC 2005), 2005, pp. 26-34.