Data Warehousing Data Mining And Olap Alex Berson Pdf Reader
PDF-XChange Editor Pdf xchange editor portable. The smallest, fastest and most feature-rich free PDF viewer/editor on the market. Fastest and most feature-rich free PDF viewer/editor on the market. Canadian black book tdi manual usuario jeep grand cherokee laredo 3 1 alex berson data warehousing data mining and olap tata. Ships between database, data warehouse and data mining leads us to the second part of this chapter - data mining. Data mining is a process of extracting information and patterns, which are pre-viously unknown, from large quantities of data using various techniques ranging from machine learning to statistical methods. Data could have been stored in.
DW&DM
|
Publication: ICDE '13: Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)April 2013 Pages 254–265https://doi.org/10.1109/ICDE.2013.6544830
This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
Manage my AlertsPlease log in to your account Crack style work 2000 mediafire.
Save to Binder
Create a New Binder
Destination prediction is an essential task for many emerging location based applications such as recommending sightseeing places and targeted advertising based on destination. A common approach to destination prediction is to derive the probability of a location being the destination based on historical trajectories. However, existing techniques using this approach suffer from the “data sparsity problem”, i.e., the available historical trajectories is far from being able to cover all possible trajectories. This problem considerably limits the number of query trajectories that can obtain predicted destinations. We propose a novel method named Sub-Trajectory Synthesis (SubSyn) algorithm to address the data sparsity problem. SubSyn algorithm first decomposes historical trajectories into sub-trajectories comprising two neighbouring locations, and then connects the sub-trajectories into “synthesised” trajectories. The number of query trajectories that can have predicted destinations is exponentially increased by this means. Experiments based on real datasets show that SubSyn algorithm can predict destinations for up to ten times more query trajectories than a baseline algorithm while the SubSyn prediction algorithm runs over two orders of magnitude faster than the baseline algorithm. In this paper, we also consider the privacy protection issue in case an adversary uses SubSyn algorithm to derive sensitive location information of users. We propose an efficient algorithm to select a minimum number of locations a user has to hide on her trajectory in order to avoid privacy leak. Experiments also validate the high efficiency of the privacy protection algorithm.
Please enable JavaScript to view thecomments powered by Disqus.
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
Published in
1595 pagesIn-Cooperation
Publisher
IEEE Computer Society
United States
Publication History
Qualifiers
- Article
Funding Sources
Article Metrics
- Total CitationsView Citations
- Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Digital Edition
View this article in digital edition.
View Digital Edition