Skip to main content

Evaluation of Common Counting Method for Concurrent Data Mining Queries

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2798))

Abstract

Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we focus on frequent itemset mining and we discuss and experimentally evaluate the implementation of the Common Counting method on top of the Apriori algorithm. The general idea of Common Counting is to reduce the number of times the common parts of the source datasets are scanned during the processing of the set of frequent pattern queries.

This work was partially supported by the grant no. 4T11C01923 from the State Committee for Scientific Research (KBN), Poland.

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. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proc. of the 1993 ACM SIGMOD Conf. on Management of Data (1993)

    Google Scholar 

  2. Agrawal, R., Mehta, M., Shafer, J., Srikant, R., Arning, A., Bollinger, T.: The Quest Data Mining System. In: Proc. of the 2nd Int’l Conference on Knowledge Discovery in Databases and Data Mining, Portland, Oregon (1996)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th Int’l Conf. on Very Large Data Bases (1994)

    Google Scholar 

  4. Ceri, S., Meo, R., Psaila, G.: A New SQL-like Operator for Mining Association Rules. In: Proc. of the 22nd Int’l Conference on Very Large Data Bases (1996)

    Google Scholar 

  5. Hettich, S., Bay, S.D.: The UCI KDD Archive. University of California, Irvine, CA, Department of Information and Computer Science (1999), http://kdd.ics.uci.edu

  6. Han, J., Fu, Y., Wang, W., Chiang, J., Gong, W., Koperski, K., Li, D., Lu, Y., Rajan, A., Stefanovic, N., Xia, B., Zaiane, O.R.: DBMiner: A System for Mining Knowledge in Large Relational Databases. In: Proc. of the 2nd KDD Conference (1996)

    Google Scholar 

  7. Han, J., Pei, J.: Mining Frequent Patterns by Pattern-Growth: Methodology and Implications. SIGKDD Explorations, December 2000 (2000)

    Google Scholar 

  8. Imielinski, T., Mannila, H.: A Database Perspective on Knowledge Discovery. Communications of the ACM 39(11) (1996)

    Google Scholar 

  9. Imielinski, T., Virmani, A., Abdulghani, A.: Datamine: Application programming interface and query language for data mining. In: Proc. of the 2nd KDD Conference (1996)

    Google Scholar 

  10. Zheng, Z., Kohavi, R., Mason, L.: Real World Performance of Association Rule Algorithms. In: Proc. of the 7th KDD Conference (2001)

    Google Scholar 

  11. Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Data Mining Support in Database Management Systems. In: Proc. of the 2nd DaWaK Conference (2000)

    Google Scholar 

  12. Morzy, T., Zakrzewicz, M.: SQL-like Language for Database Mining. In: ADBIS 1997 Symposium (1997)

    Google Scholar 

  13. Wojciechowski, M., Zakrzewicz, M.: Methods for Batch Processing of Data Mining Queries. In: Proc. of the 5th International Baltic Conference on Databases and Information Systems (2002)

    Google Scholar 

  14. Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(3) (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wojciechowski, M., Zakrzewicz, M. (2003). Evaluation of Common Counting Method for Concurrent Data Mining Queries. In: Kalinichenko, L., Manthey, R., Thalheim, B., Wloka, U. (eds) Advances in Databases and Information Systems. ADBIS 2003. Lecture Notes in Computer Science, vol 2798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39403-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39403-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20047-5

  • Online ISBN: 978-3-540-39403-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics