{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:23:05Z","timestamp":1725531785399},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642012082"},{"type":"electronic","value":"9783642012099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01209-9_7","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T12:58:23Z","timestamp":1241441903000},"page":"73-82","source":"Crossref","is-referenced-by-count":0,"title":["Mining Subspace Clusters from Distributed Data"],"prefix":"10.1007","author":[{"given":"Haiyun","family":"Bian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/276304.276314","volume-title":"Proceedings of the 1998 ACM SIGMOD international conference on Management of data (SIGMOD 1998)","author":"R. Agrawal","year":"1998","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data (SIGMOD 1998), pp. 94\u2013105. ACM Press, New York (1998)"},{"key":"7_CR2","unstructured":"Blake, C., Merz, C.: UCI repository of machine learning databases (1998), \n                  \n                    http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikanta, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002) (2002)","DOI":"10.1145\/775047.775080"},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kroger, P., Pryakhin, A., Schubert, M.: Effective and efficient distributed model-based clustering. In: Proceedings of Fifth International Conference on Data Mining (ICDM 2005), pp. 258\u2013265 (November 2005)","DOI":"10.1109\/ICDM.2005.53"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","first-page":"246","volume-title":"Secure Data Management","author":"P. Kroger","year":"2004","unstructured":"Kroger, P., Kriegel, H.P., Kailing, K.: Density-connected subspace clustering for highdimensional data. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2004. LNCS, vol.\u00a03178, pp. 246\u2013257. Springer, Heidelberg (2004)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"key":"7_CR8","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 problem is np-complete. Discrete Applied Mathematics\u00a0131, 651\u2013654 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: Charm: an efficient algorithm for closed itemset mining. In: Proceedings of the Second SIAM International Conference on Data Mining (SDM 2004) (April 2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Studies in Computational Intelligence","Computer and Information Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01209-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T05:58:59Z","timestamp":1619762339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01209-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642012082","9783642012099"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01209-9_7","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}