, Ces propriétés se présentent sous la forme de prédicats et sont intégrables dans un algorithme générique d'élagage du bas vers le haut (le prédicat est un paramètre de l'algorithme), dans la même veine que l'algorithme Apriori. Ces prédicats d'élagage nous permettent principalement d'extraire des bases de données les règles intéressantes sans aucune contrainte de support. L'ensemble de règles obtenu est complet et suffisamment fin pour que le travail nécessaire à le rendre minimal soit raisonnable, contrairement aux approches actuelles pour lesquelles il est nécessaire de rechercher l'ensemble des motifs pour avoir accès à l'ensemble des règles, Nous venons d'énoncer un ensemble de propriétés d'élagage pour différentes mesure d'intérêt

;. C. Bibliographie, . S. Aggarwal-&-p, and . Yu, A new framework for itemset generation, 98 ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, p.27, 1998.

R. Agrawal-&-r and . Srikant, Fast Algorithms for Mining Association Rules in Large Databases, 20th International Conference on Very Large Data Bases, vol.7, p.10, 1994.

R. Agrawal, T. Imieliski, and &. Swami, Mining association rules between sets of items in large databases, ACM SIGMOD International Conference on Management of Data, vol.7, p.28, 1993.

, UCI Machine Learning Repository, p.53, 2007.

J. Azé and &. Kodratoff, Evaluation de la résistance au bruit de quelques mesures d'extraction de règles d'association, -4 of Extraction des Connaissances et Apprentissage, vol.1, p.49, 2002.

J. Azé and &. Kodratoff, Extraction de "pépites" de connaissance dans les données : une nouvelle approche et une étude de la sensibilité au bruit. numéro spécial RNTI-2 Mesures de qualité pour la fouille de données, vol.1, pp.247-270, 2004.

J. Azé, S. Guillaume, and &. Castagliola, Evaluation de la résistance au bruit de quelques mesures quantitatives. n o spécial RNTI Entreposage et fouille de données, vol.1, p.49, 2003.

J. Azé, P. Lenca, S. Lallich, and &. Vaillant, A study of the robustness of association rules, The 2007 International Conference on Data Mining, p.47, 2007.

E. Bahri and &. S. Lallich, FCP-Growth : Class Itemsets for Class Association Rules, Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, 2009.

J. L. Balcázar, Mining Educational Data for Patterns With Negations and High Confidence Boost, conjunction with the 13th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.329-338, 2009.

S. L. Ibergarceta-publicaciones, ;. Madrid, A. Barthélemy, P. Legrain, &. Lenca et al., Aggregation of Valued Relations Applied to Association Rule Interestingness Measures, editeurs, 3rd International Conference on Modeling Decisions for Artificial Intelligence, vol.3885, pp.203-214, 1930.

R. J. Bayardo-&-r.-agrawal-;-r, R. Bayardo, &. Agrawal, ;. Gunopulos, &. Benjamini et al., A step-down multiple hypotheses testing procedure that controls the false discovery rate under independence, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol.32, p.12, 1999.

F. Bonchi and &. Lucchese, Pushing Tougher Constraints in Frequent Pattern Mining, editeurs, 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, vol.3518, p.76, 2005.

C. Borgelt and &. Kruse, Free-Sets : A Condensed Representation of Boolean Data for the Approximation of Frequency Queries, 1st Workshop on Frequent Item Set Mining Implementations, vol.17, p.17, 2002.

. Bibliographie-[brin, Beyond Market Baskets : Generalizing Association Rules to Correlations, ACM SIGMOD International Conference on Management of Data, vol.26, p.28, 1997.

S. Brin, R. Motwani, J. D. Ullman, and &. S. Tsur, Dynamic itemset counting and implication rules for market basket data, ACM SIGMOD International Conference on Management of Data, p.27, 1997.

M. Cadot, A Randomization Test for extracting Robust Association Rules, Computational Statistics & Data Analysis, p.47, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00337069

K. W. Church and &. Hanks, Word association norms, mutual information, and lexicography, Computational Linguistics, vol.16, issue.1, p.27, 1990.

C. W. Cleverdon, J. Mills, and &. Keen, Factors determining the performance of indexing systems, ASLIB Cranfield project, vol.27, p.28, 1966.

E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk et al., Finding Interesting Associations without Support Pruning, IEEE Transaction on Knowledge and Data Engineering, vol.13, issue.1, p.75, 2001.

J. Cohen, A Coefficient of Agreement for Nominal Scales, Educational and Psychological Measurement, vol.20, issue.1, p.27, 1960.

J. Czekanowski, Zarys metod statystycznych (Die Grundzuge der statischen Metoden). Towarzystwo Naukowe Warszawskie, p.27, 1913.

J. Dougherty, R. Kohavi, and &. Sahami, Supervised and Unsupervised Discretization of Continuous Features, Proceedings of the 12th International Conference on Machine Learning, pp.194-202

M. Kaufmann, , 1995.

&. M. Dudoit and . Van-der-laan, Multiple testing procedures with applications to genomics, p.57, 2007.

B. Efron, Bootstrap Methods : Another Look at the Jackknife, vol.7, p.57, 1979.

T. Fukuda, Y. Morimoto, S. Morishita, and &. Tokuyama, Data Mining Using Two-Dimensional Optimized Accociation Rules : Scheme, Algorithms, and Visualization, ACM SIGMOD International Conference on Management of Data, p.27, 1996.

J. G. Ganascia, Deriving the learning bias from rule properties, p.27, 1991.

D. Gay and &. Boullé, Un critère Bayésien pour évaluer la robustesse des règles de classification

. France, RNTI-E-20 of Revue des Nouvelles Technologies de l'Information, vol.45, p.100, 2011.

L. Geng and H. J. Hamilton, Interestingness measures for data mining : A survey, ACM Computing Surveys, vol.38, issue.3, p.26, 2006.

C. Gini, Measurement of Inequality and Incomes, The Economic Journal, vol.31, p.27, 1921.

B. Goethals, Frequent Set Mining, The Data Mining and Knowledge Discovery Handbook, vol.3, p.12, 2005.

I. J. Good, ;. S. Guillaume, D. &. Grissa, and . Nguifo, Propriété des mesures d'intérêt pour l'extraction des règles, The estimation of probabilities : An essay on modern bayesian methods. M.I.T. Press, p.79, 1965.

J. Han, J. Pei, and &. Yin, Mining frequent patterns without candidate generation, ACM SIGMOD International Conference on Management of Data, pp.1-12, 2000.

C. Hébert and &. Crémilleux, Optimized Rule Mining Through a Unified Framework for Interestingness Measures, 8th International Conference on Data Warehousing and Knowledge Discovery, vol.4081, p.33, 2006.

C. Hébert and &. Crémilleux, A Unified View of Objective Interestingness Measures, editeur, 5th International Conference on Machine Learning and Data Mining, vol.4571, pp.533-547

. Springer, , p.33, 2007.

P. Jaccard, Étude comparative de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Société Vaudoise des Sciences Naturelles, vol.37, p.27, 1901.

M. Jalali-heravi, &. O. Zaïane, ;. S. Jaroszewicz-&-d, and . Simovici, Interestingness of frequent itemsets using Bayesian networks as background knowledge, Proceedings of the 2010 ACM Symposium on Applied Computing,Sierre, Switzerland, SAC'10, vol.71, pp.178-186, 1924.

H. Jeffreys, Some Tests of Significance, Treated by the Theory of Probability, Proceedings of the Cambridge Philosophical Society, vol.31, p.27, 1935.

V. Jovanoski and &. Lavrac, Classification Rule Learning with APRIORI-C. In P. Brazdil & A. Jorge, editeurs, Progress in Artificial Intelligence, Lecture Notes in Computer Science, vol.2258, issue.23, pp.111-135, 2001.

M. Klemettinen, H. Mannila, P. Ronkainen, H. &. Toivonen, and . Verkamo, Finding Interesting Rules from Large Sets of Discovered Association Rules, 3rd International Conference on Information and Knowledge Management, pp.401-407, 1924.

W. Klösgen, Problems for knowledge discovery in databases and their treatment in the statistics interpreter EXPLORA. International journal of intelligent systems, vol.7, p.27, 1992.

S. Kulczynski, Die Pflanzenassoziationen des Pieninen, Bulletin International de l'Acad?ie Polonaise des Sciences et des Lettres, p.27, 1927.

S. Lallich, O. Teytaud, and &. E. Prudhomme, Association Rule Interestingness : Measure and Statistical Validation, editeurs, Quality Measures in Data Mining, vol.43, p.57, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00113594

S. Lallich, B. Vaillant, and &. Lenca, A probabilistic framework towards the parameterization of association rule interestingness measures, Methodology and Computing in Applied Probability, vol.9, p.57, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01879299

N. Lavrac, P. A. Flach, and &. Zupan, Rule Evaluation Measures : A Unifying View, ILP'99 : Proceedings of the 9th International Workshop on Inductive Logic Programming, vol.28, pp.174-185, 1999.

. [le-bras, On Optimal Rule Mining : A Framework and a Necessary and Sufficient Condition of Antimonotonicity, editeurs, 13th Pacific-Asia Conference on Knowledge Discovery and Data Mining, vol.5476, p.97, 2009.

. [le-bras, Généralisation de la propriété de monotonie de la all-confidence pour l'extraction de motifs intéressants non fréquents, 5th Workshop on Qualité des Données et des Connaissances, in conjunction with the 9th Extraction et Gestion des Connaissances conference, pp.17-24, 2001.

. [le-bras, All-Monotony : A Generalization of the All-Confidence Antimonotony, 4th International Conference on Machine Learning and Applications, vol.73, p.84, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00445030

. Bibliographie-[le-bras, Mining interesting rules without support requirement : a general universal existential upward closure property, Annals of Information Systems, vol.8, p.89, 2010.

. [le-bras, Mesure de la robustesse des règles d'association, 6th Workshop on Qualité des Données et des Connaissances, in conjunction with the 10th Extraction et Gestion des Connaissances conference, p.43, 2010.

. [le-bras, A robustness measure of association rules, 13rd European Conference on Principles of Data Mining and Knowledge Discovery, vol.6322, p.51, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00515367

, Mining Classification Rules Without Support : an Anti-monotone Property of Jaccard Measure, vol.6926, pp.179-193, 0111.

T. T. Le, X. Huynh, and &. Guillet, Finding the Most Interesting Association Rules by Aggregating Objective Interestingness Measures, editeurs, Knowledge Acquisition : Approaches, Algorithms and Applications, Pacific Rim Knowledge Acquisition Workshop, vol.5465, p.30, 2008.

P. Lenca, S. Lallich, and &. Vaillant, On the robustness of association rules, 2nd IEEE International Conference on Cybernetics and Intelligent Systems and Robotics, Automation and Mechatronics, vol.31, p.46, 2006.

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, vol.184, issue.2, p.133, 2008.

I. Lerman, R. &. Gras, and . Rostam, Elaboration d'un indice d'implication pour les données binaires, I et II, Mathématiques et Sciences Humaines, vol.75, issue.74, p.57, 1981.

W. Li, J. Han, and &. J. Pei, CMAR : Accurate and Efficient Classification Based on Multiple Class-Association Rules, 1st IEEE International Conference on Data Mining, vol.23, p.46, 2001.

[. Li, Mining risk patterns in medical data, 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol.80, p.100, 2005.

J. Li, On Optimal Rule Discovery, IEEE Transaction on Knowledge and Data Engineering, vol.18, issue.4, p.117, 2006.

M. Bibliographie-;-w.-y.-lin, &. Tseng, and . Su, A Confidence-Lift Support Specification for Interesting Associations Mining, 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol.2336, p.116, 1998.

J. Loevinger, A systemic approach to the construction and evaluation of tests of ability, 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, vol.61, p.76, 1947.

M. Ohsaki, S. Kitaguchi, K. Okamoto, H. Yokoi, and &. Yamaguchi, Evaluation of rule interestingness measures with a clinical dataset on hepatitis, editeurs, 8th European Conference on Principles of Data Mining and Knowledge Discovery, vol.3202, p.26, 2004.

E. Omiecinski, Alternative interest measures for mining associations in databases, IEEE Transaction on Knowledge and Data Engineering, vol.15, issue.1, p.83, 2003.

B. Padmanabhan-&-a.-tuzhilin, ;. Pasquier, Y. Bastide, R. Taouil, and &. Lakhal, Unexpectedness as a measure of interestingness in knowledge discovery, Decision Support Systems, vol.27, issue.1, p.17, 1999.

N. Pasquier, Data Mining : algorithmes d'extraction et de réduc-tion des règles d'association dans les bases de données, 2000.

K. Pearson, ;. J. Pei, J. V. Han-&-l, and . Lakshmanan, Mining Frequent Itemsets with Convertible Constraints, Mathematical Contributions to the Theory of Evolution. III. Regression, Heredity, and Panmixia, vol.187, pp.433-442, 2001.

G. Piatetsky-shapiro, Discovery, Analysis, and Presentation of Strong Rules, Knowledge Discovery in Databases, vol.26, p.32, 1991.

J. R. Quinlan, C4.5 : Programs for machine learning, 1993.

. Bibliographie,

A. Ragel and &. Crémilleux, Treatment of Missing Values for Association Rules, editeurs, 2nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, vol.1394, pp.258-270, 1998.

R. Reiter, A logic for default reasoning, p.24, 1987.

G. J. Salton-&-m, ;. Mcgill, E. Savasere, . &. Omiecinski, and . Navathe, An Efficient Algorithm for Mining Association Rules in Large Databases, editeurs, 21th International Conference on Very Large Data Bases, pp.432-444, 1983.

P. J. Schneider and &. Eberly, Geometric tools for computer graphics, p.61, 2002.

M. Sebag, &. Schoenauer, ;. M. Smyth-&-r, and . Goodman, Generation of Rules with Certainty and Confidence Factors from Incomplete and Incoherent Learning Bases, Gesellschaft für Mathematik und Datenverarbeitung mbH, vol.20, pp.159-176, 1928.

A. Surana, U. &. Kiran, ;. Reddy, S. Szathmary, P. Maumus et al., Valtchev & A. Napoli. Finding Minimal Rare Itemsets and Rare Association Rules, 19th IEEE International Conference on Tools with Artificial Intelligence, vol.1, p.131, 1991.

H. Toivonen, Sampling Large Databases for Association Rules, editeurs, 22nd International Conference on Very Large Data Bases, p.17, 1996.

B. Vaillant, S. Lallich, and &. Lenca, Modeling of the counterexamples and association rules interestingness measures behavior, The 2006 International Conference on Data Mining, vol.46, p.47, 1931.
URL : https://hal.archives-ouvertes.fr/hal-01881282

B. Vaillant, Mesurer la qualité des règles d'association : Études formelles et expérimentales, 1926.

K. Wang, S. H. Tay, and &. Liu, Interestingness-Based Interval Merger for Numeric Association Rules, 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p.27, 1998.

K. Wang, Y. &. He, and . Cheung, Mining confident rules without support requirement, 10th International Conference on Information and Knowledge Management, vol.77, p.89, 2001.

G. I. Webb and &. S. Zhang, K-Optimal Rule Discovery, Data Mining and Knowledge Discovery, vol.10, issue.1, p.46, 2005.

H. Xiong, P. Tan, and &. Kumar, Mining Strong Affinity Association Patterns in Data Sets with Skewed Support Distribution, 3rd IEEE International Conference on Data Mining, vol.76, p.77, 2003.

Q. Yang and &. Wu, 10 Challenging Problems in Data Mining Research, International Journal of Information Technology and Decision Making, vol.5, issue.4, p.75, 2006.

J. Yao and &. Liu, Searching Multiple Databases for Interesting Complexes, editeurs, 1st Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.198-210, 1928.

X. Yin and &. J. Han, CPAR : Classification based on Predictive Association Rules, D. Barbará & C. Kamath, editeurs, 3dr SIAM International Conference on Data Mining, vol.46, pp.331-335, 2003.

G. U. Yule, On the Association of Attributes in Statistics : With Illustrations from the Material of the, Childhood Society. Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character, vol.194, p.28, 1900.

M. J. Zaki, S. Parthasarathy, and &. W. Li, A Localized Algorithm for Parallel Association Mining, Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, vol.9, p.10, 1997.

M. J. Zaki, Scalable Algorithms for Association Mining, IEEE Transaction on Knowledge and Data Engineering, vol.12, issue.3, p.12, 2000.

T. Zhang, Association Rules

E. Chen, 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, vol.1805, pp.245-256, 1928.

A. Zimmermann-&-l.-de and . Raedt, CorClass : Correlated Association Rule Mining for Classification, editeurs, 7th International Conference on Discovery Science, vol.3245, pp.60-72

. Springer, , p.76, 2004.