Show simple item record

dc.rights.licensehttps://creativecommons.org/licenses/by-sa/2.5/ar/es_AR
dc.contributor.authorMarenco, Javieres_AR
dc.date.accessioned2023-11-22T15:07:04Z
dc.date.available2023-11-22T15:07:04Z
dc.date.issued2023
dc.identifier.urihttps://repositorio.utdt.edu/handle/20.500.13098/12149
dc.description.abstractWe present a mixed integer programming formulation for the problem of clustering a set of points in Rd with axis-parallel clusters, while allowing to discard a pre-specified number of points, thus declared to be outliers. We identify a family of valid inequalities separable in polynomial time, we prove that some inequalities from this family induce facets of the associated polytope, and we show that the dynamic addition of cuts coming from this family is effective in practice.es_AR
dc.format.extent23 p.es_AR
dc.format.mediumapplication/pdfes_AR
dc.languageenges_AR
dc.publisherUniversidad Torcuato Di Tellaes_AR
dc.rightsinfo:eu-repo/semantics/openAccesses_AR
dc.subjectClusteringes_AR
dc.subjectInteger programminges_AR
dc.subjectFacetses_AR
dc.subjectCutting planeses_AR
dc.titleAn integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outlierses_AR
dc.typeinfo:eu-repo/semantics/preprintes_AR
dc.type.versioninfo:eu-repo/semantics/submittedVersiones_AR


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record