Pattern matching over cloaked time series

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 1462-1464

  Lian, Xiang ^a   Chen, Lei ^a   Yu, Jeffrey Xu ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CANNING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; MOBILE COMPUTING; PATTERN MATCHING; SEARCH ENGINES; STATISTICAL METHODS; TECHNOLOGY;

DATA CLASSIFICATION; DATA ENGINEERING; DATA MINING TASKS; DATA SEQUENCING; INTERNATIONAL CONFERENCES; LOCATION-BASED SERVICES; MEDICAL DATA ANALYSIS; PRIVACY INFORMATION; PRIVACY PRESERVING; PRIVATE INFORMATION; QUERY PATTERNS; SIMILARITY QUERY; SIMILARITY SEARCHES; TIME-SERIES;

TIME SERIES ANALYSIS;

EID: 52649133291     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497590     Document Type: Conference Paper

References (36)

1. R. Agrawal, C. Faloutsos, and A. N. Swami. Efflcient similarity search in sequence databases, In Proc. 4th Int. Conf. of Foundations of Data Organization and Algorithms, pages 69-84, 1993.
2. C. Böhm, A. Pryakhin, and M. Schubert. The Gauss-tree: efficient object identification in databases of probabilistic feature vectors. In ICDE, page 9, 2006.
3. Y. Cai and R. Ng. Indexing spatio-temporal trajectoires with Chebyshev polynomials. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 599-610, 2004.
4. J. Chen and R. Cheng. Efficient evaluation of imprecise location-dependent queries. In ICDE, pages 586-595, 2007.
5. p norms. In Proc. 30th Int. Conf. on Very Large Data Bases, pages 792-803, 2004.
6. L. Chen, M. T. Ozsu, and V. Oria. Robust and fast similarity search for moving object trajectories. In Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pages 491-502, New York, NY, USA, 2005. ACM Press.
7. Q. Chen, L. Chen 0002, X. Lian, Y. Liu, and J. X. Yu. Indexable pla for efficient similarity search. In VLDB, pages 435-446, 2007.
8. R. Cheng and J. Chen. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In ICDE, 2008.
9. R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. volume 16, pages 1112-1127, 2004.
10. R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD Conference, pages 551-562, 2003.
11. R. Cheng, Y. Zhang, E. Bertino, and S. Prabhakar. Preserving user location privacy in mobile data management infrastructures. In Privacy Enhancing Technologies, pages 393-412, 2006.
12. C.-Y. Chow, M. F. Mokbel, and X. Liu. A peer-to-peer spatial cloaking algorithm for anonymous location-based service. In GIS, pages 171-178. ACM, 2006.
13. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 419-429, 1994.
14. B. Gedik and L. Liu. Location privacy in mobile systems: A personalized anonymization model. In ICDCS, pages 620-629, 2005.
15. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-57, 1984.
16. E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and Information Systems, 3(3):263-286, 2000.
17. E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. Locally adaptive dimensionality reduction for indexing large time series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 151-162, 2001.
18. F. Korn, H. Jagadish, and C. Faloutsos. Efficiently supporting ad hoc queries in large datasets of time sequences. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 289-300, 1997.
19. K.P.Chan and A.W-C Fu. Efficient time series matching by wavelets. In Proc. 15th Int. Conf. on Data Engineering, pages 126-133, 1999.
20. H.-P. Kriegel, P. Kunath, M. Pfeifle, and M. Renz. Probabilistic similarity join on uncertain data. In DASFAA, pages 295-309, 2006.
21. H.-P. Kriegel, P. Kunath, and M. Renz. Probabilistic nearest-neighbor query on uncertain objects. In DASFAA, pages 337-348, 2007.
22. F. Li, J. Sun, S. Papadimitriou, G. A. Mihaila, and I. Stanoi. Hiding in the crowd: Privacy preservation on evolving streams through correlation tracking. In ICDE, pages 686-695, 2007.
23. N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE, pages 106-115, 2007.
24. V. Ljosa and A. K. Singh. APLA: indexing arbitrary probability distributions. In ICDE.
25. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. TKDD, 1(1), 2007.
26. M. F. Mokbel, C.-Y. Chow, and W. G. Aref. The new casper: query processing for location services without compromising privacy. In VLDB, pages 763-774, 2006.
27. S. Papadimitriou, F. Li, G. Kollios, and P. S. Yu. Time series compressibility and privacy. In VLDB, pages 459-470, 2007.
28. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, pages 15-26, 2007.
29. C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
30. A. D. Sarma, O. B., A. Y. Halevy, and J. Widom. Working models for uncertain data. In ICDE, page 7, 2006.
31. M. A. Soliman, I. F. Ilyas, and K. C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.
32. L. Sweene. Achieving k-anonymity privacy protection using generalization and suppression. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):571-588, 2002.
33. Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. K., and S. Prabhakar, Indexing multi-dimensional uncertain data with arbitrary probability density functions, In VLDB, pages 922-933, 2005.
34. Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In VLDB, pages 744-755, 2004.
35. Y. Theodoridis and T. Sellis. A model for the prediction of R-tree performance. In PODS, pages 161-171, 1996.
36. p norms. In Proc. 26th Int. Conf. on Very Large Data Bases, pages 385-394, 2000.