The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovery of Spatial Association Rules in Geographic Information Databases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Spatial Data Mining: A Database Approach
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Spatial clustering with obstacles constraints using particle swarm optimization
Proceedings of the 2nd international conference on Scalable information systems
Improving density-based methods for hierarchical clustering of web pages
Data & Knowledge Engineering
Improved search strategies and extensions to k-medoids-based clustering algorithms
International Journal of Business Intelligence and Data Mining
A Novel Spatial Clustering Algorithm with Sampling
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
NPClu: An approach for clustering spatially extended objects
Intelligent Data Analysis
Density link-based methods for clustering web pages
Decision Support Systems
An efficient algorithm for finding dense regions for mining quantitative association rules
Computers & Mathematics with Applications
A Particle Swarm Optimization Method for Spatial Clustering with Obstacles Constraints
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Attaining higher quality for density based algorithms
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Spatial clustering with obstacles constraints using ant colony and particle swarm optimization
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
A quantum particle swarm optimization used for spatial clustering with obstacles constraints
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
A novel method to find appropriate for ε for DBSCAN
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
Obstacle clustering and outlier detection
Proceedings of the 48th Annual Southeast Regional Conference
Spatial entropy-based clustering for mining data with spatial correlation
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Swarm-Based distributed clustering in peer-to-peer systems
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Calculation of density-based clustering parameters supported with distributed processing
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
A density-based spatial clustering for physical constraints
Journal of Intelligent Information Systems
A comparative study of two density-based spatial clustering algorithms for very large datasets
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
Towards an ontology-based spatial clustering framework
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
Towards automatic Eps calculation in density-based clustering
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
AEC algorithm: a heuristic approach to calculating density-based clustering Eps parameter
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
A novel spatial clustering with obstacles constraints based on PNPSO and k-medoids
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
| Hi-index | 0.00 |
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 nonspatial 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.