{"id":15679,"date":"2020-02-04T09:12:28","date_gmt":"2020-02-04T09:12:28","guid":{"rendered":"http:\/\/cio.edu.umh.es\/?p=15679"},"modified":"2021-07-22T09:50:14","modified_gmt":"2021-07-22T07:50:14","slug":"seminario-justo-puerto","status":"publish","type":"post","link":"https:\/\/cio.umh.es\/en\/2020\/02\/04\/seminario-justo-puerto\/","title":{"rendered":"Seminario Justo Puerto"},"content":{"rendered":"<p>[:es]<strong>T\u00edtulo:<\/strong>\u00a0Generalized Multisource Regression: A framework for locating hyperplanes to fitting sets of points.<br \/>\n<strong>Ponente:<\/strong>\u00a0Justo Puerto (Universidad de Sevilla).<br \/>\n<strong>Organizador:\u00a0<\/strong> Ana Meca<br \/>\n<strong><span lang=\"EN-US\">Date:<\/span><\/strong><span lang=\"EN-US\">\u00a0Jueves 13 de febrero a las 11:00 horas.<\/span><br \/>\n<strong>Lugar:<\/strong>\u00a0\u00a0Aulas 0.1 y 0.2S del CIO\u00a0en el Edificio Torretamarit,\u00a0Universidad Miguel Hern\u00e1ndez\u00a0(Campus de Elche)<br \/>\n<strong>Resumen:\u00a0<\/strong>In this talk we revisit common problems of Data Science. Specifically, we focus on the problem of locating a given number of hyperplanes minimizing a globalizing function of the closest distances from a set of points. Following an initial attempt in, we propose a general framework for the problem in which general norm-based distances are used to measure the residuals and an ordered median aggregation function of them has to be minimized. A compact Mixed Integer Linear (or Non Linear) programming formulation is presented for the problem and also an extended set partitioning formulation with an exponential number of variables is developed. The set partitioning formulation is analyzed and a column generation procedure is proposed for solving the problem by adequately performing preprocessing, pricing and branching (see for similar approaches to a different problem in Location Analysis). The issue of scalability is also addressed showing theoretical upper bounds on the errors assumed by replacing the original datasets by aggregated versions. Finally, the results of an extensive computational experience are reported.[:]<\/p>","protected":false},"excerpt":{"rendered":"<p>[:es]T\u00edtulo:\u00a0Generalized Multisource Regression: A framework for locating hyperplanes to fitting sets of points.<br \/>\nPonente:\u00a0Justo Puerto (Universidad de Sevilla).<br \/>\nOrganizador:\u00a0 Ana Meca<br \/>\nFecha:\u00a0Jueves 13 de febrero a las 11:00 horas.<br \/>\nLugar:\u00a0\u00a0Aulas 0.1 y 0.2S del CIO\u00a0en el Edificio Torretamarit,\u00a0Universidad Miguel Hern\u00e1ndez\u00a0(Campus de Elche)<br \/>\nResumen:\u00a0In this talk we revisit common problems of Data Science. Specifically, we focus on the problem of locating [&#8230;]<\/p>","protected":false},"author":6202,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[4,873],"tags":[],"_links":{"self":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/15679"}],"collection":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/users\/6202"}],"replies":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/comments?post=15679"}],"version-history":[{"count":0,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/15679\/revisions"}],"wp:attachment":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/media?parent=15679"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/categories?post=15679"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/tags?post=15679"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}