{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:35:25Z","timestamp":1752230125196},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414292"},{"type":"electronic","value":"9783540444671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44467-x_48","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:21:46Z","timestamp":1184602906000},"page":"525-536","source":"Crossref","is-referenced-by-count":21,"title":["A Scalable Approach to Balanced, High-Dimensional Clustering of Market-Baskets"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Strehl","sequence":"first","affiliation":[]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,8]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1117\/12.381756","volume":"4057","author":"A. Strehl","year":"2000","unstructured":"Strehl, A., hosh, J.: Value-based customer grouping from large retail data-sets. Proc. SPIE Vol. 4057, (2000) 33\u201342.","journal-title":"Proc. SPIE Vol"},{"key":"48_CR2","volume-title":"Algorithms for Clustering Data","author":"A. K. Jain","year":"1988","unstructured":"Jain, A. K., Dubes, R. C.: Algorithms for Clustering Data. Prentice Hall, New Jersey (1988)"},{"key":"48_CR3","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Rastogi, R., Shim, K.: Scalable algorithms for mining large databases. In Jiawei Han, (ed), KDD-99 Tutorial Notes. ACM (1999)","DOI":"10.1145\/312179.312187"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: Rock: a robust clustering algorithm for categorical attributes. Proc.15th Int\u2019l Conf. on Data Engineering (1999)","DOI":"10.1109\/ICDE.1999.754967"},{"issue":"8","key":"48_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Han, E., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 32(8), (1999) 68\u201375","journal-title":"IEEE Computer"},{"key":"48_CR7","unstructured":"Bradley, P., Fayyad, U., Reina, C.: Scaling clustering to large databases. In Proc. KDD-98, AAAI Press (1998) 9\u201315 1998."},{"key":"48_CR8","unstructured":"Dhillon, I., Modha, D.: A data clustering algorithm on distributed memory multi-processors. DD Workshop on Large-Scale Parallel Systems (1999)"},{"key":"48_CR9","unstructured":"Strehl, A., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page lustering. In Proc. AAAI Workshop on AI for Web Search (2000) 58\u201364"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Teng, S., Vavasis, S.A., A unified geometric approach to graph separators. In Proc. 31st Annual Symposium on Foundations of Computer Science (1991) 538\u2013547","DOI":"10.1109\/SFCS.1991.185417"},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning rregular graphs. SIAM Journal of Scientific Computing, 20 1 (1998), 359\u2013392","journal-title":"SIAM Journal of Scientific Computing"},{"key":"48_CR12","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Parallel multilevel algorithms for multiconstraint raph partitioning. Technical Report 99\u2013031, Dept of Computer Sc. and ng, Univ. of Minnesota (1999)"},{"key":"48_CR13","unstructured":"Dhillon, I., Modha, D., Spangler, W.: Visualizing class structure of multidimensional ata. In S. Weisberg, editor, Proc. 30th Symposium on the Interface: Computing cience and Statistics, (1998)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2014 HiPC 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44467-X_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:21:08Z","timestamp":1550449268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44467-X_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414292","9783540444671"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44467-x_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}