DBRS: A density-based spatial clustering method with random sampling

被引:0
作者
Wang, X [1 ]
Hamilton, HJ [1 ]
机构
[1] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
来源
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING | 2003年 / 2637卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel density-based spatial clustering method called DBRS. The algorithm can identify clusters of widely varying shapes, clusters of varying densities, clusters which depend on non-spatial attributes, and approximate clusters in very large databases. DBRS achieves these results by repeatedly picking an unclassified point at random and examining its neighborhood. A theoretical comparison of DBRS and DBSCAN, a well-known density-based algorithm, is also given in the paper.
引用
收藏
页码:563 / 575
页数:13
相关论文
共 9 条
[1]  
[Anonymous], P 4 INT S LARG SPAT
[2]  
BECKMANN N, 1990, SIGMOD REC, V19, P322, DOI 10.1145/93605.98741
[3]  
CRAMARIUC H, 1997, P DIG SIGN PROC STOC, P857
[4]  
Ester M, 1996, 2 INT C KNOWL DISCOV, P226, DOI DOI 10.5555/3001460.3001507
[5]  
Guha S., 1998, SIGMOD Record, V27, P73, DOI 10.1145/276305.276312
[6]   Data clustering: A review [J].
Jain, AK ;
Murty, MN ;
Flynn, PJ .
ACM COMPUTING SURVEYS, 1999, 31 (03) :264-323
[7]  
KOPERSKI K, 1996, SIGMOD 9L WORKSH RES, P55
[8]  
Ng R.T., 1994, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, P144
[9]  
[No title captured]