{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:16Z","timestamp":1725558496128},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408130"},{"type":"electronic","value":"9783540452317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45231-7_53","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:56:20Z","timestamp":1277495780000},"page":"578-588","source":"Crossref","is-referenced-by-count":3,"title":["Condensed Representations in Presence of Missing Values"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Rioult","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings of the 6th International Conference on Deductive and Object Databases (DOOD 2000), pp. 972\u2013986 (2000)","DOI":"10.1007\/3-540-44957-4_65"},{"key":"53_CR3","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a01910, pp. 75\u201385. Springer, Heidelberg (2000)"},{"issue":"1","key":"53_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery journal\u00a07(1), 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery journal"},{"key":"53_CR5","volume-title":"Proceedings of the 22nd Annual International Conference of the Specialist Group on Artificial Intelligence (ES 2002)","author":"B. Cr\u00e9milleux","year":"2002","unstructured":"Cr\u00e9milleux, B., Boulicaut, J.F.: Simplest rules characterizing classes generated by delta-free sets. In: Proceedings of the 22nd Annual International Conference of the Specialist Group on Artificial Intelligence (ES 2002). Springer, Heidelberg (2002)"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Durand, N., Cr\u00e9milleux, B.: Ecclat: a new approach of clusters discovery in categorical data. In: 22nd Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence (ES 2002), December 2002, pp. 177\u2013190 (2002)","DOI":"10.1007\/978-1-4471-0651-7_13"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Grzymala-Busse, J., Hu, M.: A comparison of several approaches to missingattribute values in data mining. In: International Conference on Rough Sets and Current Trends in Computing, Banff, Canada (2000)","DOI":"10.1007\/3-540-45554-X_46"},{"key":"53_CR8","unstructured":"Jami, S., Liu, X., Loizou, G.: Learning from an incomplete and uncertain data set: The identification of variant haemoglobins. In: The Workshop on Intelligent Data Analysis in Medicine and Pharmacology, European Conference on Artificial Intelligence, Brighton, August 23th-28th (1998)"},{"key":"53_CR9","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations (extended abstract). In: Knowledge Discovery and Data Mining, pp. 189\u2013194 (1996)"},{"issue":"3","key":"53_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"53_CR11","unstructured":"Set of databases for the data mining. Provided by the university of californy, irvine, \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"1","key":"53_CR12","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. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"53_CR13","unstructured":"Piatetsky-Shapiro, G.: Discovery, analysis and presentation of strong rules. Knowledge Discovery in Databases, 229\u2013248 (1991)"},{"key":"53_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-64383-4_22","volume-title":"Research and Development in Knowledge Discovery and Data Mining","author":"A. Ragel","year":"1998","unstructured":"Ragel, A., Cr\u00e9milleux, B.: Treatment of missing values for association rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol.\u00a01394, pp. 258\u2013270. Springer, Heidelberg (1998)"},{"key":"53_CR15","unstructured":"Rioult, F.: Repr\u00e9sentation condens\u00e9e pour les bases de donn\u00e9es ad\u00e9quate auxvaleurs manquantes. Technical Report, 60 pages, GREYC, Universit\u00e9 de Caen (2002)"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45231-7_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:55:47Z","timestamp":1558421747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45231-7_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408130","9783540452317"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45231-7_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}