
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Edwin M. Knorr, Raymond T. Ng, "Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 6, pp. 884897, December, 1996.  
BibTex  x  
@article{ 10.1109/69.553156, author = {Edwin M. Knorr and Raymond T. Ng}, title = {Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {8}, number = {6}, issn = {10414347}, year = {1996}, pages = {884897}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.553156}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining IS  6 SN  10414347 SP884 EP897 EPD  884897 A1  Edwin M. Knorr, A1  Raymond T. Ng, PY  1996 KW  Spatial knowledge discovery KW  concept generalization KW  proximity relationships KW  geometric filtering KW  GIS. VL  8 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—In this paper, we study two spatial knowledge discovery problems involving proximity relationships between
[1] R. Agrawal, S. Ghosh, T. Imielinski, B. Iyer, and A. Swami, “An Interval Classifier for Database Mining Applications,” Proc. 18th Conf. Very Large Databases, pp. 560–573, 1992.
[2] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACMSIGMOD Int'l Conf. Management of Data, pp. 207216, May 1993.
[3] F. Aurenhammer, "Voronoi Diagrams: A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol. 23, no. 3, 1991, pp. 345405.
[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. ACM SIGMOD Conf. Management of Data, 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. 551559, July 1983.
[6] C. Faloutsos, T. Sellis, and N. Roussopoulos, “Analysis of Object Oriented Spatial Access Methods,” Proc. ACM SIGMOD Conf. Management of Data, 1987.
[7] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[8] J. Han, Y. Cai, and N. Cercone, “Knowledge Discovery in Databases: an AttributeOriented Approach,” Proc. 18th Conf. Very Large Databases, pp. 547–559, 1992.
[9] D.A. Keim, H.P. Kriegel, and T. Seidl, “Supporting Data Mining of Large Databases by Visual Feedback Queries,” Proc. 10th Int'l Conf. Data Eng., pp. 302313, 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. 347350, 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. 275289, 1993.
[13] A. Melkman, "OnLine Construction of the Convex Hull of a Simple Polyline," Information Processing Letters, vol. 25, pp. 1112, 1987.
[14] R.T. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Databases, Morgan Kaufmann, 1994, pp. 144155.
[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. Cambridge Univ. Press, 1993.
[17] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[18] G. Salton and M. McGill, Introduction to Modern Information Retrieval, McGraw Hill, New York, 1983.
[19] H. Samet, The Design and Analysis of Spatial Data Structures. AddisonWesley, 1990.
[20] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[21] D. Shasha, T.L. Wang, “New Techniques for BestMatch Retrieval,” ACM Trans. Information Systems, vol. 8, no. 2, pp. 140158, Apr. 1990.