Optimized rule mining through a unified framework for interestingness measures

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

Volumn 4081 LNCS, Issue , 2006, Pages 238-247

  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

CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; EMBEDDED SYSTEMS; EXTRAPOLATION; OPTIMIZATION; PROBLEM SOLVING;

CLASSIFICATION RULES; EMBEDDED PATTERNS; MINIMAL FREQUENCY THRESHOLD;

DATA MINING;

EID: 33751354748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823728_23     Document Type: Conference Paper

References (19)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors, SIGMOD'93 Conference, pages 207-216. ACM Press, 1993.
2. J. R. J. Bayardo and R. Agrawal. Mining the most interesting rules. In KDD'99, pages 145-154, 1999.
3. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In J. Peckham, editor, SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pages 265-276. ACM Press, 1997.
4. B. Crémilleux and J.-F. Boulicaut. Simplest rules characterizing classes generated by delta-free sets. In 22nd Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence (ES'02), pages 33-46, Cambridge, UK, December 2002.
5. G. Dong and J. Li. Efficient mining of emerging patterns: discovering trends and differences. In proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD'99), pages 43-52, San Diego, CA, 1999. ACM Press.
6. D. Francisci and M. Collard. Multi-criteria evaluation of interesting dependencies according to a data mining approach. In Congress on Evolutionary Computation, pages 1568-1574, Canberra, Australia, 12 2003. IEEE Press,.
7. J. Fürnkranz and P. A. Flach. Roc 'n' rule learning-towards a better understanding of covering algorithms. Machine Learning, 58(1):39-77, 2005.
8. G. Hébert and B. Crémilleux. Obtention de règles optimisant un ensemble de mesures. In Conférence francophone sur l'apprentissage automatique (CAp'06), Trégastel, France, 2006.
9. R. J. Hilderman and H. J. Hamilton. Measuring the interestingness of discovered knowledge: A principled approach. Intell. Data Anal., 7(4):347-382, 2003.
10. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rules mining. In proceedings of Fourth International Conference on Knowledge Discovery & Data Mining (KDD'98), pages 80-86, New York, August 1998. AAAI Press.
11. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In proceedings of 7th International Conference on Database Theory (ICDT'99), volume 1331 of Lecture notes in artificial intelligence, pages 299-312, Jerusalem, Israel, 1999. Springer Verlag.
12. G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248. AAAI/MIT Press, 1991.
13. M. Plasse, N. Niang, G. Saporta, and L. Leblond. Une comparaison de certains indices de pertinence des règles d'association. In G. Ritschard and C. Djeraba, editors, EGC, volume RNTI-E-6 of Revue des Nouvelles Technologies de l'Information, pages 561-568. Cépaduès- Éditions, 2006.
14. M. Sebag and M. Schoenauer. Generation of rules with certainty and con dence factors from incomplete and incoherent learning bases. In M. L. J. Boose, B. Gaines, editor, European Knowledge Acquisistion Workshop, EKAW'88, pages 28-1-28-20, 1988.
15. P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In KDD, pages 32-41. ACM, 2002.
16. B. Vaillant, P. Lenca, and S. Lallich. A clustering of interestingness measures. In The 7th International Conference on Discovery Science, pages 290-297, 10 2004.
17. B. Vaillant, P. Meyer, E. Prudhomme, S. Lallich, P. Lenca, and S. Bigaret. Mesurer l'intérêt des règles d'association. In EGC, pages 421-426, 2005.
18. R. Wille. Ordered sets, chapter Restructuring lattice theory: an approach based on hierachies of concepts, pages 445-470. Reidel, Dordrecht, 1982.
19. M. J. Zaki. Generating non-redundant association rules. In KDD'00, pages 34-43, 2000.