Skip to main content

Hardware Enhanced Mining for Association Rules

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3918))

Abstract

In this paper, we propose a hardware-enhanced mining framework to cope with many challenging data mining tasks in a data stream environment. In this framework, hardware enhancements are implemented in commercial Field Programmable Gate Array (FPGA) devices, which have been growing rapidly in terms of density and speed. By exploiting the parallelism in hardware, many data mining primitive subtasks can be executed with high throughput, thus increasing the performance of the overall data mining tasks. Simple operations like counting, which take a major portion of conventional mining execution time, can in fact be executed on the hardware enhancements very efficiently. Subtask modules that are used repetitively can also be replaced with the equivalent hardware enhancements. Specifically, we realize an Apriori-like algorithm with our proposed hardware-enhanced mining framework to mine frequent temporal patterns from data streams. The frequent counts of 1-itemsets and 2-itemsets are obtained after one pass of scanning the datasets with our hardware implementation. It is empirically shown that the hardware enhancements provide the scalability by mapping the high complexity operations such as subset itemsets counting to the hardware. Our approach achieve considerably higher throughput than traditional database architectures with pure software implementation. With fast increase in applications of mobile devices where power consumption is a concern and complicated software executions are prohibited, it is envisioned that hardware enhanced mining is an important direction to explore.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)

    Google Scholar 

  2. Agrawal, R., Shafer, J.C.: Parallel mining of association rules. IEEE Trans. on Knowledge And Data Engineering 8(6), 962–969 (1996)

    Article  Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, pp. 487–499 (1994)

    Google Scholar 

  4. Chen, M.-S., Han, J., Yu, P.S.: Data mining: an overview from a database perspective. IEEE Trans. on Knowledge and Data Engineering 8, 866–883 (1996)

    Article  Google Scholar 

  5. Han, E.-H., Karypis, G., Kumar, V.: Scalable parallel data mining for association rules. In: ACM SIGMOD Conf. on Management of Data, pp. 277–288 (1997)

    Google Scholar 

  6. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)

    MATH  Google Scholar 

  7. Jean, J.S.N., Dong, G., Zhang, H., Guo, X., Zhang, B.: Query processing with an fpga coprocessor board. In: Proc. 1st Int. Conf. Engineering of Reconfigurable Systems and Algorithms (2001)

    Google Scholar 

  8. Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: Proc. 5th IEEE Int. Conf. Data Mining (2005)

    Google Scholar 

  9. Karp, R.M., Shenker., S.: A simple algorithm for finding frequent elements in streams and bags. In: ACM Trans. on Database Systems (2003)

    Google Scholar 

  10. Park, J.S., Chen, M.-S., Yu, P.S.: Efficient parallel data mining for association rules. In: Proc. 4th Int. Conf.Information and Knowledge Management, pp. 31–36. ACM Press, New York (1995)

    Google Scholar 

  11. Rajamani, S., Viswanath, P.: A quantitative analysis of processor - programmable logic interface. In: IEEE Symposium on FPGAs for Custom Computing Machines, pp. 226–234 (1996)

    Google Scholar 

  12. Riedel, E., Faloutsos, C., Gibson, G.A., Nagle, D.: Active disks for large-scale data processing. IEEE Computer 34, 68–74 (2001)

    Article  Google Scholar 

  13. Teng, W.-G., Chen, M.-S., Yu, P.S.: A regression-based temporal pattern mining scheme for data streams. In: Proc. 29th Int. Conf. Very Large Data Bases (2003)

    Google Scholar 

  14. Zaki., M.J.: Parallel and distributed association mining: A survey. IEEE Concurrency 7(4), 14–25 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, WC., Liu, KH., Chen, MS. (2006). Hardware Enhanced Mining for Association Rules. In: Ng, WK., Kitsuregawa, M., Li, J., Chang, K. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2006. Lecture Notes in Computer Science(), vol 3918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731139_85

Download citation

  • DOI: https://doi.org/10.1007/11731139_85

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33206-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics