{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:13:36Z","timestamp":1794381216754,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540233572","type":"print"},{"value":"9783540302148","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30214-8_22","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:19:01Z","timestamp":1285082341000},"page":"278-289","source":"Crossref","is-referenced-by-count":149,"title":["Tiling Databases"],"prefix":"10.1007","author":[{"given":"Floris","family":"Geerts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, ch. 12, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"key":"22_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"22_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-540-24775-3_73","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J. Besson","year":"2004","unstructured":"Besson, J., Robardet, C., Boulicaut, J.-F.: Constraint-based mining of formal concepts in transactional data. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 615\u2013624. Springer, Heidelberg (2004)"},{"key":"22_CR4","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: Proceedings of KDD 2003, pp. 89\u201398 (2003)","DOI":"10.1145\/956750.956764"},{"issue":"4","key":"22_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery\u00a08(1), 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"22_CR8","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proceedings of ICDM 2002, pp. 211\u2013218 (2002)"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/380995.381033","volume":"2","author":"R. Kohavi","year":"2000","unstructured":"Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers\u2019 report: Peeling the onion. SIGKDD Explorations\u00a02(2), 86\u201398 (2000), http:\/\/www.ecn.purdue.edu\/KDDCUP","journal-title":"SIGKDD Explorations"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity, Cambridge (1996)","DOI":"10.1017\/CBO9780511574948"},{"key":"22_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-39804-2_30","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"T. Mielik\u00e4inen","year":"2003","unstructured":"Mielik\u00e4inen, T., Mannila, H.: The pattern ordering problem. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 327\u2013338. Springer, Heidelberg (2003)"},{"key":"22_CR12","first-page":"211","volume":"39","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Containment in graph theory: covering graphs with cliques. Indigationes Mathematicae\u00a039, 211\u2013128 (1977)","journal-title":"Indigationes Mathematicae"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R. Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique is NP-complete. Discrete Applied Mathematics\u00a0131, 651\u2013654 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Ron, D., Mishra, N., Swaminathan, R.: On conjunctive clustering. In: Proceedings of COLT 2003, pp. 448\u2013462 (2003)","DOI":"10.1007\/978-3-540-45167-9_33"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Seno, M., Karypis, G.: LPMiner: An algorithm for finding frequent itemsets using length-decreasing support constraint. In: Proceedings of ICDM 2001, pp. 505\u2013512 (2001)","DOI":"10.1109\/ICDM.2001.989558"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of KDD 2002, pp. 32\u201341 (2002)","DOI":"10.1145\/775047.775053"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Karypis, G.: BAMBOO: Accelerating closed itemset mining by deeply pushing the length-decreasing support constraint. In: Proceedings of SIAM DM 2004 (2004)","DOI":"10.1137\/1.9781611972740.41"},{"issue":"3","key":"22_CR18","first-page":"372","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE TKDE\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE TKDE"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithms for closed itemset mining. In: Grossman, R., Han, J., Kumar, V., Mannila, H., Motwani, R. (eds.) Proceedings of SIAM DM 2002 (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30214-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:49:46Z","timestamp":1605743386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30214-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233572","9783540302148"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30214-8_22","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b100845","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}