Finding aggregate proximity relationships and commonalities in spatial data mining

IEEE Transactions on Knowledge and Data Engineering

Volumn 8, Issue 6, 1996, Pages 884-897

  Knorr, Edwin M ^a   Ng, Raymond T ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Concept generalization; Geometric filtering; GIS; Proximity relationships; Spatial knowledge discovery

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; GEOMETRY; KNOWLEDGE BASED SYSTEMS; SIGNAL FILTERING AND PREDICTION;

CONCEPT GENERALIZATION; GEOMETRIC FILTERING; PROXIMITY RELATIONSHIPS; SPATIAL DATA MINING;

DATA REDUCTION;

EID: 0030383106     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.553156     Document Type: Article

References (21)

1. R. Agrawal, S. Ghosh, T. Imielinski, B. Iyer, and A. Swami, "An Interval Classifier for Database Mining Applications," Proc. 18th VLDB, pp. 560-573, 1992.
2. R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules Between Sets of Items in Large Databases," Proc. SIGMOD, pp. 207-216, 1993.
3. F. Aurenhammer, "Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, Sept. 1991.
4. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. SIGMOD, pp. 322-331, 1990.
5. H. Edelsbrunner, D.G. Kirkpatrick, and R. Seidel, "On the Shape of a Set of Points in the Plane," IEEE Trans. Information Theory, vol. 29, no. 4, pp. 551-559, July 1983.
6. C. Faloutsos, T. Sellis, and N. Rossopoulos, "Analysis of Object-Oriented Spatial Access Methods," Proc. SIGMOD, pp. 426-439, 1987.
7. R. Guttmann, "A Dynamic Index Structure for Spatial Searching," Proc. SIGMOD, pp. 47-57, 1984.
8. J. Han, Y. Cai, and N. Cercone, "Knowledge Discovery in Databases: An Attribute-Oriented Approach," Proc. 18th VLDB, pp. 547-559, 1992.
9. D. Keim, H.-P. Kriegel, and T. Seidl, "Supporting Data Mining of Large Databases by Visual Feedback Queries," Proc. 10th Data Eng., pp. 302-313, 1994.
10. E.M. Knorr, Efficiently Determining Aggregate Proximity Relationships in Spatial Data Mining, MSc thesis, Dept. of Computer Science, Univ. of British Columbia, 1995.
11. E.M. Knorr and R.T. Ng, "Extraction of Spatial Proximity Patterns by Concept Generalization," Proc. Second KDD, pp. 347-350, Aug. 1996.
12. W. Lu, J. Han, and B.C. Ooi, "Discovery of General Knowledge in Large Spatial Databases," Proc. Far East Workshop on Geographic Information Systems, Singapore, pp. 275-289, 1993.
13. A. Melkman, "On-Line Construction of the Convex Hull of a Simple Polyline," Information Processing Letters, vol. 25, pp. 11-12, 1987.
14. R. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 20th VLDB, pp. 144-155, 1994.
15. A. Okabe, B. Boots, and K. Sugihara, "Nearest Neighbourhood Operations with Generalized Voronoi Diagrams: A Review," Univ. of Tokyo, Dept. of Urban Engineering, Discussion Paper Series, no. 51, Sept. 1992.
16. J. O'Rourke, Computational Geometry in C. New York: Cambridge Univ. Press, 1994.
17. F.P. Preparata and M.I. Shamos, Computational Geometry. New York: Springer-Verlag, 1985.
18. G. Salton and M. McGill, Introduction to Modern Information Retrieval, McGraw-Hill, 1983.
19. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
20. +-Tree: A Dynamic Index for Multi-Dimensional Objects," Proc. VLDB, pp. 507-518, 1987.
21. D. Shasha and T.-L. Wang, "New Techniques for Best-Match Retrieval," ACM Trans. Information Systems, vol. 8, no. 2, pp. 140-158, 1990.