Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Edo Liberty"'
Publikováno v:
Sensors, Vol 22, Iss 24, p 9612 (2022)
Approximating quantiles and distributions over streaming data has been studied for roughly two decades now. Recently, Karnin, Lang, and Liberty proposed the first asymptotically optimal algorithm for doing so. This manuscript complements their theore
Externí odkaz:
https://doaj.org/article/847b5668276f45c5a70e0fbc1aa9acd0
Publikováno v:
Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
PODS
PODS
Approximating ranks, quantiles, and distributions over streaming data is a central task in data analysis and monitoring. Given a stream of $n$ items from a data universe $\mathcal{U}$ equipped with a total order, the task is to compute a sketch (data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2895686f8209d08ae3d6448b83b85ca0
Publikováno v:
RecSys
E-commerce applications rely heavily on session-based recommendation algorithms to improve the shopping experience of their customers. Recent progress in session-based recommendation algorithms shows great promise. However, translating that promise t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bd618f833e8c42f7dd39f9221528c32
https://doi.org/10.1145/3383313.3412235
https://doi.org/10.1145/3383313.3412235
Autor:
Amir Sadoughi, Sebastian Schelter, Julio Delgado, Valentin Flunkert, Madhav Jha, Edo Liberty, Bing Xiang, Ramesh Nallapati, Syama Sundar Rangapuram, Lorenzo Stella, David Arpin, Jan Gasthaus, Yuyang Wang, Yury Astashonok, David Salinas, Zohar Karnin, Can Balioglu, Baris Coskun, Philip Gautier, Saswata Chakravarty, Laurence Rouesnel, Piali Das, Alexander J. Smola, Tim Januschowski
Publikováno v:
SIGMOD Conference
There is a large body of research on scalable machine learning (ML). Nevertheless, training ML models on large, continuously evolving datasets is still a difficult and costly undertaking for many companies and institutions. We discuss such challenges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e769140fd8e6cb1552bc1125581e3615
https://doi.org/10.1145/3318464.3386126
https://doi.org/10.1145/3318464.3386126
Publikováno v:
Internet Measurement Conference
Estimating frequencies of items over data streams is a common building block in streaming data measurement and analysis. Misra and Gries introduced their seminal algorithm for the problem in 1982, and the problem has since been revisited many times d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12c4d89b70813f37928f1155ba89601f
http://arxiv.org/abs/1705.07001
http://arxiv.org/abs/1705.07001
Publikováno v:
Internet Mathematics. 10:335-359
This article presents algorithms for estimating the number of users in online social networks. Although such networks sometimes publish such statistics, there are good reasons to validate their reports. The proposed schemes can also estimate the card
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2725a4bd530320671b99f786dca238f3
https://doi.org/10.1080/15427951.2013.862883
https://doi.org/10.1080/15427951.2013.862883
Publikováno v:
FOCS
This paper resolves one of the longest standing basic problems in the streaming computational model. Namely, optimal construction of quantile sketches. An $\varepsilon$ approximate quantile sketch receives a stream of items $x_1,\ldots,x_n$ and allow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e941727d00f49b2b8194868c1b1a70c
https://doi.org/10.1109/focs.2016.17
https://doi.org/10.1109/focs.2016.17
Publikováno v:
Discrete & Computational Geometry. 45:34-44
Random projection methods give distributions over k×d matrices such that if a matrix Ψ (chosen according to the distribution) is applied to a finite set of vectors x i ∈ℝd the resulting vectors Ψx i ∈ℝk approximately preserve the original
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f89739d7aba0572a75e1f38dad7bf0b
https://doi.org/10.1007/s00454-010-9309-5
https://doi.org/10.1007/s00454-010-9309-5
Autor:
Steven W. Zucker, Edo Liberty
Publikováno v:
Information Processing Letters. 109:179-182
Given an mxn matrix A we are interested in applying it to a real vector [email protected]?R^n in less than the straightforward O(mn) time. For an exact deterministic computation at the very least all entries in A must be accessed, requiring O(mn) ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e564a930cb6bece70346e2b037700d1
https://doi.org/10.1016/j.ipl.2008.09.028
https://doi.org/10.1016/j.ipl.2008.09.028
Publikováno v:
Applied and Computational Harmonic Analysis. 25(3):335-366
We introduce a randomized procedure that, given an m×n matrix A and a positive integer k, approximates A with a matrix Z of rank k. The algorithm relies on applying a structured l×m random matrix R to each column of A, where l is an integer near to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dcbf7d32bed14f6050f680dc0e8a004