@conference {20181,
	title = {Clustering with obstacles in spatial databases},
	booktitle = {In Proc. 2001 IEEE Int. Symposium of Signal Processing and Information Technology (ISSPIT{\textquoteright}01), pages 420-425},
	year = {2001},
	month = {December},
	address = {Cairo, Egypt},
	abstract = {<p>Clustering large spatial databases is an important problem, which tries to find the densely populated regions in a spatial area to be used in data mining, knowledge discovery, or efficient information retrieval. However most algorithms have ignored the fact that physical obstacles such as rivers, lakes, and highways exist in the real world and could thus affect the result of the clustering. In this paper, we propose CPO, 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 used to label the cell as dense or non-dense. It also labels each cell as obstructed (i.e. intersects any obstacle) or nonobstructed. For each obstructed cell, the algorithm finds a number of non-obstructed sub-cells. Then it finds the dense regions of non-obstructed cells or sub-cells by a breadthfirst search as the required clusters with a center to each region.</p>
},
	attachments = {https://scholar.cu.edu.eg/sites/default/files/maelzawawy/files/clustering_with_obstacles_in_spatial_databases.pdf},
	author = {Mohamed A. El-Zawawy and Mohamed E. El-Sharkawi}
}
