Coe: Clustering with obstacles entities a preliminary study

13Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering analysis has been a very active area of research in the data mining community. However, most algorithms have ignored the tact that physical obstacles exist in the real world and could thus aiffect the result of clustering dramatically. In this paper, we will look at the problem of clustering in the presence of obstacles. We called this problem the COE (Clustering with Obstaicles Entities) problem and provide an outhne of an algorithm called COE-CLARANS to solve it.

Cite

CITATION STYLE

APA

Tung, A. K. H., Hon, J., & Han, J. (2000). Coe: Clustering with obstacles entities a preliminary study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1805, pp. 165–168). Springer Verlag. https://doi.org/10.1007/3-540-45571-x_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free