Abstract
Spatial data mining recently emerges from a number of real applications, such as real-estate marketing, urban planning, weather forecasting, medical image analysis, road traffic accident analysis, etc. It demands for efficient solutions for many new, expensive, and complicated problems. In this paper, we investigate the problem of evaluating the top k distinguished “features” for a “cluster” based on weighted proximity relationships between the cluster and features. We measure proximity in an average fashion to address possible nonuniform data distribution in a cluster. Combining a standard multi-step paradigm with new lower and upper proximity bounds, we presented an efficient algorithm to solve the problem. The algorithm is implemented in several different modes. Our experiment results not only give a comparison among them but also illustrate the efficiency of the algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules, Proceedings of the 20th VLDB Conference, 487–499, 1994.
M. Ankerst, B. Braunmuller, H.-P. Kriegel, T. Seidl, Improving Adaptable Similarity Query Processing by Using Approximations, Proceedings of the 24th VLDB Conference, 206–217, 1998.
W. G. Aref and H. Samet, Optimization Strategies for Spatial Query Processing, Proceedings of the 17th VLDB Conference, 81–90, 1991.
M. Ester, H.-P. Kriegel, J. Sander and X. Xu, A density-based algorithm for discovering clusters in large spatial databases, Proceedings of the Second International Conference on Data Mining KDD-96, 226–231, 1996.
M. Este, H.-P. Kriegel, J. Sander, Spatial Data Mining: A Database Approach, SSD’97, LNCS 1262, 47–65, 1997.
U.M. Fayyad, S.G. Djorgovski, and N. Weir, Automating the analysis and cataloging of sky surveys, Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996.
U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds. Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, Menlo Park, CA, 1996.
R. H. Guting, An Introduction to Spatial Database Systems, VLDB Journal, 3(4), 357–400, 1994.
J. Han, Y. Cai, and N. Cercone, Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases, IEEE Trans. knowledge and Data Engineering, 5, 29–40, 1993.
J. Han, K. Koperski, and N. Stefanovic, GeoMiner: A System Prototype for Spatial Data Mining, Proceedings of 1997 ACM-SIGMOD International Conference on Management, 553–556, 1997.
L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: an Introduction to Cluster Analysis, John Wiley & Sons, 1990.
E. M. Knorr and R. T. Ng, Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining, IEEE Transactions on Knowledge and Data Engineering, 8(6), 884–897, 1996.
K. Koperski and J. Han, Discovery of Spatial Association Rules in Geographic Information Databases, Advances in Spatial Databases, Proceeding of 4th Symposium (SSD’95), 47–66, 1995.
K. Koperski, J. Han, and J. Adhikary, Mining Knowledge in Geographic Data, to appear in Communications of ACM.
X. Lin, X. Zhou, C. Liu, and X. Zhou, Efficiently Computing Weighted Proximity Relationships in Spatial Databases, (http://www.cse.unsw.edu.au/~lxue), 2001.
H. Lu, J. Han, and B. C. Ooi, Knowledge Discovery in Large Spatial Databases, Proceedings of Far East Workshop on Geographic Information Systems, 275–289, 1993.
N. Ng and J. Han, Efficient and Effective Clustering Method for Spatial Data Mining, Proceeding of 1994 VLDB, 144–155, 1994.
J. S. Park, M.-S. Chen, and P. S. Yu, An Effective Hash-Based Algorithm for Mining Association Rules, Proceedings of 1995 ACM SIGMOD, 175–186, 1995.
F. Preparata and M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990.
G. Shaw and D. Wheeler, Statistical Techniques in Geographical Analysis, London, David Fulton, 1994.
X. Xu, M. Ester, H.-P. Kriegel, Jorg Sander, A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases, ICDE’98, 324–331, 1998.
T. Zhang, R. Ramakrishnan and M. Livny, BIRCH: an efficient data clustering method for very large databases, Proceeding of 1996 ACM-SIGMOD International Conference of Management of Data, 103–114, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, X., Zhou, X., Liu, C., Zhou, X. (2001). Efficiently Computing Weighted Proximity Relationships in Spatial Databases. In: Wang, X.S., Yu, G., Lu, H. (eds) Advances in Web-Age Information Management. WAIM 2001. Lecture Notes in Computer Science, vol 2118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47714-4_26
Download citation
DOI: https://doi.org/10.1007/3-540-47714-4_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42298-3
Online ISBN: 978-3-540-47714-3
eBook Packages: Springer Book Archive