{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T22:10:15Z","timestamp":1739311815989,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037290"},{"type":"electronic","value":"9783642037306"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03730-6_12","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T06:41:58Z","timestamp":1251355318000},"page":"138-150","source":"Crossref","is-referenced-by-count":1,"title":["Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: ACM SIGMOD, Washington, USA, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"12_CR2","first-page":"553","volume-title":"SAC 2004","author":"E. Baralis","year":"2004","unstructured":"Baralis, E., Chiusano, S., Garza, P.: On Support Thresholds in Associative Classification. In: SAC 2004, Taipei, Taiwan, pp. 553\u2013558. ACM, New York (2004)"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations\u00a02(2), 66\u201375 (2000)","journal-title":"ACM SIGKDD Explorations"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45372-5_8","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS, vol.\u00a01910, pp. 75\u201385. Springer, Heidelberg (2000)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bykowski, A., Rigotti, C.: A Condensed Representation to Find Frequent Patterns. In: PODS 2001. ACM SIGACT-SIGMOD-SIGART, USA, pp. 267\u2013273 (2001)","DOI":"10.1145\/375551.375604"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining All Non-Derivable Frequent Itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS, vol.\u00a02431, pp. 74\u201385. Springer, Heidelberg (2002)"},{"key":"12_CR7","first-page":"171","volume-title":"Data Mining and Knowledge Discovery","author":"T. Calders","year":"2007","unstructured":"Calders, T., Goethals, B.: Non-Derivable Itemset Mining. In: Data Mining and Knowledge Discovery, vol.\u00a014, pp. 171\u2013206. Kluwer Academic Publishers, Dordrecht (2007)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11546849_42","volume-title":"Data Warehousing and Knowledge Discovery","author":"A. Casali","year":"2005","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Essential Patterns: A Perfect Cover of Frequent Patterns. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol.\u00a03589, pp. 428\u2013437. Springer, Heidelberg (2005)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-74553-2_27","volume-title":"Data Warehousing and Knowledge Discovery","author":"G. Gasmi","year":"2007","unstructured":"Gasmi, G., Ben Yahia, S., Mephu Nguifo, E., Bouker, S.: Extraction of Association Rules Based on Literalsets. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol.\u00a04654, pp. 293\u2013302. Springer, Heidelberg (2007)"},{"key":"12_CR10","first-page":"603","volume-title":"ICDM","author":"S.K. Harms","year":"2001","unstructured":"Harms, S.K., Deogun, J., Saquer, J., Tadesse, T.: Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints. In: ICDM, San Jose, USA, pp. 603\u2013606. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Concise Representation of Frequent Patterns Based on Disjunction\u2013Free Generators. In: ICDM 2001, San Jose, California, USA, pp. 305\u2013312 (2001)","DOI":"10.1109\/ICDM.2001.989533"},{"key":"12_CR12","unstructured":"Kryszkiewicz, M.: Concise Representations of Frequent Patterns and Association Rules. Publishing House of Warsaw University of Technology, Warsaw (2002)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Reducing Infrequent Borders of Downward Complete Representations of Frequent Patterns. In: The First Symposium on Databases, Data Warehousing and Knowledge Discovery, Baden-Baden, Germany, pp. 29\u201342 (2003)","DOI":"10.1145\/967900.968017"},{"key":"12_CR14","first-page":"559","volume-title":"SAC 2004","author":"M. Kryszkiewicz","year":"2004","unstructured":"Kryszkiewicz, M.: Reducing Borders of k-Disjunction Free Representations of Frequent Patterns. In: SAC 2004, Nikosia, Cyprus, pp. 559\u2013563. ACM, New York (2004)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Generalized Disjunction-Free Representation of Frequent Patterns with Negation. J. JETAI, 63\u201382 (2005)","DOI":"10.1080\/09528130512331315882"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Reasoning about Frequent Patterns with Negation. In: Kryszkiewicz, M. (ed.) Encyclopedia of Data Warehousing and Mining, pp. 941\u2013946. Information Sc. Publishing, Idea Group (2005)","DOI":"10.4018\/978-1-59140-557-3.ch177"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Using Generators for Discovering Certain and Generalized Decision Rules. In: Hybrid Intelligent Systems (HIS), pp. 181\u2013186 (2005)","DOI":"10.1109\/ICHIS.2005.105"},{"key":"12_CR18","series-title":"LNAI","first-page":"104","volume-title":"HAiS 2009","author":"M. Kryszkiewicz","year":"2009","unstructured":"Kryszkiewicz, M.: Closures of Downward Closed Representations of Frequent Patterns. In: Corchado, E., Wu, X., Oja, E., Herrero, \u00c1., Baruque, B. (eds.) HAiS 2009. LNCS (LNAI), vol.\u00a05572, pp. 104\u2013112. Springer, Heidelberg (2009)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Cicho\u0144, 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, vol.\u00a03518, pp. 672\u2013682. Springer, Heidelberg (2005)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02336, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"issue":"1","key":"12_CR21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1025828729955","volume":"22","author":"M. Kryszkiewicz","year":"2004","unstructured":"Kryszkiewicz, M., Rybi\u0144ski, H., Gajek, M.: Dataless Transitions between Concise Representations of Frequent Patterns. J. Int. Inf. Systems\u00a022(1), 41\u201370 (2004)","journal-title":"J. Int. Inf. Systems"},{"key":"12_CR22","first-page":"489","volume-title":"Advances in Soft Computing","author":"M. Kryszkiewicz","year":"2006","unstructured":"Kryszkiewicz, M., Skonieczny, \u0141.: Hierarchical Document Clustering Using Frequent Closed Sets. In: Advances in Soft Computing, pp. 489\u2013498. Springer, Heidelberg (2006)"},{"key":"12_CR23","unstructured":"Mannila, H., Toivonen, H.: Multiple Uses of Frequent Sets and Condensed Representations. In: KDD 1996, Portland, USA, pp. 189\u2013194 (1996)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/11871637_61","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"J. Muhonen","year":"2006","unstructured":"Muhonen, J., Toivonen, H.: Closed Non-derivable Itemsets. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS, vol.\u00a04213, pp. 601\u2013608. Springer, Heidelberg (2006)"},{"issue":"1","key":"12_CR25","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., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. J. Inf. Systems\u00a024(1), 25\u201346 (1999)","journal-title":"J. Inf. Systems"},{"key":"12_CR26","first-page":"378","volume-title":"ICDM","author":"J. Pei","year":"2002","unstructured":"Pei, J., Dong, G., Zou, W., Han, J.: On Computing Condensed Frequent Pattern Bases. In: ICDM, Maebashi, Japan, pp. 378\u2013385. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"12_CR27","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-540-73451-2_54","volume-title":"Rough Sets and Intelligent Systems Paradigms","author":"H. Rybi\u0144ski","year":"2007","unstructured":"Rybi\u0144ski, H., Kryszkiewicz, M., Protaziuk, G., Jakubowski, A., Delteil, A.: Discovering synonyms based on frequent termsets. In: Kryszkiewicz, M., Peters, J.F., Rybi\u0144ski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 516\u2013525. Springer, Heidelberg (2007)"},{"key":"12_CR28","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/967900.968011","volume-title":"SAC","author":"A. Savinov","year":"2004","unstructured":"Savinov, A.: Mining Dependence Rules by Finding Largest Itemset Support Quota. In: SAC, Taipei, Taiwan, pp. 525\u2013529. ACM, New York (2004)"},{"key":"12_CR29","unstructured":"Toivonen, H.: Discovery of Frequent Patterns in Large Data Collections. Ph.D. Thesis, Report A-1996-5, University of Helsinki (1996)"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03730-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:50:42Z","timestamp":1739310642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03730-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037290","9783642037306"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03730-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}