Algorithm for Spatial Clustering with Obstacles

Details Algorithm for Spatial Clustering with Obstacles Algorithm for Spatial Clustering with Obstacles

2009-09-24

arxiv.org/abs/0909.4412v1

Computer Science

Databases

In Proc. 2002 ICICIS Int. Conference on Intelligent Computing and Information Systems (ICICIS02), Cairo, Egypt, June 2002

Scientific paper

In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical information that enables us to label the cell as dense or non-dense. We also label each cell as obstructed (i.e. intersects any obstacle) or non-obstructed. Then the algorithm finds the regions (clusters) of connected, dense, non-obstructed cells. Finally, the algorithm finds a center for each such region and returns those centers as centers of the relatively dense regions (clusters) in the spatial area.

Affiliated with

Also associated with

No associations

Rating

Algorithm for Spatial Clustering with Obstacles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithm for Spatial Clustering with Obstacles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm for Spatial Clustering with Obstacles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-425098