A feasible method to find areas with constraints using hierarchical depth-first clustering
暂无分享,去创建一个
[1] M. Narasimha Murty,et al. A computationally efficient technique for data-clustering , 1980, Pattern Recognit..
[2] S. Aronoff. Geographic Information Systems: A Management Perspective , 1989 .
[3] A. Cracknell. The advanced very high resolution radiometer , 1997 .
[4] Anthony K. H. Tung,et al. Constraint-based clustering in large databases , 2001, ICDT.
[5] Xiaoyang Sean Wang,et al. Value Range Queries on Earth Science Data via Histogram Clustering , 2000, TSDM.
[6] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[7] Anthony K. H. Tung,et al. COE: Clustering with Obstacles Entities. A Preliminary Study , 2000, PAKDD.
[8] Xiaoyang Sean Wang,et al. A pyramid data model for supporting content-based browsing and knowledge discovery , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).
[9] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[10] Anthony K. H. Tung,et al. Spatial clustering in the presence of obstacles , 2001, Proceedings 17th International Conference on Data Engineering.
[11] Brian Everitt,et al. Cluster analysis , 1974 .
[12] Hanan Samet,et al. Applications of spatial data structures , 1989 .
[13] Chun Hung Cheng. A branch and bound clustering algorithm , 1995, IEEE Trans. Syst. Man Cybern..