Découverte des régles associatives non redondantes- Application aux corpus textuels

Revue d'Intelligence Artificielle

Volumn 17, Issue 1, 2003, Pages 131-143

  Ben Yahia, Sadok ^a   Cherif, Ch L ^b   Mineau, G ^a   Jaoua, A ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

Author keywords

Data mining; Fomal galois lattice; Galois connection; Non redundant association rules

Indexed keywords

EID: 26844526163     PISSN: 0992499X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. [AGG 98] AGGRAWAL C. C., Yu P., «Online Generation of Association Rules », Proceedings of the 14th Intl. Conf. on Data Engineering IEEE edition. Orlando, 1998, p. 402-411.
2. [AGR 93] AGRAWAL R., IMIELINSKI T., SWAMI A., « Mining Association Rules between sets of items in large Databases », Proceedings of the ACM SIGAIOD Intl. conference on Afanageineill of Data, Washington. USA, June 1993, p. 207-2 16.
3. [BAR 70] BARBUT M., MONJARDET B., Ordre et classification. Algèbre et combinatoire, Hachette, Tome 11, 1970.
4. [BAS 00] BASTIDE Y., PASQUIER N., TAOUIL R., LAKHAL L., STUMME G., «Mining minimal non-redundant association rules using frequent closed itemsets », Proceedings of the international conference DOOD '2000,LNCS. Springer-verlag, july 2000, p. 972-986.
5. [BEN 01] BENYAHIA S., JAOUA A., «Discovering knowledge from fuzzy concept lattice », KANDEL A., LAST NI., BUNKE H., Eds., Data titining and conipittatioiial Intelligence, Studies in Fuzziness and Soft Computing, Vol. 68, chapitre 7, p. 167-190, Physica Verlag, Heidelberg, March 2001.
6. [BEN 02a] BENYAHIA S., « Discovering and incrementally maintaining fuzzy association rules », Proceedings of the I,itl. conference of information Processing and Management of Unceiiaintv in Knowl edge-based Systems (IPMU'2002) Annecy France, 1-5 July 2002.
7. [BEN 02b] BENYAFHIA S., SLIMANI Y., « Discovering Association Rules using the For mal Concept Analysis », Extraction des Connaissances et Appreniissage (special is sue of hi conference of Journé esfrancophones d'Extraction et Gestion des connais sances(EGC'2002), Montpellier France, vol. 1, n° 4, 2002, p. 233-244.
8. [BRI 97] BRIN S., MOTAWNI R., SILVERSTEIN C., « Beyon Market baskets Generalizing association rules to correlation », Proceedings of the SIGMOD, Tucson. Arizona (USA), May 1997, P. 265-276.
9. [GAN 99] GANTER B., WILLE R., Formal concept Analysis, Springer-Verlag, 1999. [ 86] GUIGUES J., DUQUENNE V., « Families minimales d'implications informatives ré sultant d'un tableau de données binaires a, Mathématiques et Sciences Hwnaines, n° 95, 1986, p. 5-18.
10. [GUI 86] GUIGUES J., DUQUENNE V., « Families minimales d'implications informatives ré sultant d'un tableau de données binaires », Mathématiques et Sciences Hwnaines, n° 95, 1986, p. 5-18.
11. [HAN 95] HAN J., Fu Y., « Discovery of multiple-level association rules from large databases », Proceedings of the VLDB conference, 1995, p. 420-431.
12. [HIP 98] HIPP J., MYKA A., WIRTH R., GUENTZER U., «A new algorithm for faster mining of generalized association rules », LNAI 1510, Springer-verlag, 1998.
13. [HUE 01] HUELLERMEIR E., « Implication-based fuzzy association rules », Proceedings of the PKDD'2001: Principles of Data Mining and Knowledge Discoveri 2168, Springer-verlag, Freibuig. Germany, september 2001, p. 241-252.
14. [KEI 96] KEIM D., KRIEGEL H., « Visualization techniques for mining large databases A comparison », IEEE Transactions on Knowledge and Data Engineering, vol. 6, n° 8, 1996, p. 923-938.
15. [KLE 94} KLEMETTINEN M., MANNILA H., RONKAINEN P., Toivo H., VERKAMO A. I., a Finding interesting rules from large sets of discovered association rules a, P,-o ceedings of the 3rd international conference on Information and Knowledge Management (cIKAv94),AcAfp, November 1994, p. 401-407.
16. [LAT 01] LATIRI C., BENYAJHIA S., « Textmining: Generating association rules from textual data , Proceedings of the XIXénze Congrés Inforinatique des Organisations et Svstè,nes d'Information et de Decision INFORSID'2001 Geneve. Switzerland, 29-30 May 2001, p. 27-39.
17. [LIU 99] Liu B., HsU W., ANG K. W., CHE S., « Visually aided exploration of interesting association rules », Proceedings ofthe 3rd international Conference on research and devel opmnent in Knowledge Discovery and Data mining (PAKDD'99 Vol. 1574, Springer verlag, April 1999, p. 380-389.
18. [LUX 91] LUXEMEtURGER M., «Implication partielles dans un contexte », Mathématiques ci Sciemices Huniaines, vol. 29, n° 113, 1991, p. 35-55.
19. [MEO 96] ME0 R., PSAILA Q., CERI S., « A new SQL-Like operator for mining association rules , Proceedings oft/ic VLDB Conference, 1996, p. 122-133.
20. [NG 98] No R. T., LAKSIIMANAN V. S., HAN J., PANG A., «Exploratory mining and pruning optimizations of constrained association rules », Proceeding.s oft/ic SIGMOD Conference, 19 13-24.
21. [SKI 95] SKIRANT R., AGRAWAL R., « Mining generalized association rules », Research report, 1995, Almaden Research Center, IBM Research Division, San Jose, USA.
22. [SRI 97] SRIKANT R., Vu Q., AGRAWAL R., « Mining Association Rules with Item Con straints n, Proc. oft/ic 3rd Intl. conference on Knowledge Disco rem in Databases and Data Mimiing, Neir port Beach, C'al August 1997, p. 67-73.
23. [STU 01] STuNl G., TAOUIL R., BASTIDE Y., PASQUIER N., LAKIIAL L., «Intelligent structuring and reducing of association rules with formal concept analysis », Proc. KI'2001 conference, LNAI 2174, Springer-verlag, september 2001, p. 335-350.
24. [STU 02] STUMME G., TA0uIL R., BASTIDE Y., PAsQuIER N., LAKIIAL L., «Comput ing iceberg concept lattices with Titanic », IEEE Transactions on Knowledge and Data Engineering, vol. 2, n° 42, 2002, p. 189-222.
25. [ZAK 00] ZAKI M. J., « Generating Non-Redundant Association Rules Proceedings of the 61th A SIGKDD International confem-ence on Knowledge Discovery and Data Mimi ing,Boston. MA, August 2000, p. 34-43.
26. [ZAK 02] ZAKI NI. J., HSIAO C. J., « CHARM: An Efficient Algorithm for Closed Item set Mining n, Proceedings oft/ic 2nd SIAM International conference on Data Mining, Arlington, April 2002, p. 34-43.