Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, 1996. ,
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proc. Computational Logic, volume 1861 of LNAI, pp.972-986, 2000. ,
DOI : 10.1007/3-540-44957-4_65
URL : https://hal.archives-ouvertes.fr/hal-00467751
Constraint-Based Mining of Formal Concepts in Transactional Data, Proc. PAKDD, 2004. ,
DOI : 10.1007/978-3-540-24775-3_73
ExAnte: Anticipated Data Reduction in Constrained Pattern Mining, PKDD'03, 2003. ,
DOI : 10.1007/978-3-540-39804-2_8
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets, Symposium on Theoretical Aspects of Computer Science, pp.133-141, 2002. ,
DOI : 10.1007/3-540-45841-7_10
Free-sets : a condensed representation of boolean data for the approximation of frequency queries, DMKD, vol.7, issue.1, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-01503814
Mining free-sets under constraints, Proc. IDEAS, pp.322-329, 2001. ,
DOI : 10.1109/ideas.2001.938100
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.664
DualMiner, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.42-51, 2002. ,
DOI : 10.1145/775047.775054
Mining All Non-derivable Frequent Itemsets, Proc. PKDD, volume 2431 of LNAI, pp.74-85, 2002. ,
DOI : 10.1007/3-540-45681-3_7
URL : http://arxiv.org/abs/cs/0206004
The levelwise version space algorithm and its application to molecular fragment finding, Proc. IJCAI, pp.853-862, 2001. ,
Efficient mining of emerging patterns, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.43-52, 1999. ,
DOI : 10.1145/312129.312191
How well go lattice algorithms on currently used machine learning testbeds ?, 1st Intl. Conf. on Formal Concept Analysis, 2003. ,
On Supporting Interactive Association Rule Mining, DAWAK'00, 2000. ,
DOI : 10.1007/3-540-44466-1_31
URL : http://arxiv.org/pdf/cs/0112011v1.pdf
Optimization of association rule mining queries, Intelligent Data Analysis, vol.6, issue.4, pp.341-357, 2002. ,
Using Condensed Representations for Interactive Association Rule Mining, Proc. PKDD, volume 2431 of LNAI, 2002. ,
DOI : 10.1007/3-540-45681-3_19
Exploratory mining and pruning optimizations of constrained associations rules, SIGMOD, 1998. ,
GLUE: a lattice-based constructive induction system, Intelligent Data Analysis, vol.4, issue.4, pp.1-49, 2000. ,
Carpenter, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, 2003. ,
DOI : 10.1145/956750.956832
Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, issue.1, pp.25-46, 1999. ,
DOI : 10.1016/S0306-4379(99)00003-4
Pushing Convertible Constraints in Frequent Itemset Mining, Proc. ICDE, pp.433-442, 2001. ,
DOI : 10.1023/B:DAMI.0000023674.74932.4c
CLOSET an efficient algorithm for mining frequent closed itemsets, Proc. DMKD workshop, 2000. ,
A theory of inductive query answering (extended abstract), Proc. ICDM, pp.123-130, 2002. ,
Using transposition for pattern discovery from microarray data, Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery , DMKD '03, 2003. ,
DOI : 10.1145/882082.882099
URL : https://hal.archives-ouvertes.fr/hal-00324821
Optimisation of pattern mining : a new method founded on database transposition, EIS'04, 2004. ,
Condensed Representation of Emerging Patterns, Proc. PAKDD, 2004. ,
DOI : 10.1007/978-3-540-24775-3_16
URL : https://hal.archives-ouvertes.fr/hal-00324836
Basic properties of filter convergence spaces, J. Chem. Inf. Comput. Sci, vol.42, 2002. ,
Concept lattices and conceptual knowledge systems, Computer mathematic applied, pp.493-515, 1992. ,
DOI : 10.1016/0898-1221(92)90120-7
URL : http://doi.org/10.1016/0898-1221(92)90120-7
CHARM: An Efficient Algorithm for Closed Itemset Mining, Proc. SDM, 2002. ,
DOI : 10.1137/1.9781611972726.27