Funder
National Natural Science Foundation of China
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference41 articles.
1. Abul, O., Bonchi, F., & Nanni, M. (2008). Never walk alone: Uncertainty for anonymity in moving objects databases. In Proceedings of the 2008 IEEE 24th international conference on data engineering, 8, 376–385. https://doi.org/10.1109/ICDE.2008.4497446.
2. Arthur, D., & Vassilvitskii, S. (2006). K-Means++: The Advantages of Careful Seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 7–9. https://doi.org/10.1145/1283383.1283494.
3. Scalable k-means++;Bahmani;Proceedings of the VLDB Endowment,2012
4. Spatio-temporal data reduction with deterministic error bounds;Cao;VLDB,2006
5. Changqiao, X., Liang, Z., Yang, L., et al. (2018). Dp-ltod: Differential privacy latent trajectory community discovering services over location-based social networks. IEEE Transactions on Services Computing, 1-1. https://doi.org/10.1109/TSC.2018.2855740.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献