GMDBSCAN: Multi-Density DBSCAN Cluster Based on Grid
DBSCAN is one of the most popular algorithms for cluster analysis. It can discover all clusters with arbitrary shape and separate noises. But this algorithm cant choose parameter according to distributing of dataset. It simply uses the global MinPts parameter, so that the clustering result of multi-density database is inaccurate. In addition, when it is used to cluster large databases, it will cost too much time. For these problems, we propose GMDBSCAN algorithm which is based on spatial index and grid technique. An experimental evaluation shows that GMDBSCAN is effective and efficient.
Chen Xiaoyun Min Yufang Zhao Yan Wang Ping
School of Information Science and Engineering, Lanzhou University Lanzhou 730000.PRC China School of Information Science and Engineering, Lanzhou University Lanzhou 30000.PRC China
国际会议
AiR08,EM2108,SOAIC08,SIOKM08,BIMA08,DKEEE08(2008IEEE国际电子商务工程学术会议)
西安
英文
780-783
2008-10-22(万方平台首次上网日期,不代表论文的发表时间)