Combining Two Clustering Ideas for Typification of Ditches
Ditches are important components of hydrological ecosystem and play a critical role in capturing and removing the micro-organisms and pollutants from water body. The generalization of ditches supports the multi-scale analysis and modeling of hydrological and ecological environment that relate to ditches. This paper proposes and implements a new method that combines two clustering ideas for typification of ditches. This method groups the ditches based on the edge-cutting of the minimal spanning tree of ditches, and represents the ditches in each group based on K-means++ algorithm. This study also presents the validation of the method with the experimental data of Guangzhou city.
KeywordsMap generalization Typification Ditches Clustering
We would especially like to thank the two anonymous reviewers for their helpful comments. Work describe in this article was supported by project from the National Science Foundation for Fostering Talents in Basic Research of the National Natural Science Foundation of China (Grant No. J1103409).
- Anders KH (2006) Grid typification. In: 12th international symposium on spatial data handling, progress in spatial data handling. Springer, Heidelberg, pp 633–642Google Scholar
- Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms 2007, pp 1027–1035Google Scholar
- Foerster T, Stoter J (2008) Generalization operators for practice—a survey at national mapping agencies. In: Proceedings of the 11th ICA workshop on generalization and multiple representation, MontpellierGoogle Scholar
- Sandro S, Massimo R, Matteo Z (2011) Pattern recognition and typification of ditches. In: Ruas A(ed) Advances in cartography and giscience, Lecture Notes in Geoinformation and Cartography. Springer, Heidelberg, pp 425–437Google Scholar
- Sergios T, Konstantinos K (2009) Pattern recognition, 4th edn. (ISBN 978-1-59749-272-0)Google Scholar
- Shea KS, McMaster RB (1989) Cartographic generalization in a digital environment: when and how to generalize. In: Proceedings of Auto-carto 9, Baltimore, pp 56–67Google Scholar
- Shindler M (2008) Approximation algorithm for the metric k-median problem. Masters thesis, Department of Computer Science, UCLAGoogle Scholar
- Zhang X, Ai T-h, Stoter J, Kraak MJ, Molenaar M (2013) Building pattern recognition in topographic data: example on collinear and curvilinear alignments. Geoinformatica 17(1):1–33Google Scholar