{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:02:57Z","timestamp":1773921777365,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,8,10]],"date-time":"2006-08-10T00:00:00Z","timestamp":1155168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2006,12,2]]},"DOI":"10.1007\/s10898-006-9041-0","type":"journal-article","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T13:35:33Z","timestamp":1155130533000},"page":"137-157","source":"Crossref","is-referenced-by-count":36,"title":["Application of the cross-entropy method to clustering and vector quantization"],"prefix":"10.1007","volume":"37","author":[{"given":"Dirk P.","family":"Kroese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reuven Y.","family":"Rubinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Taimre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,10]]},"reference":[{"key":"9041_CR1","unstructured":"The USC-SIPI Image Database.: http:\/\/sipi.usc.edu\/services\/database\/Database.html"},{"key":"9041_CR2","unstructured":"TSPLIB : A Traveling Salesman Problem Library. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"9041_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0893-6080(90)90071-R","volume":"3","author":"S.C. Ahalt","year":"1990","unstructured":"Ahalt S.C., Krishnamurthy A.K., Chen P., Melton D.E. (1990) Competitive learning algorithms for vector quantization. Neural Net. 3, 277\u2013290","journal-title":"Neural Net."},{"key":"9041_CR4","doi-asserted-by":"crossref","unstructured":"Betke, M., Makris, N.: Fast object recognition in noisy images using simulated annealing. In: Proceedings of the Fifth International Conference on Computer Vision, pp. 523\u2013530 (1995)","DOI":"10.1109\/ICCV.1995.466895"},{"key":"9041_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern Recognition with Fuzzy Objective Function Algorithms","author":"J. Bezdek","year":"1981","unstructured":"Bezdek J. (1981) Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York"},{"key":"9041_CR6","doi-asserted-by":"crossref","unstructured":"Botev, Z., Kroese, D.P. Global likelihood optimization via the cross-entropy method, with an application to mixture models. In: Ingalls, R.G., Rossetti, M.D., Smith, J.S., Peters, B.A. (eds.) Proceedings of the 2004 Winter Simulation Conference, IEEE, Washington, DC, December 2004","DOI":"10.1109\/WSC.2004.1371358"},{"key":"9041_CR7","unstructured":"Brown, L. A survey of image registration techniques. Technical report, Department of Computer Science, Columbia University (1992)"},{"key":"9041_CR8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/83.382495","volume":"4","author":"J. Chen","year":"1995","unstructured":"Chen J., Kundu A. (1995) Unsupervised texture segmentation using multichannel decomposition and hidden Markov models. IEEE Trans. Image Process. 4, 603\u2013619","journal-title":"IEEE Trans. Image Process."},{"key":"9041_CR9","doi-asserted-by":"crossref","unstructured":"de Boer, P.T., Kroese, D.P., Mannor, S., Rubinstein, R.Y. A tutorial on the cross-entropy method. Ann Oper. Res. Vol. 134, pp.19\u201367. Springer-Verlag (2005)","DOI":"10.1007\/s10479-005-5724-z"},{"key":"9041_CR10","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Di Caro, G. The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in optimization, pp. 11\u201332. McGraw-Hill (1999)","DOI":"10.1109\/CEC.1999.782657"},{"key":"9041_CR11","volume-title":"Pattern Classification","author":"R.O. Duda","year":"2001","unstructured":"Duda R.O., Hart P.E., Stork D.G. (2001) Pattern Classification. Wiley, New York"},{"key":"9041_CR12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman S., Geman D. (1984) Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images. IEEE Trans. PAMI 6, 721\u2013741","journal-title":"IEEE Trans. PAMI"},{"key":"9041_CR13","volume-title":"Modern Heuristic Techniques for Combinatorial Optimization, Chapter 3: Tabu Search","author":"F. Glover","year":"1993","unstructured":"Glover F., Laguna M.L. (1993) Modern Heuristic Techniques for Combinatorial Optimization, Chapter 3: Tabu Search. Blackwell Scientific Publications, Oxford"},{"key":"9041_CR14","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg D. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA"},{"key":"9041_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovi\u0107 N. (2001) J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 34, 405\u2013413","journal-title":"Pattern Recogn."},{"key":"9041_CR16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovi\u0107 N., Perez-Brito D. (2001). Variable neighborhood decomposition search. J Heuristics 7, 335\u2013350","journal-title":"J Heuristics"},{"key":"9041_CR17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain A.K., Murty M.N., Flynn P.J. (1999) Data clustering: a review. ACM Comput. Surv. 31, 264\u2013323","journal-title":"ACM Comput. Surv."},{"key":"9041_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data, and Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman L., Rousseeuw P. (1990) Finding Groups in Data, and Introduction to Cluster Analysis. Wiley, New York"},{"key":"9041_CR19","doi-asserted-by":"crossref","unstructured":"Keith, J., Kroese, D.P. Sequence alignment by rare event simulation. In: Proceedings of the 2002 Winter Simulation Conference, pp.~320\u2013327. San Diego (2002)","DOI":"10.1109\/WSC.2002.1172901"},{"key":"9041_CR20","volume-title":"The EM Algorithm and Extensions","author":"G. McLachlan","year":"1997","unstructured":"McLachlan G., Krishnan T. (1997) The EM Algorithm and Extensions. Wiley, New York"},{"key":"9041_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"2","author":"R.Y. Rubinstein","year":"1999","unstructured":"Rubinstein R.Y. (1999) The cross-entropy method for combinatorial and continuous optimization. Methodol Comp. Appl. Prob. 2, 127\u2013190","journal-title":"Methodol Comp. Appl. Prob."},{"key":"9041_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning","author":"R.Y. Rubinstein","year":"2004","unstructured":"Rubinstein R.Y., Kroese D.P. (2004) The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer-Verlag, New York"},{"key":"9041_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86092-8","volume-title":"Data Compression: The Complete Reference","author":"D. Salomon","year":"2000","unstructured":"Salomon D. (2000) Data Compression: The Complete Reference. Springer-Verlag, New York"},{"key":"9041_CR24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"H.D. Sherali","year":"2005","unstructured":"Sherali H.D., Desai J. (2005) A global optimization rlt-based approach for solving the hard clustering problem. J Global Optim. 32, 281\u2013306","journal-title":"J Global Optim."},{"issue":"3","key":"9041_CR25","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/opre.48.3.390.12436","volume":"48","author":"L. Shi","year":"2000","unstructured":"Shi L., Olafsson S. (2000) Nested partitioning method for global optimization. Oper. Res. 48(3): 390\u2013407","journal-title":"Oper. Res."},{"key":"9041_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization","author":"J.C. Spall","year":"2003","unstructured":"Spall J.C. (2003) Introduction to Stochastic Search and Optimization. John Wiley, New York"},{"key":"9041_CR27","volume-title":"Computer Manual to Accompany Pattern Classification","author":"D.G. Stork","year":"2004","unstructured":"Stork D.G., Yom-Tov E. (2004) Computer Manual to Accompany Pattern Classification. Wiley, New York"},{"key":"9041_CR28","volume-title":"Statistical Pattern Recognition","author":"A. Webb","year":"1999","unstructured":"Webb A. (1999) Statistical Pattern Recognition. Arnold, London"},{"key":"9041_CR29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.patcog.2005.07.005","volume":"39","author":"M.-S. Yang","year":"2006","unstructured":"Yang M.-S., Wu K.-L. (2006) Unsupervised possibilistic clustering. Pattern Recog. 39, 5\u201321","journal-title":"Pattern Recog."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9041-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9041-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9041-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T11:17:40Z","timestamp":1736507860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9041-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,12,2]]}},"alternative-id":["9041"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9041-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,10]]}}}