{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:21:25Z","timestamp":1742941285420,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022784"},{"type":"electronic","value":"9783642022791"}],"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-02279-1_41","type":"book-chapter","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T02:51:59Z","timestamp":1242787919000},"page":"580-597","source":"Crossref","is-referenced-by-count":1,"title":["A Bipartite Graph Framework for Summarizing High-Dimensional Binary, Categorical and Numeric Data"],"prefix":"10.1007","author":[{"given":"Guanhua","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuli","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongqing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiwei","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Shuai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Frequent Itemset Mining Implementations Repository, \n                    \n                      http:\/\/fimi.cs.helsinki.fi\/"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: Proc. KDD 2004 (2004)","DOI":"10.1145\/1014052.1014057"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proc SIGMOD 1998 (1998)","DOI":"10.1145\/276304.276314"},{"key":"41_CR4","unstructured":"Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Chandola, V., Kumar, V.: Summarization - Compressing data into an informative representation. Knowl. Inf. Syst.\u00a012(3) (2007)","DOI":"10.1007\/s10115-006-0039-1"},{"key":"41_CR6","unstructured":"Cortez, P., Morais, A.: A Data Mining Approach to Predict Forest Fires using Meteorological Data. In: Proc. EPIA 2007 (2007)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Gao, B.J., Ester, M.: Turning Clusters into Patterns: Rectangle-based Discriminative Data Description. In: Proc. ICDM 2006 (2006)","DOI":"10.1109\/ICDM.2006.163"},{"key":"41_CR8","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proc. ICDM 2002 (2002)"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Hu, M., Liu, B.: Mining and summarizing customer reviews. In: Proc. KDD 2004 (2004)","DOI":"10.1145\/1014052.1014073"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, D., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: Proc. VLDB 2004 (2004)","DOI":"10.1016\/B978-012088469-8.50005-X"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Ng, R.T., Wang, C.X., Zhou, X., Johnson, T.J.: The Generalized MDL approach for Summarization. In: Proc. VLDB 2002 (2002)","DOI":"10.1016\/B978-155860869-6\/50073-1"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Liu, B., Hu, M., Hsu, W.: Multi-level organization and summarization of the discovered rules. In: Proc. KDD 2000 (2000)","DOI":"10.1145\/347090.347128"},{"key":"41_CR13","volume-title":"Advances in Automatic Text Summarization","author":"I. Mani","year":"1999","unstructured":"Mani, I.: Advances in Automatic Text Summarization. MIT Press, Cambridge (1999)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Navlakha, S., Rastogi, R., Shrivastava, N.: Graph Summarization with Bounded Error. In: Proc. SIGMOD 2008 (2008)","DOI":"10.1145\/1376616.1376661"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Siebes, A., Vreeken, J., Leeuwen, M.: Item Sets that Compress. In: Proc. SDM (2006)","DOI":"10.1137\/1.9781611972764.35"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by the shortest data description. Automatica\u00a014, 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient Aggregation for Graph Summarization. In: Proc. SIGMOD 2008 (2008)","DOI":"10.1145\/1376616.1376675"},{"issue":"1","key":"41_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10115-005-0216-7","volume":"9","author":"J. Wang","year":"2006","unstructured":"Wang, J., Karypis, G.: On Efficiently Summarizing Categorical Databases. Knowl. Inf. Syst.\u00a09(1), 19\u201337 (2006)","journal-title":"Knowl. Inf. Syst."},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Jin, R., Fuhry, D., Dragan, F.F.: Succinct Summarization of Transactional Databases: An Overlapped Hyperrectangle Scheme. In: Proc. KDD (2008)","DOI":"10.1145\/1401890.1401981"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S., Cheng, H.: Mining Colossal Frequent Patterns by Core Pattern Fusion. In: Proc. ICDE 2007 (2007)","DOI":"10.1109\/ICDE.2007.367916"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02279-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T23:58:05Z","timestamp":1552003085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02279-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022784","9783642022791"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02279-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}