A Database Interface for Clustering in Large Spatial Databases
Explore this paper's citation graph
Summary
This paper presents an interface to the database management system (DBMS) based on a spatial access method, the R*-tree, which is crucial for the efficiency of KDD on large databases and proposes a method for spatial data sampling as part of the focusing component, significantly reducing the number of objects to be clustered.
- Type
- article
- Published
- 1995-08-20
- Cited by
- 159
- References
- 18
- OpenAlex
- https://openalex.org/W2101616188
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:2061991
Keywords
Database, Computer science, Spatial database, Cluster analysis, Data mining
References
- Finding Groups in Data: An Introduction to Cluster Analysis
- Efficient and Effective Clustering Methods for Spatial Data Mining
- Discovery of General Knowledge in Large Spatial Databases
- Architectural Support for Data Mining
- Measurement of protein surface shape by solid angles
- Multi-step processing of spatial joins
- Database Mining: A Performance Perspective
- Systems for Knowledge Discovery in Databases
- Data-Driven Discovery of Quantitative Rules in Relational Databases
- The R*-tree: an efficient and robust access method for points and rectangles
- Knowledge DIscovery in Databases:An Overview
- Data bank
- Knowledge Discovery in Databases
- Knowledge Discovery in Databases
- Knowledge Discovery in Databases: An Overview
- A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
- This Is a Publication of the American Association for Artificial Intelligence
Cited by
- Very Fast Outlier Detection in Large Multidimensional Data Sets
- Self Organizing Sensors by Minimization of Cluster Heads Using Intelligent Clustering
- Direct Manipulation Querying of Database Systems
- Consensus and analia: new challenges in detection and management of security vulnerabilities in data networks
- Density-Connected Sets and their Application for Trend Detection in Spatial Databases
- A descoberta de conhecimento em bases de dados geográficas através da explicitação semântica
- Perimeter Clustering Algorithm to Reduce the Number of Iterations
- Scalable and practical probability density estimators for scientific anomaly detection
- Scaling Clustering Algorithms to Large Databases
- A qualitative spatial reasoning approach in knowledge discovery in spatial databases
- Detecting Current Outliers: Continuous Outlier Detection over Time-Series Data Streams
- Etude comportementale des mesures d'intérêt d'extraction de connaissances. (Behavioral study of interestingness measures of knowledge extraction)
- Advances in Databases and Information Systems: Third East European Conference, ADBIS’99 Maribor, Slovenia, September 13–16, 1999 Proceedings
- Learning Simple Relations: Theory and Applications
- CURIO: A Fast Outlier and Outlier Cluster Detection Algorithm for Large Datasets
- A Fast Parallel Clustering Algorithm for Large Spatial Databases
- Data mining and personalization technologies
- X-means: Extending K-means with Efficient Estimation of the Number of Clusters
- CURIO : A Fast Outlier Clustering Algorithm for Large Datasets∗
- Clustering sequences of categorical values
Related papers
- BIRCH: an efficient data clustering method for very large databases
- Efficient and Effective Clustering Methods for Spatial Data Mining
- A density-based algorithm for discovering clusters in large spatial Databases with Noise
- Automatic subspace clustering of high dimensional data for data mining applications
- Algorithms for Clustering Data
- The R*-tree: an efficient and robust access method for points and rectangles
- Algorithms for Mining Distance-Based Outliers in Large Datasets