{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T04:05:52Z","timestamp":1749269152598,"version":"3.41.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent Information Systems"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1023\/a:1025828729955","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T19:29:37Z","timestamp":1067023777000},"page":"41-70","source":"Crossref","is-referenced-by-count":10,"title":["Dataless Transitions Between Concise Representations of Frequent Patterns"],"prefix":"10.1007","volume":"22","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Henryk","family":"Rybi\u0144ski","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Gajek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5144671_CR1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. (1996). Fast Discovery of Association Rules. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (Eds.), Advances in Knowledge Discovery and Data Mining. AAAI, CA."},{"issue":"2","key":"5144671_CR2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., and Lakhal, L. (2000). Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations, 2(2), 66-75.","journal-title":"ACM SIGKDD Explorations"},{"key":"5144671_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/375551.375604","volume-title":"Proc. of PODS' 01","author":"A. Bykowski","year":"2001","unstructured":"Bykowski, A. and Rigotti, C. (2001). A Condensed Representation to Find Frequent Patterns. In Proc. of PODS' 01 (pp. 267-273). Santa Barbara, CA, USA: ACM."},{"key":"5144671_CR4","first-page":"75","volume-title":"Proc. of PKDD 00","author":"J.F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.F., Bykowski, A., and Rigotti, C. (2000). Approximation of Frequency Queries by Means of Free-Sets. In Proc. of PKDD 00 (pp. 75-85). Lyon, France: Springer."},{"key":"5144671_CR5","first-page":"74","volume-title":"Proc. of PKDD' 02","author":"T. Calders","year":"2002","unstructured":"Calders, T. and Goethals, B. (2002). Mining All Non-derivable Frequent Itemsets. In Proc. of PKDD' 02 (pp. 74-85). Helsinki, Finland: Springer."},{"key":"5144671_CR6","unstructured":"Han, J. and Kamber, M. (2000). Data Mining: Concepts and Techniques. The Morgan Kaufmann Series in Data Management Systems, Morgan Kaufmann Publishers."},{"key":"5144671_CR7","first-page":"603","volume-title":"Proc. of ICDM' 01","author":"S.K. Harms","year":"2001","unstructured":"Harms, S.K., Deogun, J., Saquer, J., and Tadesse, T. (2001). Discovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints. In Proc. of ICDM' 01 (pp. 603-606). San Jose, CA, USA: IEEE Computer Society."},{"key":"5144671_CR8","first-page":"350","volume-title":"Proc. of IDA' 01","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M. (2001a). Closed Set Based Discovery of Representative Association Rules. In Proc. of IDA' 01 (pp. 350-359). Cascais, Portugal: Springer."},{"key":"5144671_CR9","first-page":"305","volume-title":"Proc. of ICDM' 01","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M. (2001b). Concise Representation of Frequent Patterns based on Disjunction-free Generators. In Proc. of ICDM' 01 (pp. 305-312). San Jose, CA, USA: IEEE Computer Society."},{"key":"5144671_CR10","first-page":"92","volume-title":"Proc. of ESF' 02","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M. (2002a). Concise Representations of Association Rules. In Proc. of ESF' 02 (pp. 92-109). London, UK: Springer."},{"key":"5144671_CR11","unstructured":"Kryszkiewicz, M. (2002b). Concise Representation of Frequent Patterns And Association Rules, Habilitation Thesis, Publishing House of the Warsaw University of Technology."},{"key":"5144671_CR12","unstructured":"Kryszkiewicz, M. (2002c). Converting Generators Representation and Closed Itemset Representations of Frequent Patterns. ICS Research Report, No. 27, Warsaw University of Technology."},{"key":"5144671_CR13","first-page":"159","volume-title":"Proc. of PAKDD' 02","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M. and Gajek, M. (2002a). Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators. In Proc. of PAKDD' 02 (pp. 159-171). Taipei, Taiwan: Springer."},{"key":"5144671_CR14","first-page":"383","volume-title":"Proc. of ISMIS' 02","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M. and Gajek, M. (2002b). Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns? In Proc. of ISMIS' 02 (pp. 383-392). Lyon, France: Springer."},{"key":"5144671_CR15","unstructured":"Pasquier, N. (2000). DM: Algorithmes d'extraction et de R\u00e9duction des R\u00e8gles d'association dans les Bases de Donn\u00e9es, Ph.D., Univ. B. Pascal-Clermont-Ferrand II."},{"key":"5144671_CR16","first-page":"398","volume-title":"Proc. of ICDT' 99","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999a). Discovering Frequent Closed Itemsets for Association Rules. In Proc. of ICDT' 99 (pp. 398-416). Jerusalem, Israel: Springer."},{"issue":"1","key":"5144671_CR17","first-page":"25","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999b). Efficient Mining of Association Rules Using Closed Itemset Lattices. Journal of Information Systems, 24(1), 25-46.","journal-title":"Journal of Information Systems"},{"key":"5144671_CR18","first-page":"21","volume-title":"Proc. of DMKD'00","author":"J. Pei","year":"2000","unstructured":"Pei, J., Han, J., and Mao, R. (2000). CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In Proc. of DMKD'00 (pp. 21-30). Dallas, TX, USA: ACM."},{"key":"5144671_CR19","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., and Lakhal, L. (2000). Fast Computation of Concept Lattices Using Data Mining Techniques. In Proc. of KRDB' 00 (pp. 129-139). Berlin, Germany."},{"key":"5144671_CR20","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. and Hsiao, C.J. (2002). CHARM: An Efficient Algorithm for Closed Itemset Mining. In Proc. of 2nd SIAM Int. Conf. on Data Mining, Arlington.","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025828729955.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025828729955\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025828729955.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:33:41Z","timestamp":1749220421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025828729955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["5144671"],"URL":"https:\/\/doi.org\/10.1023\/a:1025828729955","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"type":"print","value":"0925-9902"},{"type":"electronic","value":"1573-7675"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}