Computational geometry: an introduction
Computational geometry: an introduction
On-line construction of the convex hull of a simple polyline
Information Processing Letters
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
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
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Computational geometry in C
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
Supporting Data Mining of Large Databases by Visual Feedback Queries
Proceedings of the Tenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Interval Classifier for Database Mining Applications
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Knowledge Discovery in Databases: An Attribute-Oriented Approach
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A spatial data mining method by Delaunay triangulation
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
High performance clustering based on the similarity join
Proceedings of the ninth international conference on Information and knowledge management
Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Tri-plots: scalable tools for multidimensional data mining
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent neighboring class sets in spatial databases
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Parallel Mining of Outliers in Large Database
Distributed and Parallel Databases
Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
An Approach to Active Spatial Data Mining Based on Statistical Information
IEEE Transactions on Knowledge and Data Engineering
Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes
IEEE Transactions on Knowledge and Data Engineering
Multiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases
IEEE Transactions on Knowledge and Data Engineering
Algorithms for Mining Distance-Based Outliers in Large Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficiently Computing Weighted Proximity Relationships in Spatial Databases
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Efficiently Matching Proximity Relationships in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
``Seeing'' Objects in Spatial Datasets
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
Data mining tasks and methods: spatial analysis
Handbook of data mining and knowledge discovery
A survey of spatial data mining methods databases and statistics point of views
Data warehousing and web engineering
A unified approach for mining outliers
CASCON '97 Proceedings of the 1997 conference of the Centre for Advanced Studies on Collaborative research
Performing boundary shape matching in spatial data
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
A bibliography of temporal, spatial and spatio-temporal data mining research
ACM SIGKDD Explorations Newsletter
Mining spatial association rules in image databases
Information Sciences: an International Journal
Relation-based aggregation: finding objects in large spatial datasets
Intelligent Data Analysis
Automatic extraction of clusters from hierarchical clustering representations
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
A performance evaluation framework for association mining in spatial data
Journal of Intelligent Information Systems
Co-location pattern mining for unevenly distributed data: algorithm, experiments and applications
International Journal of Computational Science and Engineering
Hi-index | 0.00 |
In this paper, we study two spatial knowledge discovery problems involving proximity relationships between clusters and features. The first problem is: Given a cluster of points, how can we efficiently find features (represented as polygons) that are closest to the majority of points in the cluster? We measure proximity in an aggregate sense due to the nonuniform distribution of points in a cluster (e.g., houses on a map), and the different shapes and sizes of features (e.g., natural or man-made geographic features). The second problem is: Given n clusters of points, how can we extract the aggregate proximity commonalities (i.e., features) that apply to most, if not all, of the n clusters? Regarding the first problem, the main contribution of the paper is the development of Algorithm CRH which uses geometric approximations (i.e., circles, rectangles, and convex hulls) to filter and select features. Highly scalable and incremental, Algorithm CRH can examine over 50,000 features and their spatial relationships with a given cluster in approximately one second of CPU time. Regarding the second problem, the key contribution is the development of Algorithm GenCom that makes use of concept generalization to effectively derive many meaningful commonalities that cannot be found otherwise.