{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:11:23Z","timestamp":1749615083276,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_26","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"311-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Algebraic Techniques for Analysis of Large Discrete-Valued Datasets"],"prefix":"10.1007","author":[{"given":"Mehmet","family":"Koyut\u00fcrk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananth","family":"Grama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naren","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/1037127","volume":"37","author":"M. W. Berry","year":"1995","unstructured":"M. W. Berry, S. T. Dumais, and G. W. O'Brien. Using Linear Algebra for Intelligent Information Retrieval. SIAM Review, Vol. 37(4):pages 573\u2013595, 1995.","journal-title":"SIAM Review"},{"key":"26_CR2","unstructured":"P. Drienas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in Large Graphs and Matrices. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 291\u2013299, 1999."},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/s007780050005","volume":"8","author":"D. Gibson","year":"2000","unstructured":"D. Gibson, J. Kleingberg, and P. Raghavan. Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB Journal, Vol. 8(3\u20134):pages 222\u2013236, 2000.","journal-title":"VLDB Journal"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/MASSP.1984.1162229","volume":"1","author":"R. M. Gray","year":"1984","unstructured":"R. M. Gray. Vector Quantization. IEEE ASSP Magazine, Vol. 1(2):pages 4\u201329, 1984.","journal-title":"IEEE ASSP Magazine"},{"issue":"5","key":"26_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S. Guha","year":"2000","unstructured":"S. Guha, R. Rastogi, and K. Shim. ROCK: ARo bust Clustering Algorithm for Categorical Attributes. Information Systems, Vol. 25(5):pages 345\u2013366, 2000.","journal-title":"Information Systems"},{"key":"26_CR6","unstructured":"G. Gupta and J. Ghosh. Value Balanced Agglomerative Connectivity Clustering. In Proceedings of the SPIE conference on Data Mining and Knowledge Discovery III, April 2001."},{"issue":"1","key":"26_CR7","first-page":"15","volume":"21","author":"E. H. Han","year":"1998","unstructured":"E. H. Han, G. Karypis, V. Kumar, and B. Mobasher. Hypergraph-Based Clustering in High-Dimensional Datasets: ASumma ry of Results. Bulletin of the IEEE Technical Committee on Data Engineering, Vol. 21(1):pages 15\u201322, March 1998.","journal-title":"Bulletin of the IEEE Technical Committee on Data Engineering"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"T. Hofmann. Probabilistic Latent Semantic Indexing. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 50\u201357, 1999.","DOI":"10.1145\/312624.312649"},{"key":"26_CR9","unstructured":"Z. Huang. A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining. In Proceedings of the ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 1997."},{"issue":"4","key":"26_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/291128.291131","volume":"16","author":"T. G. Kolda","year":"1998","unstructured":"T. G. Kolda and D. P. O'Leary. AS emidiscrete Matrix Decomposition for Latent Semantic Indexing in Information Retrieval. ACM Transactions on Information Systems, Vol. 16(4):pages 322\u2013346, October 1998.","journal-title":"ACM Transactions on Information Systems"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/358407.358424","volume":"26","author":"T. G. Kolda","year":"2000","unstructured":"T. G. Kolda and D. P. O'Leary. Computation and Uses of the Semidiscrete Matrix Decomposition. ACM Transactions on Mathematical Software, Vol. 26(3):pages 416\u2013437, September 2000.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D. D. Lee","year":"1999","unstructured":"D. D. Lee and H. S. Seung. Learning the Parts of Objects by Non-Negative Matrix Factorization. Nature, Vol. 401:pages 788\u2013791, 1999.","journal-title":"Nature"},{"key":"26_CR13","first-page":"281","volume":"1","author":"J. MacQueen","year":"1967","unstructured":"J. MacQueen. Some Methods for Classification and Analysis of Multivariate Observations. In Proceedings of the Fifth Berkeley Symposium, volume 1, pages 281\u2013297, 1967.","journal-title":"Proceedings of the Fifth Berkeley Symposium"},{"key":"26_CR14","unstructured":"S. McConnell and D. B. Skillicorn. Outlier Detection using Semi-Discrete Decomposition. Technical Report 2001-452, Dept. of Computing and Information Science, Queen\u2019s University, 2001."},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TCOM.1983.1095823","volume":"31","author":"D. P. O'Leary","year":"1983","unstructured":"D. P. O'Leary and S. Peleg. Digital Image Compression by Outer Product Expansion. IEEE Transactions on Communications, Vol. 31(3):pages 441\u2013444, 1983.","journal-title":"IEEE Transactions on Communications"},{"key":"26_CR16","unstructured":"M. Ozdal and C. Aykanat. Clustering Based on Data Patterns using Hypergraph Models. Data Mining and Knowledge Discovery, 2001. Submitted for publication."},{"key":"26_CR17","unstructured":"S. Zyto, A. Grama, and W. Szpankowski. Semi-Discrete Matrix Transforms (SDD) for Image and Video Compression. Purdue University, 2002. Working manuscript."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:31Z","timestamp":1749573331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}