{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T01:06:26Z","timestamp":1774487186147,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,4,7]],"date-time":"2007-04-07T00:00:00Z","timestamp":1175904000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2007,6,27]]},"DOI":"10.1007\/s10589-007-9024-1","type":"journal-article","created":{"date-parts":[[2007,4,6]],"date-time":"2007-04-06T14:53:11Z","timestamp":1175871191000},"page":"247-295","source":"Crossref","is-referenced-by-count":17,"title":["Clustering via minimum volume ellipsoids"],"prefix":"10.1007","volume":"37","author":[{"given":"Romy","family":"Shioda","sequence":"first","affiliation":[]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,7]]},"reference":[{"key":"9024_CR1","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1147\/rd.266.0759","volume":"26","author":"E. Barnes","year":"1982","unstructured":"Barnes, E.: An algorithm for separating patterns by ellipsoids. IBM J. Res. Dev. 26, 759\u2013764 (1982)","journal-title":"IBM J. Res. Dev."},{"key":"9024_CR2","unstructured":"Burkardt, J.: Random_data. http:\/\/www.csit.fsu.edu\/~burkardt\/m_src\/random_data\/random_data.html"},{"key":"9024_CR3","first-page":"627","volume-title":"ACM Symposium on Theory of Computing","author":"J. Dunagan","year":"2001","unstructured":"Dunagan, J., Vempala, S.: Optimal outlier removal in high-dimensional spaces. In: ACM Symposium on Theory of Computing, pp. 627\u2013636. ACM, New York (2001)"},{"key":"9024_CR4","doi-asserted-by":"crossref","unstructured":"Fraley, C., Raftery, A.E.: Mclust:software for model-based clustering, discriminant analysis and density estimation. Technical report no. 415R, Department of Statistics, University of Washington (2002)","DOI":"10.21236\/ADA459792"},{"key":"9024_CR5","first-page":"187","volume-title":"Studies and Essays for Courant Anniversary","author":"F. John","year":"1948","unstructured":"John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays for Courant Anniversary, pp. 187\u2013204. Interscience, New York (1948)"},{"key":"9024_CR6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/moor.21.2.307","volume":"21","author":"L. Khachiyan","year":"1996","unstructured":"Khachiyan, L.: Rounding polytopes in the real number model of computation. Math. Oper. Res. 21, 307\u2013320 (1996)","journal-title":"Math. Oper. Res."},{"key":"9024_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01582144","volume":"61","author":"L. Khachiyan","year":"1993","unstructured":"Khachiyan, L., Todd, M.J.: On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61, 137\u2013159 (1993)","journal-title":"Math. Program."},{"key":"9024_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, M., Orlin, J.: Scale-invariant clustering using minimum volume ellipsoids (2007, in preparation)","DOI":"10.2139\/ssrn.882115"},{"key":"9024_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-005-2653-6","volume":"126","author":"P. Kumar","year":"2005","unstructured":"Kumar, P., Yildirim, E.A.: Minimum volume enclosing ellipsoids and core sets. J. Optim. Theory Appl. 126 1\u201321 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"9024_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01170633","volume":"38","author":"K. L\u00f6wner","year":"1934","unstructured":"L\u00f6wner, K.: \u00dcber monotone Matrixfunktionen. Math. Z. 38, 177\u2013216 (1934)","journal-title":"Math. Z."},{"key":"9024_CR11","unstructured":"MathWorks Inc.: MATLAB 6.5 reference guide (2003)"},{"key":"9024_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.S.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"9024_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0022-247X(65)90150-2","volume":"10","author":"J.B. Rosen","year":"1965","unstructured":"Rosen, J.B.: Pattern separation by convex programming. J. Math. Anal. Appl. 10, 123\u2013134 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"9024_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/0471725382","volume-title":"Robust Regression and Outlier Detection","author":"P.J. Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J., Leroy, A.M.: Robust Regression and Outlier Detection. Wiley, New York (1987)"},{"key":"9024_CR15","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/opre.1040.0115","volume":"52","author":"P. Sun","year":"2004","unstructured":"Sun, P., Freund, R.M.: Computation of minimum volume covering ellipsoids. Oper. Res. 52, 690\u2013706 (2004)","journal-title":"Oper. Res."},{"key":"9024_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/2530520","volume":"37","author":"M.J. Symons","year":"1981","unstructured":"Symons, M.J.: Clustering criteria and multivariate normal mixtures. Biometrics 37, 35\u201343 (1981)","journal-title":"Biometrics"},{"key":"9024_CR17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/A:1026400522929","volume":"14","author":"K. Toh","year":"1999","unstructured":"Toh, K.: Primal\u2013dual path-following algorithms for determinant maximization problems with linear matrix inequalities. Comput. Optim. Appl. 14, 309\u2013330 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"9024_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/S1052623401397230","volume":"14","author":"Y. Zhang","year":"2004","unstructured":"Zhang, Y., Gao, L.: On numerical solution of the maximum volume ellipsoid problem. SIAM J. Optim. 14, 53\u201376 (2004)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9024-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9024-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9024-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:31Z","timestamp":1559302591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9024-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,7]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6,27]]}},"alternative-id":["9024"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9024-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,7]]}}}