PRINCE: Optimized extraction of the generic bases of rules without calculation of closures;PRINCE: Extraction optimisé'e des bases gé'né'riques de ré'gles sans calcul de fermetures

INFORSID 2005: Actes du XXIIIeme Congres Informatique des Organisations et Systemes d'Information et de Decision

Volumn , Issue , 2005, Pages

  Hamrouni, T ^a   Ben Yahia, S ^a   Slimani, Y ^a  

^a Campus Universitaire ^*  (Tunisia)

Author keywords

Data mining; Formal Concept Analysis; Generic rules base; Minimal generator lattice

Indexed keywords

CLOSED ITEMSETS; EXPERIMENTAL EVALUATION; GENERIC BASIS; GENERIC RULES; MINIMAL GENERATORS; PARTIAL ORDER; REDUCED SIZE;

ALGORITHMS; ASSOCIATION RULES; DATA MINING; FORMAL CONCEPT ANALYSIS; OPTIMIZATION;

EXTRACTION;

EID: 84884313235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Agrawal R., Imielinski T., Swami A., Mining Association Rules between sets of items in large Databases, Proceedings of the ACM SIGMOD Intl. Conference on Management of Data, Washington, USA, June 1993, p. 207-216.
2. Barbut M., Monjardet B., Ordre et classification. Algèbre et Combinatoire, Hachette, Tome II, 1970.
3. 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.
4. Bastide Y., Taouil R., Pasquier N., Stumme G., Lakhal L., Mining frequent patterns with counting inference, SIGKDD Explorations, vol. 2, no 2, 2000, p. 66-75.
5. Ben Yahia S., Cherif C. L., Mineau G., Jaoua A., Découverte des règles associatives non redondantes: application aux corpus textuels, Revue d'Intelligence Artificielle (special issue of Intl. Conference of Journées francophones d'Extraction et Gestion des connaissances (EGC'2003)), Lyon,France, vol. 17, no 1-2-3, 2003, p. 131-143.
6. Ben Yahia S., Nguifo E. M., Approches d'extraction de règles d'association basées sur la correspondance de Galois, Ingénierie des Systèmes d'Information (ISI), vol. 3-1, no 9, 2004, p. 23-55.
7. Calders T., Deducing bounds on the support of Itemsets, EDBT Workshop DTDM Database Techniques in Data Mining, 2002.
8. Calders T., Goethals B., Mining all non derivable frequent itemsets, Proceedings PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, Springer-Verlag 2002, p. 74-85.
9. Davey B., Priestley H., Introduction to Lattices and Order, Cambridge University Press, 2002.
10. Floc'h A. L., Fisette C., Missaoui R., Valtchev P., Godin R., JEN: un algorithme efficace de construction de générateurs pour l'identification des règles d'association, Numéro spécial de la revue des Nouvelles Technologies de l'Information spécial de la revue des Nouvelles Technologies de l'Information, vol. 1, no 1, 2003, p. 135-146, Editions Cépaduès
11. Ganter B., Wille R., Formal Concept Analysis, Springer-Verlag, 1999.
12. Goethals B., Zaki M. J., FIMI'03:Workshop on frequent itemset mining implementations, FIMIRepository: http://fimi.cs.helsinki.fi/, November 2003.
13. Kryszkiewicz M., Concise Representation of Frequent Patterns based on Disjunction-Free Generators, Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM), San Jose, California, USA, 2001. IEEE Computer Society, 2001, p. 305-312.
14. Kuznetsov S., Ob"Edkov S., Comparing Performance of Algorithms for Generating Concept Lattices, Proceedings of ICCS'01 Int'l. Workshop on Concept Lattices-Based KDD, Standford, 2002, p. 35-47.
15. Pasquier N., Bastide Y., Taouil R., Lakhal L., Efficient Mining of Association Rules Using Closed Itemset Lattices, Information Systems Journal, vol. 24, no 1, 1999, p. 25-46.
16. Pasquier N., Bastide Y., Taouil R., Lakhal L., Discovering Frequent Closed Itemsets, Proceedings of 7th International Conference on Database Theory (ICDT'99), LNCS, Vol. 1540, Springer-Verlag, January 1999, p. 398-416.
17. Pei J., Han J., Mao., Nishio S., Tang S., Yang D., CLOSET: An efficient algorithm for mining frequent closed itemsets, Proceedings of the ACM SIGMOD DMKD'00, Dallas,TX, 2000, p. 21-30.
18. Pfatz J. L., Taylor C. M., Scientific Knowledge Discovery through Iterative Transformation of Concept Lattices, Proceedings of Workshop on Discrete Applied Mathematics in conjunction with the 2nd SIAM International Conference on Data Mining, Arlington, Virginia (USA), 2002, p. 65-74.
19. Stumme G., Taouil R., Bastide Y., Pasquier N., Lakhal L., Computing Iceberg Concept Lattices with TITANIC, Journal on Knowledge and Data Engineering (KDE), vol. 2, no42, 2002, p. 189-222.
20. Valtchev P., Missaoui R., Lebrun P., A Fast Algorithm for Building the Hasse Diagram of a Galois Lattice, Proceedings of the Colloque LaCIM 2000,Montréal (CA), September2000, p. 293-306.
21. Valtchev P., Missaoui R., Godin R., Meridji M., Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory, Journal Expt. Theoretical Artificial Intelligence, vol. 14, no 1, 2002, p. 115-142.
22. Zaki M. J., Hsiao C. J., CHARM: An Efficient Algorithm for Closed Itemset Mining, Proceedings of the 2nd SIAM International Conference on Data Mining, Arlington, Virginia (USA), April 2002, p. 34-43.