{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:43:05Z","timestamp":1725536585598},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041730"},{"type":"electronic","value":"9783642041747"}],"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-04174-7_25","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T20:52:46Z","timestamp":1251319966000},"page":"382-397","source":"Crossref","is-referenced-by-count":2,"title":["Mining Databases to Mine Queries Faster"],"prefix":"10.1007","author":[{"given":"Arno","family":"Siebes","sequence":"first","affiliation":[]},{"given":"Diyah","family":"Puspitaningrum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Inkeri Verkamo, A.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI, Menlo Park (1996)"},{"issue":"4175","key":"25_CR2","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1126\/science.187.4175.398","volume":"187","author":"P.J. Bickel","year":"1975","unstructured":"Bickel, P.J., Hammel, E.A., O\u2019Connell, J.W.: Sex bias in graduate admissions: Data from berkeley. Science\u00a0187(4175), 398\u2013404 (1975)","journal-title":"Science"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 62\u201373. Springer, Heidelberg (2000)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"R. Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., Vitanyi, P.: Automatic meaning discovery using google. IEEE Transactions on Knowledge and Data Engineering\u00a019, 370\u2013383 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"25_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"Codd, E.F.: A relational model of data for large shared data banks. Communications of the ACM\u00a013(6), 377\u2013387 (1970)","journal-title":"Communications of the ACM"},{"key":"25_CR6","unstructured":"Coenen, F.: The LUCS-KDD discretised\/normalised ARM and CARM data library (2003), \n                    \n                      http:\/\/www.csc.liv.ac.uk\/~frans\/KDD\/Software\/LUCS_KDD_DN\/"},{"key":"25_CR7","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. John Wiley and Sons, Chichester (2006)","edition":"2"},{"key":"25_CR8","first-page":"3","volume-title":"Data Mining and Knowledge Discovery","author":"C. Faloutsos","year":"2007","unstructured":"Faloutsos, C., Megalooikonomou, V.: On data mining, compression and kolmogorov complexity. In: Data Mining and Knowledge Discovery, vol.\u00a015, pp. 3\u201320. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ijar.2005.10.003","volume":"42","author":"A.J. Feelders","year":"2006","unstructured":"Feelders, A.J., van der Gaag, L.C.: Learning bayesian network parameters under order constraints. Int. J. Approx. Reasoning\u00a042(1-2), 37\u201353 (2006)","journal-title":"Int. J. Approx. Reasoning"},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1114.001.0001","volume-title":"Advances in Minimum Description Length","author":"P.D. Gr\u00fcnwald","year":"2005","unstructured":"Gr\u00fcnwald, P.D.: Minimum description length tutorial. In: Gr\u00fcnwald, P.D., Myung, I.J. (eds.) Advances in Minimum Description Length. MIT Press, Cambridge (2005)"},{"issue":"11","key":"25_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM\u00a039(11), 58\u201364 (1996)","journal-title":"Communications of the ACM"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Jaroszewicz, S., Simovici, D.A.: Interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceedings KDD, pp. 178\u2013186 (2004)","DOI":"10.1145\/1014052.1014074"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Koopman, A., Siebes, A.: Discovering relational item sets efficiently. In: Proceedings SDM 2008, pp. 585\u2013592 (2008)","DOI":"10.1137\/1.9781611972788.10"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/772862.772871","volume":"4","author":"L. Raedt De","year":"2000","unstructured":"De Raedt, L.: A perspective on inductive databases. SIGKDD Explorations\u00a04(2), 69\u201377 (2000)","journal-title":"SIGKDD Explorations"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Siebes, A., Vreeken, J., van Leeuwen, M.: Item sets that compress. In: Proceedings of the SIAM Conference on Data Mining, pp. 393\u2013404 (2006)","DOI":"10.1137\/1.9781611972764.35"},{"key":"25_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/11871637_59","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M. Leeuwen van","year":"2006","unstructured":"van Leeuwen, M., Vreeken, J., Siebes, A.: Compression picks item sets that matter. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 585\u2013592. Springer, Heidelberg (2006)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Preserving privacy through data generation. In: Proceedings of the IEEE International Conference on Data Mining, pp. 685\u2013690 (2007)","DOI":"10.1109\/ICDM.2007.25"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04174-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T10:24:28Z","timestamp":1552127068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04174-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041730","9783642041747"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04174-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}