Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining.

@article{DBLP:journals/tkde/KnorrN96,
  author    = {Edwin M. Knorr and
               Raymond T. Ng},
  title     = {Finding Aggregate Proximity Relationships and Commonalities in
               Spatial Data Mining},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {8},
  number    = {6},
  year      = {1996},
  pages     = {884-897},
  ee        = {db/journals/tkde/KnorrN96.html, db/journals/tkde/KnorrN96.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

CDROM Edition

References

[1]

Rakesh Agrawal, Sakti P. Ghosh, Tomasz Imielinski, Balakrishna R. Iyer, Arun N. Swami: An Interval Classifier for Database Mining Applications. VLDB 1992: 560-573 BibTeX

[2]

Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216 BibTeX

[3]

Franz Aurenhammer: Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Comput. Surv. 23(3): 345-405(1991) BibTeX

[4]

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331 BibTeX

[5]

...

[6]

Christos Faloutsos, Timos K. Sellis, Nick Roussopoulos: Analysis of Object Oriented Spatial Access Methods. SIGMOD Conference 1987: 426-439 BibTeX

[7]

Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 BibTeX

[8]

Jiawei Han, Yandong Cai, Nick Cercone: Knowledge Discovery in Databases: An Attribute-Oriented Approach. VLDB 1992: 547-559 BibTeX

[9]

Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl: Supporting Data Mining of Large Databases by Visual Feedback Queries. ICDE 1994: 302-313 BibTeX

[10]

...

[11]

Edwin M. Knorr, Raymond T. Ng: Extraction of Spatial Proximity Patterns by Concept Generalization. KDD 1996: 347-350 BibTeX

[12]

...

[13]

Avraham A. Melkman: On-Line Construction of the Convex Hull of a Simple Polyline. Inf. Process. Lett. 25(1): 11-12(1987) BibTeX

[14]

Raymond T. Ng, Jiawei Han: Efficient and Effective Clustering Methods for Spatial Data Mining. VLDB 1994: 144-155 BibTeX

[15]

...

[16]

...

[17]

Franco P. Preparata, Michael Ian Shamos: Computational Geometry - An Introduction. Springer 1985, ISBN 3-540-96131-3
BibTeX

[18]

Gerard Salton, Michael McGill: Introduction to Modern Information Retrieval. McGraw-Hill Book Company 1984, ISBN 0-07-054484-0
BibTeX

[19]

Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley 1990
BibTeX

[20]

Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB 1987: 507-518 BibTeX

[21]

Dennis Shasha, Jason Tsong-Li Wang: New Techniques for Best-Match Retrieval. ACM Trans. Inf. Syst. 8(2): 140-158(1990) BibTeX

Referenced by

1. Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, Jörg Sander: OPTICS: Ordering Points To Identify the Clustering Structure. SIGMOD Conference 1999: 49-60
2. Wei Wang, Jiong Yang, Richard R. Muntz: STING+: An Approach to Active Spatial Data Mining. ICDE 1999: 116-125
3. Edwin M. Knorr, Raymond T. Ng: Algorithms for Mining Distance-Based Outliers in Large Datasets. VLDB 1998: 392-403