Abstract
Data clustering, as one of the major algorithms in facial feature data mining, its efficiency and quality plays a key role. DBSCAN is a classic density-based clustering algorithm. It is applicable to any shape of subset or cluster and is comparatively anti-noise, but because of its slow running speed, it has long convergence time when the data set is large. For this reason, the paper presents an improved DBSCAN algorithm based on distributed computing system, by making full use of the characteristic of high time partial similarity of facial feature under the monitoring scene, first to merge the features which belong to the same target, then to segment the merged result using DBSCAN algorithm. The test results show that although this new algorithm has no modification in the aspect of time complexity, but greatly improved clustering speed, which enables the system to process million-level datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)
Yu, Y., Isard, M., Fetterly, D., Budiu, M., Erlingsson, Ú., Gunda, P.K., Currey, J.: DryadLINQ: a system for general-purpose distributed data-parallel computing using a high-level language. In: Proceedings of the 8th Symposium on Operating Systems Design and Implementation (OSDI 2008), vol. 8, pp. 1–14 (2008)
Thusoo, A., Sarma, J.S., Jain, N., et al.: Hive: a warehousing solution over a map-reduce framework. Proc. VLDB Endow. 2(2), 1626–1629 (2009)
Gates, A.F., Natkovich, O., Chopra, S., et al.: Building a high-level dataflow system on top of map-reduce: the pig experience. Proc. VLDB Endow. 2(2), 1414–1425 (2009)
Hellerstein, J.M., Stonebraker, M.: Readings in Database Systems, 4th edn., pp. 23–82. The MIT Press, Cambridge (2005)
Kleppmann, M.: Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems. O’Reilly Media Inc., Sebastopol (2017)
Ester, M., Kriegel, H.P., Sander, J., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Kdd, vol. 96, no. 34, pp. 226–231 (1996)
Zhou, Z.: Machine Learning, pp. 30–32. Tsinghua University Press, Beijing (2016)
Guo, Y., Zhang, L., Hu, Y., et al.: MS-Celeb-1 M: a dataset and benchmark for large-scale face recognition. In: European Conference on Computer Vision, pp. 87–102. Springer, Cham (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Lin, Q., Zhuo, B., Jiao, L., Liao, L., Guo, J. (2021). Distributed Facial Feature Clustering Algorithm Based on Spatiotemporal Locality. In: Barolli, L., Poniszewska-Maranda, A., Park, H. (eds) Innovative Mobile and Internet Services in Ubiquitous Computing . IMIS 2020. Advances in Intelligent Systems and Computing, vol 1195. Springer, Cham. https://doi.org/10.1007/978-3-030-50399-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-50399-4_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-50398-7
Online ISBN: 978-3-030-50399-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)