By Topic

Density Based Cluster in the Presence of Spatial Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhi-Wei Sun ; Coll. of Comput. Sci. & Inf. Eng., Tianjin Univ. of Sci. & Technol., Tianjin ; Zheng Zhao

Clustering spatial data is a well-known problem that has been extensively studied. Although many methods have been proposed in the literature, but few have handled the spatial constraints properly, which may have significant consequences on the effectiveness of the clustering. Taking into account these constraints during the clustering process is costly and the modeling of the constraints is paramount for good performance. In this paper, we investigate the problem of clustering in the presence of constraints such as physical obstacles and facilitator, and introduce a new approach named DBOF which model the obstacle using polygons, and model the facilitator using the especial graphical structure with nodes of crossing points, Both theory analysis and experimental results confirm that DBOF can cluster data objects efficiently while considering all physical constraints and its complexity is linear with the difficulty of constraints.

Published in:

Computer Science and Software Engineering, 2008 International Conference on  (Volume:4 )

Date of Conference:

12-14 Dec. 2008