Skip to main content

An Improved Database Classification Algorithm for Multi-database Mining

  • Conference paper
Frontiers in Algorithmics (FAW 2009)

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

Included in the following conference series:

Abstract

Database classification is a data preprocessing technique for multi-database mining. To reduce search costs in the data from all databases, we need to identify those databases which are most likely relevant to a data mining application. Based on the related research, the algorithm GreedyClass and BestClassification [7]are improved in order to optimize the time complexity of algorithm and to obtainthe best classification from m given databases. Theoretical analysis and experimental results show the efficiency of the proposed algorithm.

The work was supported by the natural science fund from Anhui Education Department (serial number: KJ2008B122). Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Wu, X.D., Zhang, S.: Synthesizing High-Frequency Rules from Different Data Sources. J. IEEE Transactions on Knowledge and Data Engineering 15(2), 353–367 (2003)

    Article  Google Scholar 

  2. Zhang, C., Zhang, S.: Association Rules Mining: Models and Algorithms. LNCS, vol. 2307, p. 243. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  3. Li, H.: Strategy of Parallel Association Rules Mining Based on Cluster System. J. Journal of Hefei University of Thchnology 30(3), 274–277 (2007)

    Google Scholar 

  4. Liu, H., Lu, H., Yao, J.: Identifying Relevant Databases for Multidatabase Mining.R. In: Proceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 210–221 (1998)

    Google Scholar 

  5. Liu, H., Lu, H., Yao, J.: Toward multi-database mining: identifying relevant databases. J. IEEE Transactions Knowledge Data Engineering 13(4), 541–553 (2001)

    Article  Google Scholar 

  6. Tang, Y.F., Niu, L., Zhong, Z., Zhang, C.Q.: Application-independent Database Classification Research in Multi-database Mining. J. Journal of GuanGxi normal university 21(4), 32–36 (2003)

    Google Scholar 

  7. Wu, X.D., Zhang, C.Q., Zhang, S.C.: Database classification for multi-database mining. J. Elsevier Computer Science. Information Systems 30, 71–88 (2005)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Hu, X., Zhang, Y. (2009). An Improved Database Classification Algorithm for Multi-database Mining. In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02270-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02269-2

  • Online ISBN: 978-3-642-02270-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics