{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:49:08Z","timestamp":1780566548389,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10844-005-0266-z","type":"journal-article","created":{"date-parts":[[2005,2,15]],"date-time":"2005-02-15T10:45:16Z","timestamp":1108464316000},"page":"29-60","source":"Crossref","is-referenced-by-count":114,"title":["Generating a Condensed Representation for Association Rules"],"prefix":"10.1007","volume":"24","author":[{"given":"Nicolas","family":"Pasquier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafik","family":"Taouil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yves","family":"Bastide","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerd","family":"Stumme","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., and Swami, A. (1993). Mining Association Rules Between Sets of Items in Large Databases. In Proceedings of the SIGMOD Conference, pp. 207?216.","DOI":"10.1145\/170035.170072"},{"key":"CR2","unstructured":"Agrawal, R. and Srikant, R. (1994). Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the VLDB Conference, pp. 478?499."},{"key":"CR3","unstructured":"Armstrong, W.W. (1974). Dependency Structures of Data Base Relationships. In Proceedings of the IFIP Congress, pp. 580?583."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Baralis, E. and Psaila, G. (1997). Designing Templates for Mining Association Rules. Journal of Intelligent Information Systems, 9(1), 7?32; L. Kerschberg, Z. Ras, and M. Zemankova (Eds.), Kluwer Academic Publishers.","DOI":"10.1023\/A:1008637019359"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Taouil, Y., Pasquier, N., Stumme, G., and Lakhal, L. (2000). Mining Frequent Patterns with Counting Inference. SIGKDD Explorations, 2(2), 66?75; U. Fayyad, S. Sarawagi and P. Bradley (Eds.), ACMComputer Press.","DOI":"10.1145\/380995.381017"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. (1998). Efficiently Mining Long Patterns from Databases. In Proceedings of the SIGMOD Conference, pp. 85?93.","DOI":"10.1145\/276304.276313"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. and Agrawal, R. (1999). Mining the Most Interesting Rules.In Proceedings of the KDD Conference, pp. 145?154.","DOI":"10.1145\/312129.312219"},{"key":"CR8","unstructured":"Bayardo, R.J., Agrawal, R., and Gunopulos, D. (2000).Constraint-Based Rule Mining in Large, Dense Databases. Data Mining and Knowledge Discovery, 4(2\/3), 217?240; S. Chaudhuri (Ed.), Kluwer Academic Publishers."},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C. Beeri","year":"1979","unstructured":"Beeri, C. and Bernstein, P.A. (1979). Computational Problems Related to the Design of Normal form Relational Schemas. Transactions on Database Systems, 4(1), 30?59.","journal-title":"Transactions on Database Systems"},{"key":"CR10","unstructured":"Blake, C.L. and Merz, C.J. (1998). UCI Machine Learning Databases Repository. University of California, Irvine, Department of Information and Computer Science, http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., and Silverstein, C. (1997.) Beyond Market Baskets: Generalizing Association Rules to Correlation. In Proceedings of the SIGMOD Conference, pp. 265?276.","DOI":"10.1145\/253260.253327"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., and Tsur, S. (1997). Dynamic Itemset Counting and Implication Rules for Market Basket Data. In Proceedings of the SIGMOD Conference, pp. 255?264.","DOI":"10.1145\/253260.253325"},{"issue":"95","key":"CR13","first-page":"5","volume":"24","author":"V. Duquenne","year":"1986","unstructured":"Duquenne, V. and Guigues, J.-L. (1986). Famille Minimale d?implications Informatives r\u00e9sultant d?un Tableau de donn\u00e9es Binaires.Math\u00e9matiques et Sciences Humaines, 24(95), 5?18.","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Ganter, B. and Wille, R. (1999.) Formal Concept Analysis: Mathematical Foundations. Springer-Verlag.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"CR15","unstructured":"Han, J. and Fu, Y. (1999). Mining Multiple-Level Association Rules in Large Databases. Transactions on Knowledge and Data Engineering, 11(5), 798?804; P.-S. Yu (Ed.), IEEE Computer Science"},{"key":"CR16","unstructured":"Hettich, S. and Bay, S.D. (1999.) UCI Knowledge Discovery in Databases Archive. University of California, Irvine, Department of Information and Computer Science,http:\/\/kdd.ics.uci.edu"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., and Verkamo, A.I. (1994). Finding interesting Rules from Large Sets of Discovered Association Rules. In Proceedings of the CIKM conference, pp. 401?407.","DOI":"10.1145\/191246.191314"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Lin, D. and Kedem, Z.M. (1998). Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. In Proceedings of the EDBT Conference, pp. 105?119.","DOI":"10.1007\/BFb0100980"},{"key":"CR19","unstructured":"Liu, B., Hsu, W., and Ma, Y. (1999). Pruning and Summarizing the Discovered Association Rules. In Proceedings of the KDD Conference, pp. 125?134."},{"issue":"113","key":"CR20","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"Luxenburger, M. (1991). Implications Partielles Dans un Contexte. Math\u00e9matiques, Informatique et Sciences Humaines, 29(113), 35?55.","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"issue":"4","key":"CR21","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D. Maier","year":"1980","unstructured":"Maier, D. (1980). Minimum Covers in Relational Database Model. Journal of the ACM, 27(4), 664?674; ACM Computer Press.","journal-title":"Journal of the ACM"},{"key":"CR22","unstructured":"Mannila, H. and Toivonen, H. (1996). Multiple Uses of Frequent Sets and Condensed Representations. In Proceedings of the KDD Conference, pp. 189?194."},{"key":"CR23","unstructured":"Mannila, H. and Toivonen, H. (1997). Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(3), 241?258; U. Fayyad (Ed.), Kluwer Academic Publishers."},{"key":"CR24","unstructured":"Mannila, H., Toivonen, H., and Verkamo, A.I. (1994). Efficient Algorithms for Discovering Association Rules. In Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, pp. 181?192."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Meo, R., Psaila, G., and Ceri, S. (1998). An Extension to SQL for MiningAssociation Rules. Data Mining and Knowledge Discovery, 2(2), 195?224, U. Fayyad (Ed.), Kluwer Academic Publishers.","DOI":"10.1023\/A:1009774406717"},{"key":"CR26","unstructured":"Morimoto, Y., Fukuda, T., Matsuzawa, H., Tokuyama, T., and Yoda, K. (1998). Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases. In Proceedings of the VLDB Conference, pp. 380?391."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, V.S., Han, J., and Pang, A. (1998). Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In Proceedings ofthe SIGMOD Conference, pp. 13?24.","DOI":"10.1145\/276304.276307"},{"key":"CR28","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1998). Pruning Closed Itemset Lattices for Association Rules. In Proceedings of the BDA Conference, pp. 177?196."},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999). Discovering Frequent Closed Itemsets for Association Rules. In Proceedings of the ICDT Conference, LNCS 1540, pp. 398?416.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999). Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems, 24(1), 25?46; M. Jarke and D. Shasha (Eds.), Elsevier Science.","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"CR31","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999). Closed SetBased Discovery of Small Covers for Association Rules. In Proceedings of the BDA Conference, pp. 361?381."},{"key":"CR32","unstructured":"Pei, J., Han, J., and Mao, R. (2000). Closet: An Efficient Algorithm for Mining Frequent Closed Itemsets. In Proceedings of the DMKD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21?30."},{"key":"CR33","unstructured":"Piatetsky-Shapiro, G. and Matheus, C.J. (1994). The Interestingness of Deviations. In Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, pp. 25?36."},{"issue":"6","key":"CR34","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/69.553165","volume":"8","author":"A. Silberschatz","year":"1996","unstructured":"Silberschatz, A. and Tuzhilin, A. (1996). What Makes Patterns Interesting in Knowledge Discovery Systems. Transactions on Knowledge and Data Engineering, 8(6), 970?974; IEEE Computer Science.","journal-title":"Transactions on Knowledge and Data Engineering"},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"Silverstein, C., Brin, S., and Motwani, R. (1998). Beyond Market Baskets: Generalizing Association Rules to Dependence Rules. Data Miningand Knowledge Discovery, 2(1), 39?68; U. Fayyad (Ed.), Kluwer AcademicPublishers.","DOI":"10.1023\/A:1009713703947"},{"key":"CR36","unstructured":"Srikant, R. and Agrawal, R. (1995). Mining Generalized Association Rules. In Proceedings of the VLDB Conference, pp. 407?419."},{"key":"CR37","doi-asserted-by":"crossref","unstructured":"Srikant, R. and Agrawal, R. (1996). Mining Quantitative Association Rules in Large Relational Tables. In Proceedings of the SIGMOD Conference, pp. 1?12.","DOI":"10.1145\/233269.233311"},{"key":"CR38","unstructured":"Srikant, R., Vu, Q., and Agrawal, R. (1997). Mining Association Rules with Item Constraints. In Proceedings of the KDD Conference, pp. 67?73."},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"Taouil, R., Pasquier, N., Bastide, Y., and Lakhal, L. (2000). Mining Bases for Association Rules Using Closed Sets. In Proceedings of theICDE Conference, p. 307.","DOI":"10.1109\/ICDE.2000.839424"},{"key":"CR40","unstructured":"Toivonen, H., Klemettinen, M., Ronkainen, P., H\u00e4t\u00f6nen, K.,and Mannila, H. (1995). Pruning and Grouping Discovered Association Rules. In Proceedings of the ECML Workshop, pp. 47?52."},{"key":"CR41","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. (2000). Generating Non-Redundant Association Rules. In Proceedings of the KDD Conference, pp. 34?43.","DOI":"10.1145\/347090.347101"},{"key":"CR42","unstructured":"Zaki, M.J. and Hsiao, C.-J. (1999). ChARM: An Efficient Algorithm for Closed Association Rule Mining. Technical Report 99-10."},{"key":"CR43","unstructured":"Zaki, M.J. and Ogihara, M. (1998). Theoretical Foundations of Association Rules. In Proceedings of the DMKD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 7:1?7:8."},{"key":"CR44","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li, W. (1997). New Algorithms for Fast Discovery of Association Rules. In Proceedings of the KDD Conference, pp. 283?286."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-005-0266-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-005-0266-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-005-0266-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T19:40:58Z","timestamp":1586115658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-005-0266-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["266"],"URL":"https:\/\/doi.org\/10.1007\/s10844-005-0266-z","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}