Efficient reduction of the number of associations rules using fuzzy clustering on the data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6729 LNCS, Issue PART 2, 2011, Pages 191-199

  Grissa Touzi, Amel ^a   Thabet, Aicha ^a   Sassi, Minyar ^a  

^a UNIVERSITY OF TUNIS EL MANAR   (Tunisia)

Author keywords

[No Author keywords available]

Indexed keywords

FUZZY CLUSTERING;

DATA SET; EXECUTION TIME; EXTRACTION RULE; HUMAN BRAIN; KNOWLEDGE DISCOVERY METHOD; META RULES;

INFORMATION MANAGEMENT;

EID: 79958217370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21524-7_23     Document Type: Conference Paper

References (16)

1. Goebel, M., Gruenwald, L.: A Survey of Data Mining and Knowledge Discovery Software Tools. SIGKDD, ACM SIGKDD 1(1), 20-33 (1999)
2. Zaki, M.: Mining Non-Redundant Association Rules. In: Data Mining and Knowledge Discovery, vol. (9), pp. 223-248 (2004)
3. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent structuring and reducing of association rules with formal concept analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 335-350. Springer, Heidelberg (2001)
4. Pasquier, N.: Data Mining: Algorithmes d'Extraction et de Réduction des Règles d'Association dans les Bases de Données. Thèse, Département d'Informatique et Statistique, Faculté des Sciences Economiques et de Gestion, Lyon (2000)
5. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between sets of items in large Databases. In: Proceedings of the ACM SIGMOD Intl. Conference on Management of Data, Washington, USA, pp. 207-216 (June 1993)
6. Agrawal, R., Skirant, R.: Fast algoritms for mining association rules. In: Proceedings of the 20th Int'l Conference on Very Large Databases, pp. 478-499 (June 1994)
7. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems Journal 24(1), 25-46 (1999)
8. Zaki, M.J., Hsiao, C.J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proceedings of the 2nd SIAM International Conference on Data Mining, Arlington, pp. 34-43 (April 2002)
9. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Fast Computation of Concept Lattices Using Data Mining Techniques. In: Bouzeghoub, M., Klusch, M., Nutt, W., Sattler, U. (eds.) Proceedings of 7th Intl. Workshop on Knowledge Representation Meets Databases (KRDB 2000), Berlin, Germany, pp. 129-139 (2000)
10. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing Iceberg Concept Lattices with TITANIC. J. on Knowledge and Data Engineering (KDE) 2(42), 189-222 (2002)
11. Ben Tekaya, S., Ben Yahia, S., Slimani, Y.: Algorithme de construction d'un treillis des concepts formels et de déte rmination des générateurs minimaux. ARIMA Journal, 171-193 (Novembre 2005); Numéro spécial CARI 2004
12. Hamrouni, T., Ben Yahia, S., Slimani, Y.: Prince: Extraction optimisée des bases génériques de règles sans calcul de fermetures. In: Proceedings of the Intl. INFORSID Conference, Editions Inforsid, Grenoble, France, May 24-27, pp. 353-368 (2005)
13. Plasse, M., Niang, N., Saporta, G., Villeminot, A., Leblond, L.: Combined use of association rules mining and clustering methods to find relevant links between binary rare attributes in a large data set. Computational Statistics & Data Analysis 52(1), 596-613 (2007)
14. Pasquier, N., Bastide, Y., Touil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: Proceedings of 14th International Conference Bases de Données Avancées, Hammamet, Tunisia, October 26-30, pp. 177-196 (1998)
15. Zaki, M.J.: Generating Non-Redundant Association Rules. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, pp. 34-43 (August 2000)
16. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations 2(2), 66-75 (2000)