Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/F31ED2BA-71AD-4203-9265-DB1531C75A20 | - |
| Identifier | https://doi.org/10.26233/heallink.tuc.66173 | - |
| Language | en | - |
| Extent | 30 pages | en |
| Title | Distributed sliding-window matrix sketching | en |
| Creator | Asteri Eirini | en |
| Creator | Αστερη Ειρηνη | el |
| Contributor [Thesis Supervisor] | Garofalakis Minos | en |
| Contributor [Thesis Supervisor] | Γαροφαλακης Μινως | el |
| Contributor [Committee Member] | Samoladas Vasilis | en |
| Contributor [Committee Member] | Σαμολαδας Βασιλης | el |
| Contributor [Committee Member] | Deligiannakis Antonios | en |
| Contributor [Committee Member] | Δεληγιαννακης Αντωνιος | el |
| Publisher | Πολυτεχνείο Κρήτης | el |
| Publisher | Technical University of Crete | en |
| Academic Unit | Technical University of Crete::School of Electrical and Computer Engineering | en |
| Academic Unit | Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών | el |
| Content Summary | Streaming sketching algorithms are data-processing algorithms for the summarization of an input data stream under memory and computational constraints. Their input is a long or potentially unbounded sequence of items that can be parsed a single (or a limited number of times), and the objective is to construct a concise summary of the data – a sketch – which can be later used to approximate a quantity of interest. In this work, we focus on streaming matrix sketching methods: the input is a sequence of vectors which can be regarded as the rows of a large matrix. We briefly survey matrix sketching methods for generating various kinds of sketches. We will mostly focus on the problem of approximating the principal subspace of a large matrix under the streaming model and we will describe the state-of-the-art “Frequent Directions” method of Liberty. We will further review very recent extensions of this work to monitoring the principal subspace of a stream over a sliding time window. Here, the objective is to maintain a sketch that approximates the desired quantity for the most recent segment of the input. Finally, we conclude with a novel result on the distributed construction of sketches for the sliding window model and some future directions. | en |
| Type of Item | Διπλωματική Εργασία | el |
| Type of Item | Diploma Work | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2016-08-22 | - |
| Date of Publication | 2016 | - |
| Subject | Data mining | en |
| Bibliographic Citation | Eirini Asteri, "Distributed sliding-window matrix sketching", Diploma Work, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2016 | en |
Copyright © DIAS 2013
