Skip to main content

An Algorithm of Constrained Spatial Association Rules Based on Binary

  • Conference paper
Advances in Neural Networks - ISNN 2008 (ISNN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5264))

Included in the following conference series:

Abstract

An algorithm of constrained association rules mining was presented in order to search for some items expected by people. Since some presented algorithms of association rules mining based on binary are complicated to generate frequent candidate itemsets, they may pay out heavy cost when these algorithms are used to extract constrained spatial association rules. And so this paper proposes an algorithm of constrained spatial association rules based on binary, the algorithm is suitable for mining constrained association among some different spatial objects under the same spatial pattern, which uses the way of ascending value to generates frequent candidate itemsets and digital character to reduce the number of scanned transaction in order to improve the efficiency. The experiment indicates that the algorithm is faster and more efficient than theses presented algorithms based on binary when mining constrained spatial association rules from spatial database.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Koperski, K., Han, J.: Discovery of Spatial Association Rules in Geographic Information Databases. In: Egenhofer, M.J., Herring, J.R. (eds.) Advances in Spatial Databases. LNCS, vol. 951, pp. 47–66. Springer, Berlin (1995)

    Google Scholar 

  2. Shekhar, S., Huang, Y.: Discovering Spatial Co-Location Patterns: A Summary of Results. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 1–19. Springer, Heidelberg (2001)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Database. In: Proc of the 20th NTL conf on Very Large Databases, pp. 487–499. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  4. Shao, F.J., Yu, Z.Q.C.: Principle and Algorithm of Data Mining, pp. 117–120. Water and Electricity Publication of China press, Beijing (2003)

    Google Scholar 

  5. Chen, G., Zhu, Y.Q., Yang, H.B.: Study of Some Key Techniques in Mining Association Rule. Journal of Computer Research and Development 42, 1785–1789 (2005)

    Article  Google Scholar 

  6. Fan, P., Liang, J.R., Li, T.Z., Gong, J.M.: Association Rules Mining Algorithm Based on Binary. Journal of Application Research of Computers 24, 79–81 (2007)

    Google Scholar 

  7. Han, J.W., Pei, J., Yin, Y.W.: Mining Frequent Patterns without Candidate Generation. In: ACM Proceedings of the 2000 ACM SIGMOD international conference on Management of data Dallas, pp. 1–12. ACM press, Netherlands (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, G., Wei, Z., Yin, Q. (2008). An Algorithm of Constrained Spatial Association Rules Based on Binary. In: Sun, F., Zhang, J., Tan, Y., Cao, J., Yu, W. (eds) Advances in Neural Networks - ISNN 2008. ISNN 2008. Lecture Notes in Computer Science, vol 5264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87734-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87734-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87733-2

  • Online ISBN: 978-3-540-87734-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics