{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T07:40:07Z","timestamp":1739173207345,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642023187"},{"type":"electronic","value":"9783642023194"}],"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-02319-4_13","type":"book-chapter","created":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T06:34:09Z","timestamp":1245479649000},"page":"104-112","source":"Crossref","is-referenced-by-count":2,"title":["Closures of Downward Closed Representations of Frequent Patterns"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_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"},{"issue":"2","key":"13_CR2","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":"13_CR3","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":"13_CR4","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":"13_CR5","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":"13_CR6","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":"13_CR7","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":"13_CR8","volume-title":"Concise Representations of Frequent Patterns and Association Rules","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M.: Concise Representations of Frequent Patterns and Association Rules. Publishing House of Warsaw University of Technology, Warsaw (2002)"},{"key":"13_CR9","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":"13_CR10","first-page":"559","volume-title":"ACM Symposium on Applied Computing (SAC)","author":"M. Kryszkiewicz","year":"2004","unstructured":"Kryszkiewicz, M.: Reducing Borders of k-Disjunction Free Representations of Frequent Patterns. In: ACM Symposium on Applied Computing (SAC), pp. 559\u2013563. ACM, Nikosia (2004)"},{"key":"13_CR11","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":"13_CR12","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":"13_CR13","first-page":"41","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":"13_CR14","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":"13_CR15","unstructured":"Mannila, H., Toivonen, H.: Multiple Uses of Frequent Sets and Condensed Representations. In: KDD 1996, Portland, USA, pp. 189\u2013194 (1996)"},{"key":"13_CR16","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)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Nykiel, T., Rybinski, H.: Word Sense Discovery for Web Information Retrieval. In: MCD Workshop (ICDM) 2008, Piza (2008)","DOI":"10.1109\/ICDMW.2008.10"},{"issue":"1","key":"13_CR18","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":"13_CR19","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. Rybinski","year":"2007","unstructured":"Rybinski, H., Kryszkiewicz, M., Protaziuk, G., Jakubowski, A., Delteil, A.: Discovering Synonyms based on Frequent Termsets. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol.\u00a04585, pp. 516\u2013525. Springer, Heidelberg (2007)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-68416-9_7","volume-title":"Mining Complex Data","author":"H. Rybinski","year":"2008","unstructured":"Rybinski, H., Kryszkiewicz, M., Protaziuk, G., Kontkiewicz, A., Marcinkowska, K., Delteil, A.: Discovering Word Meanings Based on Frequent Termsets. In: Ra\u015b, Z.W., Tsumoto, S., Zighed, D.A. (eds.) MCD 2007. LNCS, vol.\u00a04944, pp. 82\u201392. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligence Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02319-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T07:06:13Z","timestamp":1739171173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02319-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023187","9783642023194"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02319-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}