Skip to main content

SPARC: Spatial Association Rule-Based Classification

  • Chapter
Data Mining for Scientific and Engineering Applications

Part of the book series: Massive Computing ((MACO,volume 2))

Abstract

Spatial classification is to classify spatial objects based on the spatial and nonspatial features of these objects in a database. The classification results, taken as the models for the data, can be used for better understanding of the relationships among the objects in the database and for prediction of characteristics and features of new objects. Spatial classification is a challenging task due to the sparsity of spatial features which leads to high dimensionality and also the “curse of dimensionality. In this paper, we introduce an association-based spatial classification algorithm, called SPARC (SPatial Association Rule-based Classification), for efficient spatial classification in large geospatial databases. SPARC explores spatial association-based classification and integrates a few important techniques developed in spatial indexing and data mining to achieve high scalability when classifying a large number of spatial data objects. These techniques include micro-clustering, spatial join indexing, feature reduction by frequent pattern mining, and association-based classification. Our performance study shows that SPARC is efficient for classification of spatial objects in large databases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB’94), pages 487–499, Santiago, Chile, Sept. 1994.

    Google Scholar 

  2. N. Beckmann, H.-R Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. 1990 ACM SIGMOD Int. Conf.Management of Data (SIGMOD’90), pages 322–331, Atlantic City, NJ, June 1990.

    Chapter  Google Scholar 

  3. M. Ester, A. Frommelt, H.-P. Kriegel, and J. Sander. Algorithms for claracterization and trend detection in spatial databases. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD’98), pages 44–50, New York, NY, Aug. 1998.

    Google Scholar 

  4. M.J. Egenhofer. Reasoning about binary topological relations. In Proc. 1991 Int. Symp. Large Spatial Databases (SSD’, pages 143–160, Zurich, Switzerland, Aug. 1991.

    Google Scholar 

  5. M. Ester, H.-P. Kriegel, and J. Sander. Spatial data mining: A database approach. In Proc. 1997 Int. Symp. Large Spatial Databases (SSD’97), pages 47–66, Berlin, Germany, July 1997.

    Google Scholar 

  6. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A densitybased algorithm for discovering clusters in large spatial databases. In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD’96), pages 226–231, Portland, Oregon, Aug. 1996.

    Google Scholar 

  7. A. Guttman. R-tree: A dynamic index structure for spatial searching. In Proc. 1984 ACM-SIGMOD Int. Conf Management of Data (SIGMOD’84), pages 47–57, Boston, MA, June 1984.

    Chapter  Google Scholar 

  8. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’00), pages 1–12, Dallas, TX, May 2000.

    Chapter  Google Scholar 

  9. K. Koperski and J. Han. Discovery of spatial association rules in geographic information databases. In Proc. 1995 Int. Symp. Large Spatial Databases (SSD’95), pages 47–66, Portland, Maine, Aug. 1995.

    Google Scholar 

  10. K. Koperski, J. Han, and N. Stefanovic. An efficient two-step method for classification of spatial data. In Proc. 8th Symp. Spatial Data Handling, pages 45–55, Vancouver, Canada, 1998.

    Google Scholar 

  11. W. Lu and J. Han. Distance-associated join indices for spatial range search. In Proc. 1992 Int. Conf. Data Engineering (ICDE’92), pages 284–292, Phoenix, AZ, Feb. 1992.

    Google Scholar 

  12. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD’98), pages 80–86, New York, NY, Aug. 1998.

    Google Scholar 

  13. W. Li. Classification based on multiple association rules. In M. Sc. Thesis, School of Comptuing Science, Simon Eraser University, April 2001.

    Google Scholar 

  14. D. Rotem. Spatial join indices. In Proc. 1991 Int. Conf. Data Engineering (ICDE’91), pages 500–509, Kobe, Japan, April 1991.

    Google Scholar 

  15. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.

    Google Scholar 

  16. K. Wang, S. Zhou, and Y. He. Growing decision tree on support-less association rules. In Proc. 2000 Int. Conf. Knowledge Discovery and Data Mining (KDD’00), pages 265–269, Boston, MA, Aug. 2000.

    Google Scholar 

  17. T. S. Yeh. Spot: Distance based join indices for spatial data. In Proc. 1th Int. Symp. Advances in Geographic Information Systems, pages 103–109, Kansas City, MO, Nov. 1999.

    Google Scholar 

  18. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’96), pages 103–114, Montreal, Canada, June 1996.

    Chapter  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Han, J., Tung, A.K.H., He, J. (2001). SPARC: Spatial Association Rule-Based Classification. In: Grossman, R.L., Kamath, C., Kegelmeyer, P., Kumar, V., Namburu, R.R. (eds) Data Mining for Scientific and Engineering Applications. Massive Computing, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1733-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-1733-7_25

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-0114-7

  • Online ISBN: 978-1-4615-1733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics