{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:15:38Z","timestamp":1737436538535,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745525"},{"type":"electronic","value":"9783540745532"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74553-2_27","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T03:07:48Z","timestamp":1187838468000},"page":"293-302","source":"Crossref","is-referenced-by-count":13,"title":["Extraction of Association Rules Based on Literalsets"],"prefix":"10.1007","author":[{"given":"Ghada","family":"Gasmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Engelbert Mephu","family":"Nguifo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slim","family":"Bouker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","first-page":"207","volume-title":"Proceedings of the ACM SIGMOD Intl. Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"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\u2013216. ACM Press, New York (1993)"},{"key":"27_CR2","unstructured":"Hamrouni, T., Yahia, S.B., Slimani, Y.: Prince: Extraction optimis\u00e9e des bases g\u00e9n\u00e9riques de r\u00e9gles sans calcul de fermetures. In: Proceedings of the Intl. INFORSID Conference, Herm\u00e9s, Grenoble, France, pp. 353\u2013368 (2005)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Amir, A., Feldman, R., Kashi, R.: A new versatile method for association generation. In: Princ. of Data Mining and Knowledge Disc., pp. 221\u2013231 (1997)","DOI":"10.1007\/3-540-63223-9_121"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Brin, S., Motawni, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlation. In: Proceedings of the SIGMOD, Tucson, Arizona (USA), pp. 265\u2013276 (1997)","DOI":"10.1145\/253260.253327"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: Mining for strong negative associa- tions in a large database of customer transactions. In: ICDE, Orlando, Florida, USA, pp. 494\u2013502 (1998)","DOI":"10.1109\/ICDE.1998.655812"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems, 381\u2013405 (2004)","DOI":"10.1145\/1010614.1010616"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"27_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/11430919_77","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2005","unstructured":"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.\u00a03518, pp. 672\u2013682. Springer, Heidelberg (2005)"},{"key":"27_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/11731139_54","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2006","unstructured":"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.\u00a03918, pp. 468\u2013472. Springer, Heidelberg (2006)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11823728_22","volume-title":"Data Warehousing and Knowledge Discovery","author":"M. Morzy","year":"2006","unstructured":"Morzy, M.: Efficient mining of dissociation rules. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol.\u00a04081, Springer, Heidelberg (2006)"},{"key":"27_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)"},{"key":"27_CR12","unstructured":"Bouker, S., Gasmi, G., Yahia, S.B., Nguifo, E.M.: Extraction des bases g\u00e9n\u00e9riques de r\u00e9gles d\u0160association g\u00e9n\u00e9ralis\u00e9es. In: EGC 2007, Namur, Belgium (2007)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Proceedings of the Intl. Conference DOOD 2000","author":"Y. Bastide","year":"2000","unstructured":"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\u2013986. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74553-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T14:57:43Z","timestamp":1737385063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74553-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745525","9783540745532"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74553-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}