한국데이터정보과학회:학술대회논문집
- 한국데이터정보과학회 2003년도 춘계학술대회
- /
- Pages.97-108
- /
- 2003
Clustering Algorithm by Grid-based Sampling
-
Park, Hee-Chang
(Department of Statistics, Changwon National University) ;
- Ryu, Jee-Hyun (Department of Statistics, Changwon National University)
- 발행 : 2003.05.30
초록
Cluster analysis has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on on-line or off-line and so on. Clustering can identify dense and sparse regions among data attributes or object attributes. But it requires many hours to get clusters that we want, because of clustering is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new method of clustering using sample based on grid. It is more fast than any traditional clustering method and maintains its accuracy. It reduces running time by using grid-based sample. And other clustering applications can be more effective by using this methods with its original methods.
키워드