A new generic basis of "factual" and "implicative" association rules

Intelligent Data Analysis

Volumn 13, Issue 4, 2009, Pages 633-656

  Yahia, Sadok Ben ^a   Gasmi, Ghada ^a,b   Nguifo, Engelbert Mephu ^b  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Association rules; Axiomatic system; Formal concept analysis; Generic basis

Indexed keywords

EID: 69749098126     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/IDA-2009-0384     Document Type: Article

References (37)

1. R. Agrawal, T. Imielinski and A. Swami. Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD Intl Conference on Management of Data, Washington, USA, June 1993, pp. 207-216.
2. W.W. Armstrong, Dependency structures of database relationships, in: IFIP Congress, September 1974, pp. 580-583.
3. J.-F. Boulicaut, A. Bykowski and C. Rigotti, Free-sets: A condensed representation of boolean data for the approximation of frequency queries, In Jounal of Data Mining and Knowledge Discovery (DMKD) 7(1) (2003), 5-22.
4. S. Ben Yahia, T. Hamrouni and E. Mephu Nguifo, Frequent closed itemset based algorithms: A thorough structural and analytical survey, ACM-SIGKDD Explorations 8(1) (June 2006), 93-104.
5. M. Barbut and B. Monjardet, Ordre et classification, Algèbre et Combinatoire, Hachette, Tome II, 1970.
6. S. Ben Yahia and E. Mephu Nguifo, Revisiting generic bases of association rules, in: Proceedings of 6th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2004) (Springer-Verlag), Zaragoza, Spain, September 2004, pp. 58-67.
7. C. Borgelt, Efficient implementations of apriori and eclat, in: Workshop of Frequent Item Set Mining Implementations, FIMI 2003, Melbourne, FL, USA, 2003.
8. Y. Bastide, N. Pasquier, R. Taouil, L. Lakhal and G. Stumme, Mining minimal non-redundant association rules using frequent closed itemsets, in: Proceedings of the Intl Conference DOOD'2000, LNCS, Springer-Verlag, July 2000, pp. 9726-986.
9. C. L. Cherif, S. BenYahia, J.P. Chevalet and A. Jaoua, Query expansion using fuzzy association rules between terms, in: Proceedings of the Intl Conf JIM'03 Knowledge Discovery and Discrete Mathematics (Journées d'Informatique Messine), Metz, France, September 2003, pp. 231-241.
10. A. Casali, R. Cicchetti and L. Lakhal, Essential patterns: A perfect cover of frequent patterns, in: Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005) (Vol. 3589,), A. Min Tjoa and J. Trujillo, eds, Springer-Verlag, LNCS, Copenhagen, Denmark, 22-26 August 2005, pp. 428-437.
11. T. Calders and B. Goethals, Quick inclusion-exclusion, in: Proceedings ECML-PKDD 2005 Workshop Knowledge Discovery in Inductive Databases, volume 3933 of LNCS, Springer-Verlag, 2005.
12. T. Calders and B. Goethals, Non-derivable itemset mining, Journal of Data Mining and Knowledge Discovery 14(1) (2007), 171-206.
13. J. Cheng, Y. Ke and W. Ng, Effective elimination of redundant association rules, Data Mining and Knowledge Discovery 16(2) (April 2008), 221-249.
14. T. Calders, C. Rigotti and J.-F. Boulicaut, A survey on condensed representations for frequent sets, in: Constraint Based Mining, Springer-Verlag, LNAI, volume 3848, 2006, pp. 64-80.
15. F. Flouvat, F. De Marchi and J-M. Petit, A thorough experimental study of datasets for frequent itemsets, in: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), New Orleans, USA, November 2005, pp. 162-169.
16. Gh. Gasmi, S. Ben Yahia, E. Mephu Nguifo and Y. Slimani, IGB: A new informative generic base of association rules, in: Proceedings of the Intl Ninth Pacific-Asia Conference on Knowledge Data Discovery (PAKDD'05), LNAI 3518, Hanoi, Vietnam, Springler-Verlag, May 2005, pp. 81-90.
17. J.L. Guigues andV. Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires, Mathématiques et Sciences Humaines 95 (1986), 5-18.
18. J. Galambos and I. Simonelli, Bonferroni-type Inequalities with Applications, Springer-Verlag, 2000.
19. B. Ganter and R. Wille, Formal Concept Analysis. Springer-Verlag, 1999.
20. T. Hamrouni, S. BenYahia and Y. Slimani, Prince: An algorithm for generating rule bases without closure computations. In A Min Tjoa and J. Trujillo, editors, Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2005), Springer-Verlag, LNCS, volume 3589, Copenhagen, Denmark, 22-26 August 2005, pp. 346-355.
21. J. Han, H. Cheng, D. Xin and X. Yan, Frequent pattern mining: Current status and future directions, Data Mining and Knowledge Discovery 15(1) (2007), 55-86.
22. M. Kryszkiewicz, Representative association rules, in: Research and Development in Knowledge Discovery and Data Mining Proc of Second Pacific-Asia Conference (PAKDD), Melbourne, Australia, 1998.
23. M. Kryszkiewicz, Concise representations of association rules, in: Proceedings of Pattern Detection and Discovery, ESF Exploratory Workshop D.J. Hand, N.M. Adams and R.J. Bolton, eds, London, UK, volume 2447 of LNCS, Springer-Verlag, September 2002, pp. 92-109.
24. M. Kryszkiewicz, Concise Representations of frequent patterns and association rules, PhD thesis, Institute of Computer Science Warsaw University of Technology, 2002.
25. V. Phan Luong, Raisonnement sur les règles d'association, in: Proceedings 17ème Journées Bases de Données Avancées BDA'2001, Agadir (Maroc), Cépaduès Edition, November 2001, pp. 299-310.
26. M. Luxenburger, Implication partielles dans un contexte, Mathématiques et Sciences Humaines 29(113) (1991), 35-55.
27. J. Muhonen and H. Toivonen, Closed non-derivable itemsets, in: Proceedings of the 10th European Conference PKDD (PKDD 2006), Springer-Verlag, LNCS, volume 4212, Berlin, Germany, 2006, pp. 601-608.
28. R.T. Ng, V.S. Lakshmanan, J. Han and A. Pang, Exploratory mining and pruning optimizations of constrained association rules, in: Proceedings of the SIGMOD Conference, 1998, pp. 13-24.
29. M. Ohsaki, S. Kitaguchi, K. Okamoto, H. Yokoi and T. Yamaguchi, Evaluation of rule interestingness measures with a clinical dataset on hepatitis, in: Proceedings of the Intl Conference PKDD, Pisa (Italy) Springer-Verlag, ed., September 2004, pp. 362-373.
30. N. Pasquier, Data Mining: Algorithmes D'extraction et de Réduction des règles D'association Dans Les Bases de Données, Phd thesis, Université de Clermont-Ferrand II, France, 2000.
31. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Efficient Mining of Association Rules Using Closed Itemset Lattices, Information Systems Journal 24(1) (1999), 25-46.
32. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier and L. Lakhal. Intelligent structuring and reducing of association rules with formal concept analysis, in: Proc KI'2001 conference, LNAI 2174, Springer-Verlag, September 2001, pp. 335-350.
33. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier and L. Lakhal, Computing iceberg concept lattices with Titanic, J on Knowledge and Data Engineering (KDE) 2(42) (2002), 189-222.
34. R. Srikant, Q. Vu and R. Agrawal, Mining association rules with item constraints, in: Proc of the 3rd Intl. Conference on Knowledge Discovery in Databases and Data Mining, Newport Beach, California, August 1997, pp. 67-73.
35. M.J. Zaki, Generating non-redundant association rules. In Proceedings of the 6th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, August 2000, pp. 34-43.
36. M.J. Zaki, Mining Non-Redundant Association Rules, Data Mining and Knowledge Discovery 9 (2004), 223-248.
37. M. Zaki and B. Phoophakdee, Mirage: A framework for mining, exploring and visualizing minimal association rules, Technical report, Rensselaer Polytechnic Institute, Computer Science Department, USA, July 2003.