{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T10:50:42Z","timestamp":1773571842134,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,24]],"date-time":"2010-10-24T00:00:00Z","timestamp":1287878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10618-010-0203-9","type":"journal-article","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T05:33:25Z","timestamp":1287812005000},"page":"215-251","source":"Crossref","is-referenced-by-count":52,"title":["Summarizing transactional databases with overlapped hyperrectangles"],"prefix":"10.1007","volume":"23","author":[{"given":"Yang","family":"Xiang","sequence":"first","affiliation":[]},{"given":"Ruoming","family":"Jin","sequence":"additional","affiliation":[]},{"given":"David","family":"Fuhry","sequence":"additional","affiliation":[]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,24]]},"reference":[{"key":"203_CR1","doi-asserted-by":"crossref","unstructured":"Afrati FN, Gionis A, Mannila H (2004) Approximating a collection of frequent sets. In: KDD, pp 12\u201319","DOI":"10.1145\/1014052.1014057"},{"key":"203_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: VLDB, pp 487\u2013499"},{"key":"203_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Borgida A, Jagadish HV (1989) Efficient management of transitive relationships in large data, knowledge bases. In: SIGMOD Conference, pp 253\u2013262","DOI":"10.1145\/66926.66950"},{"key":"203_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: SIGMOD Conference, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"203_CR5","unstructured":"Agrawal A, Mannila H, Srikant R, Toivonen H, Verkamo A (1996) Fast discovery of association rules. Adv Knowl Discov Data Min 307\u2013308"},{"key":"203_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: SIGMOD Conference, pp 94\u2013105","DOI":"10.1145\/276305.276314"},{"key":"203_CR7","unstructured":"Besson J, Robardet C, De Raedt L, Boulicaut J-F (2006) Mining bi-sets in numerical data. In: KDID, pp 11\u201323"},{"issue":"1","key":"203_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J-F Boulicaut","year":"2003","unstructured":"Boulicaut J-F, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Discov 7(1): 5\u201322","journal-title":"Data Min Knowl Discov"},{"issue":"11","key":"203_CR9","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu T (2005) Mafia: a maximal frequent itemset\u00a0algorithm. IEEE Trans Knowl Data Eng 17(11): 1490\u20131504","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"203_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T Calders","year":"2007","unstructured":"Calders T, Goethals B (2007) Non-derivable itemset mining. Data Min Knowl Discov 14(1): 171\u2013206","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"203_CR11","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10115-006-0039-1","volume":"12","author":"V Chandola","year":"2007","unstructured":"Chandola V, Kumar V (2007) Summarization\u2014compressing data into an informative representation. Knowl Inf Syst 12(3): 355\u2013378","journal-title":"Knowl Inf Syst"},{"key":"203_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal V. (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4: 233\u2013235","journal-title":"Math Oper Res"},{"issue":"1","key":"203_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10618-006-0057-3","volume":"15","author":"C Faloutsos","year":"2007","unstructured":"Faloutsos C, Megalooikonomou V (2007) On data mining, compression, kolmogorov complexity. Data Min Knowl Discov 15(1): 3\u201320","journal-title":"Data Min Knowl Discov"},{"key":"203_CR14","unstructured":"Gao Byron J, Ester M (2006) Turning clusters into patterns: rectangle-based discriminative data description. In: ICDM, pp 200\u2013211"},{"key":"203_CR15","unstructured":"Gao Byron J, Ester M, Cai JY, Schulte O, Xiong H (2007) The minimum consistent subset cover problem, its applications in data mining. In: KDD, pp 310\u2013319"},{"key":"203_CR16","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: Discovery science, pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"203_CR17","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Sepp\u00e4nen JK (2004) Geometric, combinatorial tiles in 0-1 data. In: PKDD, pp 173\u2013184","DOI":"10.1007\/978-3-540-30116-5_18"},{"key":"203_CR18","volume-title":"Data mining: concepts, techniques, second edition","author":"J Han","year":"2006","unstructured":"Han J, Kamber M (2006) Data mining: concepts, techniques, second edition. Morgan Kaufmann, San Francisco"},{"issue":"1","key":"203_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper LH (1964) Optimal assignments of numbers to vertices. J Soc Ind Appl Math 12(1): 131\u2013135","journal-title":"J Soc Ind Appl Math"},{"issue":"337","key":"203_CR20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.2307\/2284710","volume":"67","author":"JA Hartigan","year":"1972","unstructured":"Hartigan JA (1972) Direct clustering of a data matrix. J Am Stat Assoc 67(337): 123\u2013129","journal-title":"J Am Stat Assoc"},{"key":"203_CR21","doi-asserted-by":"crossref","unstructured":"Jin R, Xiang Y, Fuhry D, Dragan FF (2008) Overlapping matrix pattern visualization: a hypergraph approach. In: ICDM, pp 313\u2013322 (\u00a9 IEEE, 2008. doi: 10.1109\/ICDM.2008.102 )","DOI":"10.1109\/ICDM.2008.102"},{"key":"203_CR22","doi-asserted-by":"crossref","unstructured":"Jin R, Xiang Y, Liu L (2009) Cartesian contour: a concise representation for a collection of frequent sets. In: KDD, pp 417\u2013426","DOI":"10.1145\/1557019.1557069"},{"key":"203_CR23","doi-asserted-by":"crossref","unstructured":"Johnson D, Krishnan S, Chhugani J, Kumar S, Venkatasubramanian S (2004) Compressing large boolean matrices using reordering techniques. In: VLDB, pp 13\u201323","DOI":"10.1016\/B978-012088469-8.50005-X"},{"key":"203_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer Verlag, New York"},{"key":"203_CR25","doi-asserted-by":"crossref","unstructured":"Lakshmanan LVS, Ng RT, Wang CX, Zhou X, Johnson TJ (2002) The generalized mdl approach for summarization. In: VLDB, pp 766\u2013777","DOI":"10.1016\/B978-155860869-6\/50073-1"},{"key":"203_CR26","doi-asserted-by":"crossref","unstructured":"Li T (2005) A general model for clustering binary data. In: KDD, pp 188\u2013197","DOI":"10.1145\/1081870.1081894"},{"issue":"1","key":"203_CR27","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira SC, Oliveira AL (2004) Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans Comput Biol Bioinf 1(1): 24\u201345","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"203_CR28","unstructured":"Minoux M (1977) Accelerated greedy algorithms for maximizing submodular set functions. In: the 8th IFIP Conference on Optimization Techniques"},{"key":"203_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0457-9","volume-title":"Mathematical classification and clustering","author":"B Mirkin","year":"1996","unstructured":"Mirkin B (1996) Mathematical classification and clustering. Kluwer Academic Publishers, Boston"},{"issue":"3","key":"203_CR30","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters R (2003) The maximum edge biclique problem is np-complete. Discret Appl Math 131(3): 651\u2013654","journal-title":"Discret Appl Math"},{"issue":"5","key":"203_CR31","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s10115-003-0133-6","volume":"6","author":"J Pei","year":"2004","unstructured":"Pei J, Dong G, Zou W, Han J (2004) Mining condensed frequent-pattern bases. Knowl Inf Syst 6(5): 570\u2013594","journal-title":"Knowl Inf Syst"},{"key":"203_CR32","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern coding theory","author":"TJ Richardson","year":"2008","unstructured":"Richardson TJ, Urbanke RL (2008) Modern coding theory. Cambridge University Press, Cambridge"},{"issue":"1","key":"203_CR33","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.jalgor.2004.10.004","volume":"60","author":"I Safro","year":"2006","unstructured":"Safro I, Ron D, Brandt A (2006) Graph minimum linear arrangement by multilevel weighted edge contractions. J Algorithms 60(1): 24\u201341","journal-title":"J Algorithms"},{"key":"203_CR34","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: SDM","DOI":"10.1137\/1.9781611972764.35"},{"key":"203_CR35","doi-asserted-by":"crossref","unstructured":"Steinbach M, Tan P-N, Kumar V (2004) Support envelopes: a technique for exploring the structure of association patterns. In: KDD, pp 296\u2013305","DOI":"10.1145\/1014052.1014086"},{"key":"203_CR36","doi-asserted-by":"crossref","unstructured":"van Leeuwen M, Vreeken J, Siebes A (2006) Compression picks item sets that matter. In: PKDD, pp 585\u2013592","DOI":"10.1007\/11871637_59"},{"key":"203_CR37","doi-asserted-by":"crossref","unstructured":"Vreeken J, van Leeuwen M, Siebes A (2007) Characterising the difference. In: KDD, pp 765\u2013774","DOI":"10.1145\/1281192.1281274"},{"issue":"1","key":"203_CR38","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10115-005-0216-7","volume":"9","author":"J Wang","year":"2006","unstructured":"Wang J, Karypis G (2006) On efficiently summarizing categorical databases. Knowl Inf Syst 9(1): 19\u201337","journal-title":"Knowl Inf Syst"},{"key":"203_CR39","doi-asserted-by":"crossref","unstructured":"Xiang Y, Jin R, Fuhry D, Dragan FF (2008) Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In: KDD, pp 758\u2013766 (\u00a9 ACM, 2008. http:\/\/doi.acm.org\/10.1145\/1401890.1401981 )","DOI":"10.1145\/1401890.1401981"},{"key":"203_CR40","unstructured":"Xin D, Han J, Yan X, Cheng H (2005) Mining compressed frequent-pattern sets. In: VLDB, pp 709\u2013720"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-010-0203-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-010-0203-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-010-0203-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T20:26:57Z","timestamp":1559766417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-010-0203-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,24]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s10618-010-0203-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,24]]}}}