{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T05:43:40Z","timestamp":1738129420353,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781363"},{"type":"electronic","value":"9783540781370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78137-0_13","type":"book-chapter","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T04:34:46Z","timestamp":1202963686000},"page":"169-181","source":"Crossref","is-referenced-by-count":7,"title":["Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions"],"prefix":"10.1007","author":[{"given":"Rokia","family":"Missaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoan","family":"Renaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. pp. 487\u2013499 (September 1994)"},{"key":"13_CR2","first-page":"25","volume":"00","author":"L.N. Alachaher","year":"2007","unstructured":"Alachaher, L.N., Guillaume, S.: Mining negative and positive influence rules using kullback-leibler divergence. ICCGI\u00a000, 25 (2007)","journal-title":"ICCGI"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Antonie, M.-L., Za\u00efane, O.R.: Mining positive and negative association rules: An approach for confined rules. In: PKDD, pp. 27\u201338 (2004)","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., Bykowski, A., Jeudy, B.: Towards the tractable discovery of association rules with negations. In: FQAS, pp. 425\u2013434 (2000)","DOI":"10.1007\/978-3-7908-1834-5_39"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/253260.253327","volume-title":"SIGMOD \u201997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: SIGMOD \u201997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pp. 265\u2013276. ACM Press, New York (1997)"},{"key":"13_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T. Eiter","year":"2002","unstructured":"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.\u00a02424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms\u00a021(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Contextual attribute logic. In: ICCS, pp. 377\u2013388 (1999)","DOI":"10.1007\/3-540-48659-3_23"},{"key":"13_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York, Translator-C. Franzke (1999)"},{"issue":"1","key":"13_CR10","first-page":"5","volume":"95","author":"J.L. Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines\u00a095(1), 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ipl.2006.09.006","volume":"101","author":"L. Khachiyan","year":"2007","unstructured":"Khachiyan, L., et al.: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett.\u00a0101(4), 148\u2013155 (2007)","journal-title":"Inf. Process. Lett."},{"key":"13_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-47887-6_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2002","unstructured":"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.\u00a02336, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"13_CR13","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations (extended abstract). In: KDD, pp. 189\u2013194 (1996)"},{"issue":"2-3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/09528130210164152","volume":"14","author":"L. Nourine","year":"2002","unstructured":"Nourine, L., Raynaud, O.: A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell.\u00a014(2-3), 217\u2013227 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., et al.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"13_CR16","unstructured":"Pfaltz, J., Taylor, C.: Scientific discovery through iterative transformations of concept lattices. In: Proceedings of the 1st International Workshop on Discrete Mathematics and Data Mining, April 2002, pp. 65\u201374 (2002)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: Mining for strong negative associations in a large database of customer transactions. In: ICDE, pp. 494\u2013502 (1998)","DOI":"10.1109\/ICDE.1998.655812"},{"key":"13_CR18","volume-title":"A First Course in Database Systems","author":"J.D. Ullman","year":"1997","unstructured":"Ullman, J.D., Widom, J.: A First Course in Database Systems. Prentice-Hall, Englewood Cliffs (1997)"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0012-365X(02)00349-7","volume":"256","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing galois (concept) lattices. Discrete Math.\u00a0256(3), 801\u2013829 (2002)","journal-title":"Discrete Math."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Valtchev, P., Missaoui, R., Godin, R.: Formal concept analysis for knowledge discovery and data mining: The new challenges. In: ICFCA, pp. 352\u2013371 (2004)","DOI":"10.1007\/978-3-540-24651-0_30"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X. Wu","year":"2004","unstructured":"Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst.\u00a022(3), 381\u2013405 (2004)","journal-title":"ACM Trans. Inf. Syst."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/ISCC.2002.1021739","volume-title":"ISCC 2002: Proceedings of the Seventh International Symposium on Computers and Communications (ISCC 202)","author":"X. Yuan","year":"2002","unstructured":"Yuan, X., et al.: Mining negative association rules. In: ISCC 2002: Proceedings of the Seventh International Symposium on Computers and Communications (ISCC 202), Washington, DC, USA, p. 623. IEEE Computer Society, Los Alamitos (2002)"},{"key":"13_CR23","unstructured":"Mohammed\u00a0Javeed 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)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78137-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T15:38:35Z","timestamp":1738078715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781363","9783540781370"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_13","relation":{},"subject":[]}}