
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
The presentation will be delivered by ThanhNguyen Ngo at the 14th AsiaPacific Web Conference (APWeb) on April 12th, 2012 in Kunming, China.
Publication: http://bit.ly/yD18Vj
Abstract:
This paper presents a new approach to measuring similarity over massive timeseries data. Our approach is built on two principles: one is to parallelize the large amount computation using a scalable cloud serving system, called TimeCloud. The another is to benet from the lterandrenement approach for query processing, such that similarity computation is eciently performed over approximated data at the lter step, and then the following renement step measures precise similarities for only a small number of candidates resulted from the ltering. To this end, we establish a set of rm theoretical backgrounds, as well as techniques for processing kNN queries. Our experimental results suggest that the approach proposed is ecient and scalable.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment