Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

AI
2005
Springer

favoriteEmaildiscussreport

188views Artificial Intelligence» more AI 2005»

A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets

13 years 10 months ago

A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets

Download www.ucalgary.ca

Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we briefly describe the methods and then compare them from a theoretical view. Finally, we give an empirical comparison of the algorithms.

Xin Wang, Howard J. Hamilton

Real-time Traffic

Active Research Area | AI 2005 | Artificial Intelligence | Spatial Clustering | Spatial Data Mining |

claim paper

Related Content

» On the Relationships between Clustering and Spatial Colocation Pattern Mining

» Clustering Large Datasets in Arbitrary Metric Spaces

» Clustering Algorithms Optimizer A Framework for Large Datasets

» Treebased partition querying a methodology for computing medoids in large spatial datasets

» CLOPE a fast and effective clustering algorithm for transactional data

» A practical comparison of two KMeans clustering algorithms

» Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density...

» Comparative study of unsupervised dimension reduction techniques for the visualization of ...

» Fast and exact outofcore and distributed kmeans clustering

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	AI
Authors	Xin Wang, Howard J. Hamilton

Comments (0)