Skip to main content

An Algorithm of Alternately Mining Frequent Neighboring Class Set

  • Conference paper
Advances in Swarm Intelligence (ICSI 2010)

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

Included in the following conference series:

Abstract

Aiming to these present frequent neighboring class set mining algorithms existing more repeated computing and redundancy neighboring class set, this paper proposes an algorithm of alternately mining frequent neighboring class set, which is suitable for mining frequent neighboring class set of objects in large spatial data. The algorithm uses the regression method to create database of neighboring class set, and uses the alternative method to generate candidate frequent neighboring class set, namely, it uses increasing sequence to generate candidate in the one hand, it also uses decreasing sequence to generate candidate on the other hand, it only need scan once database to extract frequent neighboring class set. The algorithm improves mining efficiency by the alternative method, since not only using numerical variable to generate candidate is simple, but also using logic operation to compute support is very simple. The result of experiment indicates that the algorithm is faster and more efficient than presented algorithms when mining frequent neighboring class set in large spatial data.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Ma, R.H., Pu, Y.X., Ma, X.D.: GIS Spatial Association Pattern Ming. Science Press, Beijing (2007)

    Google Scholar 

  2. Ma, R.H., He, Z.Y.: Mining Complete and Correct Frequent Neighboring Class Sets from Spatial Databases. Journal of Geomatics and Information Science of Wuhan University 32(2), 112–114 (2007)

    MathSciNet  Google Scholar 

  3. Zhang, X.W., Su, F.Z., Shi, Y.S., Zhang, D.D.: Research on Progress of Spatial Association Rule Mining. Journal of Progress in Geography 26(6), 119–128 (2007)

    Google Scholar 

  4. Liu, Y.L., Fang, G.: The research and application of a transaction complement mining algorithm. Journal of Computer Engineering and Applications 44(35), 168–170 (2008)

    MathSciNet  Google Scholar 

  5. Fang, G., Wei, Z.K., Yin, Q.: Extraction of Spatial Association Rules Based on Binary Mining Algorithm in Mobile Computing. In: IEEE Information Conference on Information and Automation, pp. 1571–1575. IEEE press, China (2008)

    Chapter  Google Scholar 

  6. Fang, G., Liu, Y.L.: Application of Binary System Based Spatial Mining Algorithm in Mobile Intelligent Systems. Journal of Southwest University (Natural Science Edition) 31(1), 95–99 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, G. (2010). An Algorithm of Alternately Mining Frequent Neighboring Class Set. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics