Abstract
Spatial clustering is widely used in many fields such as WSN (Wireless Sensor Networks), web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying database. By discussing the relationships between the optimal clustering and the initial seeds, a clustering validity index and the principle of seeking initial seeds were proposed, and on this principle we recommend an initial seed-seeking strategy: SSPG (Single-Shortest-Path Graph). With SSPG strategy used in clustering algorithms, we find that the result of clustering is optimized with more probability. At the end of the paper, according to the combinational theory of optimization, a method is proposed to obtain optimal reference k value of cluster number, and is proven to be efficient.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wang Quanhong, Hassanein H, Takahara G (2004) Stochastic modeling of distributed, dynamic, randomized clustering protocols in wireless sensor networks [C]. ICPP 2004 Worlshop on Ad Hoc and Sensor Networks, Montreal
Bandyopadhyay S, Coyle E J (2003) An energy efficient hierarchical clustering algorithm for wireless sensor networks [C]. Proc. IEEE INFOCOM’03, San Francisco
Han Jiawei, Kamber M (2000) Data mining: concepts and techniques [M]. San Francisco: Morgan Kaufmann
MacQueen J B (1967) Some Methods for classification and Analysis of Multivariate observations [C]. Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley
Kaufman L, Rousseeuw P J (1990) Finding Groups in Data: an introduction to cluster analysis [M]. New York: John Wiley & Sons
Zhang Tian, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases [C]. Proceedings of the ACM SIGMOD Conference on Management of Data, Montreal, Canada
Beckmann N, Kriegel H P, Schneider R (1990) The R-tree: an efficient and robust access method for points and rectangles [C]. Proc. of ACM SIGMOD, Atlantic City, NJ
Li Yongsen, Yang Shanlin, Ma Xijun, et al. (2006) Optimization study on K value of spatial Clustering [J]. Journal of System Simulation, 18(3): 573–576
Knorr E, Ng R (1998) Algorithms for mining distance-based outliers in large datasets [C]. Proc of the VLDB Conference, New York
Barnett V, Lewis T (1994) Outliers in Statistical Data [M] New York: John Wiley & Sons
Tibshirani R (2001) Estimating the number of clusters in a data set via the gap statistic [R]. Tech.Rep., Stanford University
Li Suohua, Sun Zhihui, Zhou Xiaoyun (2006) Distributed clustering algorithm based on feature vector [J]. Computer Applications, 26(2): 379–382.
Suditdo G, Rajeev R, Kyuseok S (1998) CURE: an efficient clustering algorithm for Large Database [C]. Proceedings of the ACM SIGMOD Conference on Management of Data, Seattle, WA, USA.
Guo Jiansheng, Zhao Yi, Shi Pengfei (2001) An efficient dynamic concept clustering algorithm for data mining [J]. Journal of Software, 12(4): 582–591
Vitter J (1985) Random sampling with a reservoir [J]. ACM Transactions on Mathematical software, 11(1):37–57
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No.60502028, No. 90204008).
About this article
Cite this article
Yang, J., Yan, P., Xia, D. et al. Analysis of spatial clustering optimization. Geo-spat. Inf. Sci. 11, 302–307 (2008). https://doi.org/10.1007/s11806-008-0109-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11806-008-0109-5