Generating positive and negative exact rules using formal concept analysis: Problems and solutions

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

Volumn 4933 LNAI, Issue , 2008, Pages 169-181

  Missaoui, Rokia ^a   Nourine, Lhouari ^b   Renaud, Yoan ^b  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; CHALLENGING PROBLEM; CONCEPT LATTICES; FORMAL CONCEPT ANALYSIS; FORMAL CONTEXTS; GLOBAL SET; INFERENCE RULES; INTERNATIONAL CONFERENCES; SET OF RULES;

ASSOCIATIVE PROCESSING; EXTRACTION; KETONES; SOLUTIONS; TURBULENT FLOW;

LAWS AND LEGISLATION;

EID: 49949092973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78137-0_13     Document Type: Conference Paper

References (23)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. pp. 487-499 (September 1994)
2. Alachaher, L.N., Guillaume, S.: Mining negative and positive influence rules using kullback-leibler divergence. ICCGI 00, 25 (2007)
3. Antonie, M.-L., Zaïane, O.R.: Mining positive and negative association rules: An approach for confined rules. In: Boulicaut, J.-F., et al. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 27-38. Springer, Heidelberg (2004)
4. Boulicaut, J.-F., Bykowski, A., Jeudy, B.: Towards the tractable discovery of association rules with negations. In: FQAS, pp. 425-434 (2000)
5. Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pp. 265-276. ACM Press, New York (1997)
6. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and ai. In: Flesca, S., et al. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549-564. Springer, Heidelberg (2002)
7. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618-628 (1996)
8. Ganter, B., Wille, R.: Contextual attribute logic. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol. 1640, pp. 377-388. Springer, Heidelberg (1999)
9. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York, Translator-C Franzke (1999)
10. Guigues, J.L., Duquenne, V.: Families minimales d'implications informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Humaines 95(1), 5-18 (1986)
11. Khachiyan, L., et al.: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4), 148-155 (2007)
12. Kryszkiewicz, M., Gajek, M.: Concise representation of frequent patterns based on generalized disjunction-free generators. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 159-171. Springer, Heidelberg (2002)
13. Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations (extended abstract). In: KDD, pp. 189-194 (1996)
14. Nourine, L., Raynaud, O.: A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell. 14(2-3), 217-227 (2002)
15. Pasquier, N., et al.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems 24(1), 25-46 (1999)
16. Pfaltz, J., Taylor, C.: Scientific discovery through iterative transformations of concept lattices. In: Proceedings of the 1st International Workshop on Discrete Math-ematics and Data Mining, April 2002, pp. 65-74 (2002)
17. Savasere, A., Omiecinski, E., Navathe, S.B.: Mining for strong negative associations in a large database of customer transactions. In: ICDE, pp. 494-502 (1998)
18. Ullman, J.D., Widom, J.: A First Course in Database Systems. Prentice-Hall, Englewood Cliffs (1997)
19. Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing galois (concept) lattices. Discrete Math. 256(3), 801-829 (2002)
20. Valtchev, P., Missaoui, R., Godin, R.: Formal concept analysis for knowledge discovery and data mining: The new challenges. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 352-371. Springer, Heidelberg (2004)
21. Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst. 22(3), 381-405 (2004)
22. Yuan, X., et al.: Mining negative association rules. In: ISCC 2002: Proceedings of the Seventh International Symposium on Computers and Communications, Washington, DC, USA, p. 623. IEEE Computer Society, Los Alamitos (2002)
23. Mohammed Javeed Zaki and Ching-Jiu Hsiao. Charm: An efficient algorithm for closed itemset mining. In: Proceedings of the Second SIAM International Conference on Data Mining, April 11-13, 2002, Arlington, VA, USA (2002)