Clustering on Sliding Windows in Polylogarithmic Space

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10316195" target="_blank" >RIV/00216208:11320/15:10316195 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2015.350" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2015.350</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2015.350" target="_blank" >10.4230/LIPIcs.FSTTCS.2015.350</a>

Result language
angličtina
Original language name
Clustering on Sliding Windows in Polylogarithmic Space
Original language description
In PODS 2003, Babcock, Datar, Motwani and O'Callaghan gave the first streaming solution for the k-median problem on sliding windows using O(frack k tau^4 W^2tau log^2 W) space, with a O(2^O(1/tau)) approximation factor, where W is the window size and tauin (0,1/2) is a user-specified parameter. They left as an open question whether it is possible to improve this to polylogarithmic space. Despite much progress on clustering and sliding windows, this question has remained open for more than a decade. Inthis paper, we partially answer the main open question posed by Babcock, Datar, Motwani and O'Callaghan. We present an algorithm yielding an exponential improvement in space compared to the previous result given in Babcock, et al. In particular, we givethe first polylogarithmic space (alpha,beta)-approximation for metric k-median clustering in the sliding window model, where alpha and beta are constants, under the assumption, also made by Babcock et al., that the optimal k-median cost o
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
ISBN
978-3-939897-97-2
ISSN
1868-8969
e-ISSN
—
Number of pages
15
Pages from-to
350-364
Publisher name
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Place of publication
Dagstuhl
Event location
Bangalore, India
Event date
Dec 16, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)