T. [. Agrawal, A. Imielinski, and . Swami, Mining Association Rules between Sets of Items in Large Databases, Proceedings, ACM SIGMOD Conference on Management of Data, p.207216, 1993.

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, Fast discovery of association rules, Advances in knowledge discovery and data mining, p.307328, 1996.

R. [. Agrawal and . Srikant, Fast Algorithms for Mining Association Rules in Large Databases, VLDB '94: Proceedings of the 20th International Conference on Very Large Data Bases, p.487499, 1994.

R. Agrawal and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, p.314, 1995.
DOI : 10.1109/ICDE.1995.380415

T. [. Brachman and . Anand, The Process of Knowledge Discovery in Databases

R. J. Bayardo, Eciently mining long patterns from databases, SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.8593, 1998.

C. Becquet, S. Blachon, B. Jeudy, J. Boulicaut, and O. Gandrillon, Strongassociation-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data, Genome Biology, vol.3, issue.12, pp.67-68, 2002.

[. Boulicaut, A. Bykowski, and C. Rigotti, Approximation of Frequency Queries by Means of Free-Sets, Proceedings of PKDD 2000, p.7585
DOI : 10.1007/3-540-45372-5_8

S. Berlin, /. Boulicaut, A. Bykowski, and C. Rigotti, Bibliography [ Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries, Data Mining and Knowledge Discovery, vol.7, issue.1, p.522, 2000.

V. [. Boros, L. Gurvich, K. Khachiyan, and . Makino, On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets, STACS '02: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, p.133141, 2002.
DOI : 10.1007/3-540-45841-7_10

J. Bouyer, D. Hémon, S. Cordier, F. Derriennic, I. Stücker et al., Epidemiologie, Editions INSERM, 1995.
DOI : 10.1007/978-3-642-59883-8_1
URL : https://hal.archives-ouvertes.fr/cel-00124335

A. [. Berendt, G. Hotho, and . Stumme, Towards Semantic Web Mining, Lecture Notes in Articial Intelligence, vol.2342, p.264278, 2002.
DOI : 10.1007/3-540-48005-6_21

]. S. Blnn04a, C. Berasaluce, A. Laurenço, G. Napoli, and . Niel, An Experiment on Knowledge Discovery in Chemical Databases, Knowledge Discovery in Databases: PKDD 2004, p.3951, 2004.

]. S. Blnn04b, C. Berasaluce, A. Laurenço, G. Napoli, and . Niel, Data mining in reaction databases: extraction of knowledge on chemical functionality transformations, 2004.

R. [. Brin, J. D. Motwani, S. Ullman, and . Tsur, Dynamic itemset counting and implication rules for market basket data, SIGMOD '97: Proceedings of the, 1997.

J. [. Bachorik and . Ross, National Cholesterol Education Program recommendations for measurement of low-density lipoprotein cholesterol: executive summary . The National Cholesterol Education Program Working Group on Lipoprotein Measurement, Clin. Chem, issue.10, p.4114141420, 1995.

C. [. Bykowski and . Rigotti, A condensed representation to nd frequent patterns

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Mining frequent patterns with counting inference, ACM SIGKDD Explorations Newsletter, vol.2, issue.2, p.6675, 2000.
DOI : 10.1145/380995.381017
URL : https://hal.archives-ouvertes.fr/hal-00467750

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proc. of the Computational Logic (CL'00), volume 1861 of Lecture Notes in Articial Intelligence LNAI, p.972986, 2000.
DOI : 10.1007/3-540-44957-4_65
URL : https://hal.archives-ouvertes.fr/hal-00467751

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal, Pascal : un algorithme d'extraction des motifs fréquents, Technique et science informatiques, p.6595, 2002.

]. J. Car83, Learning by analogy: Formulating and generalizing plans from past experience, Machine Learning, p.137161, 1983.

L. [. Chen, S. J. Chou, and . Hwang, Application of a data-mining technique to analyze coprescription patterns for antacids in Taiwan, Clinical Therapeutics, vol.25, issue.9, pp.2453-2463, 2003.
DOI : 10.1016/S0149-2918(03)80287-4

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

T. Calders and B. Goethals, Mining All Non-derivable Frequent Itemsets, PKDD '02: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, p.7485, 2002.
DOI : 10.1007/3-540-45681-3_7

T. Calders and B. Goethals, Depth-rst non-derivable itemset mining, Proc

S. [. Creighton and . Hanash, Mining gene expression databases for association rules, Bioinformatics, vol.19, issue.1, p.7986, 2003.
DOI : 10.1093/bioinformatics/19.1.79

A. [. Cher, Y. Napoli, and . Toussaint, Toward a text mining methodology using frequent itemset and association rule extraction

A. [. Cher, Y. Napoli, and . Toussaint, Towards a Text Mining Methodology Using Association Rules Extraction, Soft Computing, vol.10, issue.5, p.431441, 2005.

]. R. Col01 and . Cole, Automated Layout of Concept Lattices Using Layered Diagrams and Additive Diagrams, 24th Australasian Computer Science Conference (ACSC '01), p.4760, 2001.

C. Carpineto and G. Romano, Concept Data Analysis: Theory and Applications
DOI : 10.1002/0470011297

C. [. Calders, J. Rigotti, and . Boulicaut, A Survey on Condensed Representations for Frequent Sets, Constraint-Based Mining, 2005.
DOI : 10.1007/11615576_4

C. Hoppe, W. Klitz, S. Cheng, R. Apple, L. Steiner et al., Gene interactions and stroke risk in children with sickle cell anemia, Blood, vol.103, issue.6, p.23912396, 2004.
DOI : 10.1182/blood-2003-09-3015

M. D. 'aquin, F. Badra, S. Lafrogne, J. Lieber, A. Napoli et al., Adaptation Knowledge Discovery from a Case Base, Proceedings of the 17th European Conference on Articial Intelligence (ECAI-06), p.795796, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00110287

B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 1990.
DOI : 10.1017/CBO9780511809088

L. Dehaspe and H. Toivonen, Discovery of frequent datalog patterns, Data Mining and Knowledge Discovery, vol.3, p.736, 1999.

M. H. Dunham, Data Mining Introductory and Advanced Topics, 2003.

V. Duquenne, Latticial structures in data analysis, Theoretical Computer Science, vol.217, issue.2, p.407436, 1999.
DOI : 10.1016/S0304-3975(98)00279-5

U. M. Fayyad, G. Piatetsky-shapiro, P. Smyth, and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining, 1996.

V. [. Guigues and . Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires, Mathématiques et Sciences Humaines, vol.95, p.518, 1986.

P. [. Ganter, S. O. Grigoriev, M. V. Kuznetsov, and . Samokhin, Concept-Based Data Mining with Scaled Labeled Graphs, Conceptual Structures at Work: Proceedings of the 12th International Conference on Conceptual Structures, p.94108, 2004.
DOI : 10.1007/978-3-540-27769-9_6

G. [. Godin, R. Mineau, and . Missaoui, Méthodes de classication conceptuelle basées sur les treillis de Galois et applications, p.105137, 1995.

]. B. Goe03 and . Goethals, Survey on Frequent Pattern Mining, 2003.

S. [. Ganter and . Rudolph, Formal Concept Analysis Methods for Dynamic Conceptual Graphs, Conceptual Structures: Broadening the Base 9th International Conference on Conceptual Structures, ICCS-2001, p.143156
DOI : 10.1007/3-540-44583-8_11

A. Guenoche, Construction du treillis de Galois d'une relation binaire, Mathématiques , Informatique et Sciences Humaines, vol.109, p.4153, 1990.

I. [. Guenoche and . Van-mechelen, Galois Approach to the Induction of Concepts

I. In, J. Van-mechelen, R. S. Hampton, P. Michalski, and . Theuns, Categories and Concepts: Theoretical Views and Inductive Data Analysis, 1993.

B. Ganter and R. Wille, Formal concept analysis: mathematical foundations

K. Gouda and M. J. Zaki, Eciently Mining Maximal Frequent Itemsets, ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining, p.163170, 2001.

J. [. Harms, J. Deogun, T. Saquer, and . Tadesse, Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints, Proceedings 2001 IEEE International Conference on Data Mining, p.603606, 2001.
DOI : 10.1109/ICDM.2001.989576

H. [. Hilderman and . Hamilton, Knowledge discovery and interestingness measures: A survey, 1999.

M. [. Hanney and . Keane, Learning adaptation rules from a case-base
DOI : 10.1007/BFb0020610

J. Han and M. Kamber, Data Mining, 2001.
DOI : 10.1007/978-1-4899-7993-3_104-2

D. Hand, H. Mannila, and P. Smyth, Principles of Data Mining, Drug Safety, vol.15, issue.2, 2001.
DOI : 10.2165/00002018-200730070-00010

J. [. Han, Y. Pei, and . Yin, Mining frequent patterns without candidate generation

]. N. Jay03 and . Jay, Recherche et interprétation de motifs séquentiels fréquents dans une base de données médicales, 2003.

J. [. Jeudy and . Boulicaut, Using Condensed Representations for Interactive Association Rule Mining, Proceedings PKDD '02, p.225236, 2002.
DOI : 10.1007/3-540-45681-3_19

D. Janetzko, H. Cher, R. Kennke, A. Napoli, and Y. Toussaint, Knowledge-Based Selection of Association Rules for Text Mining, Proc. of the 16th European Conference on Articial Intelligence ECAI '04, p.485489, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00107787

R. Kosala and H. Blockeel, Web Mining: A Survey, SIGKDD Explorations, p.1

M. [. Kryszkiewicz and . Gajek, Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
DOI : 10.1007/3-540-48050-1_42

J. [. Koperski and . Han, Discovery of spatial association rules in geographic information databases, Proc. 4th Int. Symp. Large Spatial Databases (SSD '95), p.4766, 1995.
DOI : 10.1007/3-540-60159-7_4

S. [. Kuznetsov and . Obiedkov, Algorithms for the Construction of Concept Lattices and Their Diagram Graphs, Principles of Data Mining and Knowledge Discovery: 5th European Conference, p.289300, 2001.
DOI : 10.1007/3-540-44794-6_24

S. [. Kuznetsov and . Obiedkov, Comparing performance of algorithms for generating concept lattices, Journal of Experimental & Theoretical Artificial Intelligence, vol.21, issue.2-3, p.189216, 2002.
DOI : 10.1016/S0020-0190(99)00108-8

N. [. Koh and . Rountree, Finding Sporadic Rules Using Apriori-Inverse, PAKDD '05: Proceedings of the 9th Pacic-Asia Conference on Advances in Knowledge Discovery and Data Mining, p.97106, 2005.
DOI : 10.1007/11430919_13

N. [. Koh, R. O. Rountree, and . Keefe, Mining Interesting Imperfectly Sporadic Rules, PAKDD '06: Proceedings of the 10th Pacic-Asia Conference on Advances in Knowledge Discovery and Data Mining, p.473482, 2006.

M. Kryszkiewicz, Representative association rules, PAKDD '98: Proceedings of the Second Pacic-Asia Conference on Research and Development in Knowledge Discovery and Data Mining, 1998.
DOI : 10.1007/3-540-64383-4_17

]. M. Kry01 and . Kryszkiewicz, Concise Representation of Frequent Patterns Based on

M. Kryszkiewicz, Concise Representations of Association Rules, Pattern Detection and Discovery, p.92109, 2002.
DOI : 10.1007/3-540-45728-3_8

]. S. Kuz04 and . Kuznetsov, Machine Learning and Formal Concept Analysis, Concept Lattices, Second International Conference on Formal Concept Analysis, p.287312, 2004.

P. [. Lavrac, B. Flach, and . Zupan, Rule Evaluation Measures: A Unifying View, Inductive Logic Programming, 9th International Workshop, ILP-99, p.174185, 1999.
DOI : 10.1007/3-540-48751-4_17

W. [. Liu, Y. Hsu, and . Ma, Mining association rules with multiple minimum supports, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, p.337341, 1999.
DOI : 10.1145/312129.312274

[. Lin and Z. M. Kedem, Pincer-search: A new algorithm for discovering the maximum frequent set, EDBT '98: Proceedings of the 6th International Conference on Extending Database Technology, p.105119, 1998.
DOI : 10.1007/BFb0100980

H. [. Liu, L. Lu, F. Feng, and . Hussain, Ecient Search of Reliable Exceptions, PAKDD '99: Proceedings of the Third Pacic-Asia Conference on Methodologies for Knowledge Discovery and Data Mining, p.194203, 1999.

M. Luxenburger, Implications partielles dans un contexte, Mathématiques, Informatique et Sciences Humaines, vol.113, p.3555, 1991.

]. H. Man97 and . Mannila, Methods and Problems in Data Mining, Database Theory ICDT'97 6th International Conference, p.4155, 1997.

M. Mansour-chemaly, N. Haddy, G. Siest, and S. Visvikis, Family Studies: Their Role in the Evaluation of Genetic Cardiovascular Risk Factors, Clinical Chemistry and Laboratory Medicine, vol.40, issue.11, p.4010851096, 2002.
DOI : 10.1515/cclm.2002.190
URL : https://hal.archives-ouvertes.fr/hal-00176461

T. M. Mitchell, Machine Learning, 1997.

]. S. Mnsvs05a, A. Maumus, L. Napoli, S. Szathmary, and . Visvikis-siest, Exploitation des données de la cohorte STANISLAS par des techniques de fouille de données numériques et symboliques utilisées seules ou en combinaison, Workshop on Fouille de Données Complexes dans un Processus d'Extraction des Connaissances -EGC 2005, p.7376, 2005.

]. S. Mnsvs05b, A. Maumus, L. Napoli, S. Szathmary, and . Visvikis-siest, Fouille de données biomédicales complexes : extraction de règles et de prols génétiques dans le cadre de l'étude du syndrome métabolique, Journées Ouvertes Biologie Informatique Mathématiques - JOBIM 2005, p.169173, 2005.

H. [. Mannila and . Toivonen, Multiple uses of frequent sets and condensed representations, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD '96), p.189194, 1996.

H. [. Mannila and . Toivonen, Levelwise Search and Borders of Theories in Knowledge Discovery, Data Mining and Knowledge Discovery, vol.1, issue.3, p.241258, 1997.

H. [. Mannila, A. I. Toivonen, and . Verkamo, Ecient algorithms for discovering association rules, Proc. of the AAAI Workshop on Knowledge Discovery in Databases (KDD '94), p.181

C. [. Napoli, R. Laurenço, and . Ducournau, An object-based representation system for organic synthesis planning, International Journal of Human-Computer Studies, vol.41, issue.1-2, p.532, 1994.
DOI : 10.1006/ijhc.1994.1051

B. Özden, S. Ramaswamy, and A. Silberschatz, Cyclic association rules, Proceedings 14th International Conference on Data Engineering
DOI : 10.1109/ICDE.1998.655804

N. Pasquier, Data Mining : Algorithmes d'Extraction et de Réduction des Règles d'Association dans les Bases de Données, Thèse de doctorat, 2000.

N. Pasquier, Mining association rules using formal concept analysis, Proc. of the 8th International Conf. on Conceptual Structures (ICCS '00), p.259264, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00467752

]. N. Pbtl99a, Y. Pasquier, R. Bastide, L. Taouil, and . Lakhal, The Netherlends Closed set based discovery of small covers for association rules, Proc. 15emes Journees Bases de Donnees Avancees, p.361381, 1991.

]. N. Pbtl99b, Y. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Discovering frequent closed itemsets for association rules, Lecture Notes in Computer Science, vol.1540, p.398416, 1999.

]. N. Pbtl99c, Y. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Ecient mining of association rules using closed itemset lattices, Inf. Syst, vol.24, issue.1, p.2546, 1999.

]. N. Pbtl99d, Y. Pasquier, R. Bastide, L. Taouil, and . Lakhal, Pruning Closed Itemset Lattices for Association Rules, International Journal of Information Systems, vol.24, issue.1, p.2546, 1999.

M. [. Park, P. S. Chen, and . Yu, An eective hash-based algorithm for mining association rules, SIGMOD '95: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, p.175186, 1995.

[. Pei, J. Han, and R. Mao, CLOSET: An ecient algorithm for mining frequent closed itemsets, In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, p.2130, 2000.

G. Piatetsky-shapiro, G. Piatetsky-shapiro, and W. J. , Knowledge Discovery in Databases, chapter Discovery, Analysis , and Presentation of Strong Rules (chapter 13, p.229248, 1991.

J. Quentin-trautvetter, P. Devos, A. Duhamel, and R. Beuscart, Assessing Association Rules and Decision Trees on Analysis of Diabetes Data from the DiabCare Program in France, Studies in Health Technology and Informatics, vol.90, p.557561, 2002.

C. K. Riesbeck and R. C. Schank, Inside Case-Based Reasoning, 1989.

G. Schreiber, H. Akkermans, A. Anjewierden, R. De-hoog, N. Shadbolt et al., Knowledge Engineering and Management: the CommonKADS Methodoloy, 1999.

S. Cheng, M. A. Grow, C. Pallaud, W. Klitz, H. A. Erlich et al., A Multilocus Genotyping Assay for Candidate Markers of Cardiovascular Disease Risk, Genome Research, vol.9, issue.10, pp.936-949, 1999.
DOI : 10.1101/gr.9.10.936

P. [. Stilou, N. Bamidis, C. Maglaveras, and . Pappas, Mining Association Rules from Clinical Databases: An Intelligent Diagnostic Process in Healthcare, MEDINFO 2001: Proceedings of the 10th World Congress on Medical Informatics, p.13991403, 2001.

L. Szathmary, S. Maumus, P. Petronin, Y. Toussaint, A. Napolisn05-]-l et al., Vers l'extraction de motifs rares RNTI-E-6, Cépaduès-Éditions Toulouse CORON: A Framework for Levelwise Itemset Mining Algorithms, Extraction et gestion des connaissances Lille Supplementary Proceedings of The Third International Conference on Formal Concept Analysis ICFCA '05, p.110113, 2005.

E. [. Savasere, S. Omiecinski, and . Navathe, An ecient algorithm for mining association rules in large databases, Proc. of the 21th International Conf. on Very Large Data Bases (VLDB '95), p.432444, 1995.

E. [. Savasere, S. B. Omiecinski, and . Navathe, Mining for strong negative associations in a large database of customer transactions, Proceedings 14th International Conference on Data Engineering, p.494502, 1998.
DOI : 10.1109/ICDE.1998.655812

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal, Computing iceberg concept lattices with Titanic, Data & Knowledge Engineering, vol.42, issue.2, p.189222, 2002.
DOI : 10.1016/S0169-023X(02)00057-5
URL : https://hal.archives-ouvertes.fr/hal-00578830

K. [. Sloan, G. Takata, and . Turan, On frequent sets of Boolean matrices

T. [. Salleb, C. Turmeaux, C. Vrain, and . Nortet, Mining Quantitative Association Rules in a Atherosclerosis Dataset, Proc. of the PKDD Discovery Challenge (co-located with the 6th European Conference on Principles and Practice of Knowledge Discovery in databases), p.98103, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00084881

G. Siest, S. Visvikis, B. Herbeth, R. Gueguen, M. Vincent-viry et al., Objectives, Design and Recruitment of a Familial and Longitudinal Cohort for Studying Gene-Environment Interactions in the Field of Cardiovascular Risk: The Stanislas Cohort, Clinical Chemistry and Laboratory Medicine, vol.36, issue.1, p.3542, 1998.
DOI : 10.1515/CCLM.1998.007

R. [. Stumme, U. Wille, and . Wille, Conceptual Knowledge Discovery in Databases using formal concept analysis methods, Principles of Data Mining and Knowledge Discovery (Proceedings PKDD'98 Lecture Notes in Articial Intelligence 1510, p.450458, 1998.
DOI : 10.1007/BFb0094849

V. [. Tan, J. Kumar, and . Srivastava, Selecting the right interestingness measure for association patterns, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, p.183193, 2002.
DOI : 10.1145/775047.775053

H. Toivonen, Sampling large databases for association rules, Proc. of the 22nd International Conf. on Very Large Data Bases (VLDB '96), p.134145, 1996.

D. [. Valtchev, C. Grosser, and H. M. Roume, Galicia: an open platform for lattices, Supplementary Proceedings of The 11th International Conference on Conceptual Structures (ICCS '03), 2003.

P. Vismara and C. Laurenço, An abstract representation for molecular graphs. DI- MACS Series in Discrete Mathematics and Theoretical Computer Science, pp.343-366, 2000.
DOI : 10.1090/dimacs/051/26

R. [. Valtchev, R. Missaoui, and . Godin, Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges, Proc. of the 2nd Intl. Conf. on Formal Concept Analysis, p.352371, 2004.
DOI : 10.1007/978-3-540-24651-0_30

R. [. Vogt and . Wille, TOSCANA ??? A graphical tool for analyzing and exploring data, Graph Drawing, p.226233, 1994.
DOI : 10.1007/3-540-58950-3_374

G. M. Weiss, Mining with rarity, ACM SIGKDD Explorations Newsletter, vol.6, issue.1, p.719, 2004.
DOI : 10.1145/1007730.1007734

I. H. Witten and E. Frank, Data mining, ACM SIGMOD Record, vol.31, issue.1, 1999.
DOI : 10.1145/507338.507355

I. H. Witten and E. Franck, Data mining, Practical machine learning tools and techniques with Java implementations Weka), 2000.
DOI : 10.1145/507338.507355

J. [. Wang, J. Han, and . Pei, CLOSET+, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, p.236245, 2003.
DOI : 10.1145/956750.956779

]. R. Wil02 and . Wille, Why can concept lattices support knowledge discovery in databases, Journal of Theoretical Articial Intelligence, vol.14, issue.23, p.8192, 2002.

D. [. Yun, B. Ha, K. H. Hwang, and . Ryu, Mining association rules on signicant rare data using relative support, Journal of Systems and Software, vol.67, issue.3, p.181191, 2003.

M. J. Zaki, Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, vol.12, issue.3, p.372390, 2000.
DOI : 10.1109/69.846291
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.656

M. J. Zaki and K. Gouda, Fast vertical mining using disets, KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, p.326335, 2003.

C. [. Zaki and . Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, SIAM International Conference on Data Mining SDM'02, p.3343, 2002.
DOI : 10.1137/1.9781611972726.27

S. [. Zaki, M. Parthasarathy, W. Ogihara, and . Li, New Algorithms for Fast Discovery of Association Rules Glossary Informative association rules : A set of rules that allows the determination of rules parameters such as support and condence, Proceedings of the 3rd Int'l Conference on Knowledge Discovery in Databases, p.283286, 1997.

. Minimal-rare and . Itemset, MRI) : A rare itemset such that all its proper subsets are not rare (and necessarily, all its supersets are rare) Note that minimal rare itemsets are minimal rare generators