Separability of imprecise points

M.T. Berg, de, A.D. Mehrabi, F. Sheikhi

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)

Samenvatting

An imprecise point is a point p with an associated imprecision region Ip indicating the set of possible locations of the point p. We study separability problems for a set R of red imprecise points and a set B of blue imprecise points in R2 , where the imprecision regions are axis-aligned rectangles and each point p¿¿¿R¿¿¿B is drawn uniformly at random from Ip . Our results include algorithms for finding certain separators (separating R from B with probability 1), possible separators (separating R from B with non-zero probability), most likely separators (separating R from B with maximal probability), and maximal separators (maximizing the expected number of correctly classified points).
Originele taal-2Engels
TitelAlgorithm Theory – SWAT 2014 (14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings)
RedacteurenR. Ravi, I.L. Gørtz
Plaats van productieBerlin
UitgeverijSpringer
Pagina's146-157
ISBN van geprinte versie978-3-319-08403-9
DOI's
StatusGepubliceerd - 2014
Evenement14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014) - Copenghagen, Denemarken
Duur: 2 jul 20144 jul 2014
Congresnummer: 14

Publicatie series

NaamLecture Notes in Computer Science
Volume8503
ISSN van geprinte versie0302-9743

Congres

Congres14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014)
Verkorte titelSWAT 2014
LandDenemarken
StadCopenghagen
Periode2/07/144/07/14
Ander14th Scandinavian Symposium and Workshops on Algorithm Theory

Vingerafdruk Duik in de onderzoeksthema's van 'Separability of imprecise points'. Samen vormen ze een unieke vingerafdruk.

Citeer dit