Extraction of association rules based on literalsets

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

Volumn 4654, Issue , 2007, Pages 293-302

  Gasmi, G ^a,b   Ben Yahia, Sadok ^a   Nguifo, E M ^b   Bouker, S ^a  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^b Centre de Recherche en Informatique de Lens   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; KNOWLEDGE REPRESENTATION;

GENERIC BASIS; MINED KNOWLEDGE;

ASSOCIATION RULES;

EID: 38049021189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74553-2_27     Document Type: Conference Paper

References (13)

1. 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. ACM Press, New York (1993)
2. Hamrouni, T., Yahia, S.B., 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, Hermès, Grenoble, France, pp. 353-368 (2005)
3. Amir, A., Feldman, R., Kashi, R.: A new versatile method for association generation. In: Princ, of Data Mining and Knowledge Disc., pp. 221-231 (1997)
4. Brin, S., Motawni, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlation. In: Proceedings of the SIGMOD, Tucson, Arizona (USA), pp. 265-276 (1997)
5. Savasere, A., Omiecinski, E., Navathe, S.B.: Mining for strong negative associations in a large database of customer transactions. In: ICDE, Orlando, Florida, USA, pp. 494-502 (1998)
6. Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems, 381-405 (2004)
7. Antonie, M.L., Zaiane, O.R.: Mining positive and negative association rules: An approach for confined rules. Technical report, University of Alberta, Department of Computing Science (2004)
8. Kryszkiewicz, M., Cichon, K.: Support oriented discovery of generalized disjunction-free representation of frequent patterns with negation. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 672-682. Springer, Heidelberg (2005)
9. Kryszkiewicz, M.: Generalized disjunction-free representation of frequents patterns with at most k negations. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 468-472. Springer, Heidelberg (2006)
10. Morzy, M.: Efficient mining of dissociation rules. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol. 4081, Springer, Heidelberg (2006)
11. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)
12. Bouker, S., Gasmi, G., Yahia, S.B., Nguifo, E.M.: Extraction des bases génériques de régles dŠassociation généralisées. In: EGC 2007, Namur, Belgium (2007)
13. Bastide, Y., Pasquier, N., Taouil, R., Lakhal, L., Stumme, G.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings of the Intl. Conference DOOD'2000. LNCS, pp. 972-986. Springer, Heidelberg (2000)