A unified view of objective interestingness measures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4571 LNAI, Issue , 2007, Pages 533-547

  Hébert, Céline ^a   Crémilleux, Bruno ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; EMBEDDED SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

ASSOCIATION RULE MINING; CONFLICTING INFORMATION; RULES OPTIMIZING;

DATA MINING;

EID: 37249066652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73499-4_40     Document Type: Conference Paper

References (22)

1. Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) SIGMOD'93 Conference, pp. 207-216. ACM Press, New York (1993)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocea, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, September 12-15, 1994, pp. 487-499. Morgan Kaufmann, San Francisco (1994)
3. Bayardo, J.R.J., Agrawal, R.: Mining the most interesting rules, In: KDD'99, pp. 145-154 (1999)
4. Blanchard, J., Guillet, F., Briand, H.: A user-driven and quality-oriented visualization for mining association rules. In: the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 493-496. IEEE Computer Society Press, Los Alamitos (2003)
5. Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Zighed, D.A., Komorowski, H.J., Zytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 75-85. Springer, Heidelberg (2000)
6. Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Peckham, J. (ed.) SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, USA, May 13-15, 1997, pp. 265-276. ACM Press, New York (1997)
7. Francisci, D., Collard, M.: Multi-criteria evaluation of interesting dependencies according to a data mining approach. In: Congress on Evolutionary Computar tion, Canberra, Australia, 12, pp. 1568-1574. IEEE Computer Society Press, Los Alamitos (2003)
8. Fürnkranz, J., Flach, P.A.: Roc 'n' rule learning-towards a better understanding of covering algorithms. Machine Learning 58(1), 39-77 (2005)
9. Gasmi, G., Yahia, S.B., Nguifo, E.M., Slimani, Y.: Igb: A new informative generic base of association rules. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 81-90. Springer, Heidelberg (2005)
10. Hilderman, R.J., Hamilton, H.J.: Measuring the interestingness of discovered knowledge: A principled approach. Intell. Data Anal. 7(4), 347-382 (2003)
11. Hirano, S., Tsumoto, S.: Guide to the hepatitis data. In: ECML/PKDD'05 Discovery Challenge on hepatitis data co-located with the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'05), Porto, Portugal, October 2005, pp. 120-124 (2005)
12. Hebert, C., Crémilleux, B.: Optimized rule mining through a unified framework for interestingness measures. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol. 4081, pp. 238-247. Springer, Heidelberg (2006)
13. Kryszkiewicz, M.: Concise representations of association rules. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol. 2447, pp. 92-109. Springer, Heidelberg (2002)
14. Lavrac, N., Flach, P., Zupan, B.: Rule evaluation measures: a unifying view. In: Džeroski, S., Flach, P.A. (eds.) Inductive Logic Programming. LNCS (LNAI), vol. 1634, pp. 174-185. Springer, Heidelberg (1999)
15. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 299-312. Springer, Heidelberg (1998)
16. Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229-248. AAAI/MIT Press, Cambridge (1991)
17. Piasse, M., Niang, N., Saporta, G., Leblond, L.: Une comparaison de certains indices de pertinence des règles d'association. In: Ritschard, G., Djeraba, C (eds.) EGC Revue des Nouvelles Technologies de l'Information, vol. RNTI-E-6, pp. 561-568. Cépaduès-Éditions (2006)
18. Sebag, M., Schoenauer, M.: Generation of rules with certainty and confidence factors from incomplete and incoherent learning bases. In: Boose, M. L. J., Gaines, B. (eds.)European Knowledge Acquisistion Workshop, EKAW'88, pages 28-1-28-20 (1988)
19. Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: KDD, pp. 32-41. ACM, New York (2002)
20. Vaillant, B., Lenca, P., Lallich, S.: A clustering of interestingness measures. In: The 7th International Conference on Discovery Science, 10, 2004, pp. 290-297 (2004)
21. Wille, R.: chapter Restructuring lattice theory: an approach based on hierachies of concepts. In: Ordered sets, pp. 445-470. Reidel, Dordrecht (1982)
22. Zaki, M.J.: Generating non-redundant association rules. In: KDD'00, pp. 34-43 (2000)