COE: Clustering with Obstacles Entities A Preliminary Study
Clustering analysis has been a very active area of research in the data mining community. However, most algorithms have ignored the fact that physical obstacles exist in the real world and could thus affect 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 Obstacles Entities) problem and provide an outline of an algorithm called COE-CLARANS to solve it.
Unable to display preview. Download preview PDF.
- [BFR98]P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Proc. 4th Int. Conf. Knowledge Discovery and Data Mining (KDD’98), pages 9–15, New York, NY, August 1998.Google Scholar
- [HK00]J. Han and M. Kamber. Data Mining: Concepts and Techniques. (to be published by) Morgan Kaufmann, 2000.Google Scholar
- [NH94]R. Ng and J. Han. Efficient and effective clustering method for spatial data mining. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 144–155, Santiago, Chile, September 1994.Google Scholar
- [ZRL96]T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data, pages 103–114, Montreal, Canada, June 1996.Google Scholar