{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:03:04Z","timestamp":1761807784859,"version":"3.40.3"},"reference-count":12,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1016\/j.patrec.2012.06.007","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T22:32:41Z","timestamp":1340058761000},"page":"1749-1755","source":"Crossref","is-referenced-by-count":21,"title":["Iterative random projections for high-dimensional data clustering"],"prefix":"10.1016","volume":"33","author":[{"given":"\u00c2ngelo","family":"Cardoso","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wichert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2012.06.007_b0005","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., 2003. Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci. 66, 671\u2013687. Special Issue on PODS 2001.","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"10.1016\/j.patrec.2012.06.007_b0010","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-8655(95)00122-0","article-title":"Computational experience on four algorithms for the hard clustering problem","volume":"17","author":"Al-Sultan","year":"1996","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/j.patrec.2012.06.007_b0015","unstructured":"Boutsidis, C., Zouzias, A., Drineas, P., 2010. Random Projections for k-means Clustering. In: Advances in Neural Information Processing Systems, vol. 23, pp. 298\u2013306."},{"key":"10.1016\/j.patrec.2012.06.007_b0020","unstructured":"Dasgupta, S,. 2000. Experiments with random projection, in: Uncertainty in Artificial Intelligence: Proc. 16th Conf. (UAI-2000), pp. 143\u2013151."},{"key":"10.1016\/j.patrec.2012.06.007_b0025","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/rsa.10073","article-title":"An elementary proof of a theorem of Johnson and Lindenstrauss","volume":"22","author":"Dasgupta","year":"2003","journal-title":"Random Struct. Algor."},{"key":"10.1016\/j.patrec.2012.06.007_b0030","first-page":"43","article-title":"Context vectors: General purpose approximate meaning representations self-organized from raw data","author":"Hecht-Nielsen","year":"1994","journal-title":"Comput. Intell. Imitating Life"},{"key":"10.1016\/j.patrec.2012.06.007_b0035","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of lipschitz mappings into a hilbert space","volume":"26","author":"Johnson","year":"1984","journal-title":"Contemp. Math."},{"key":"10.1016\/j.patrec.2012.06.007_b0040","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S., 2004. A simple linear time (1+\u03f5)-approximation algorithm for k-means clustering in any dimensions. In: Foundations of Computer Science, 2004. Proc. 45th Annual IEEE Symposium on, pp. 454\u2013462.","DOI":"10.1109\/FOCS.2004.7"},{"key":"10.1016\/j.patrec.2012.06.007_b0045","doi-asserted-by":"crossref","unstructured":"Li, P., Hastie, T.J., Church, K.W., 2006. Very sparse random projections. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, New York, NY, USA, pp. 287\u2013296.","DOI":"10.1145\/1150402.1150436"},{"key":"10.1016\/j.patrec.2012.06.007_b0050","doi-asserted-by":"crossref","unstructured":"Lloyd, S., 1982. Least squares quantization in pcm. Information Theory, IEEE Trans. on 28, pp. 129\u2013137.","DOI":"10.1109\/TIT.1982.1056489"},{"key":"10.1016\/j.patrec.2012.06.007_b0055","unstructured":"Magen, A., 2002. Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications. In: Randomization and Approximation Techniques in Computer Science, vol. 2483. Springer, Lecture Notes in Computer Science, pp. 953\u2013953."},{"key":"10.1016\/j.patrec.2012.06.007_b0060","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1016\/0031-3203(91)90097-O","article-title":"A simulated annealing algorithm for the clustering problem","volume":"24","author":"Selim","year":"1991","journal-title":"Pattern Recognition"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016786551200195X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016786551200195X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T22:42:37Z","timestamp":1743547357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016786551200195X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":12,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["S016786551200195X"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2012.06.007","relation":{},"ISSN":["0167-8655"],"issn-type":[{"type":"print","value":"0167-8655"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}