Skip to main content

Constructing Parallel Association Algorithms from Function Blocks

  • Conference paper
  • First Online:
Advances in Data Mining: Applications and Theoretical Aspects (ICDM 2015)

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

Included in the following conference series:

  • 1381 Accesses

Abstract

The article describes the method of construction of association rules retrieval algorithms out from function blocks having a unified interface and purely functional properties. The usage of function blocks to build association rules algorithms allows modifying the existing algorithms and building new algorithms with minimum effort. Besides, the function block properties allow to transform the algorithms into parallel form, thus improving their efficiency.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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

Similar content being viewed by others

Notes

  1. 1.

    Alternative part (else) is optional.

References

  1. Zaki, M.J., Ho, C.-T.: Large-Scale Parallel Data Mining, pp. 1–23. Springer, Heidelberg (2000)

    Google Scholar 

  2. Paul, S.: Parallel and Distributed Data Mining, New Fundamental Technologies in Data Mining, Funatsu, K. (ed.), pp. 43–54 (2011)

    Google Scholar 

  3. Mueller, A.: Fast sequential and parallel algorithms for association rule mining: a comparison. Technical report CS-TR-3515, University of Maryland, College Park (1995)

    Google Scholar 

  4. Park, J.S., Chen, M., Yu, P.S.: Efficient parallel data mining for association rules. In: ACM International Conference Information and Knowledge Management (1995)

    Google Scholar 

  5. Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8, 962–969 (1996)

    Article  Google Scholar 

  6. Cheung, D., Han, J., Ng, V., Fu, A., Fu, Y.: A fast distributed algorithm for mining association rules. In: 4th International Conference on Parallel and Distributed Information Systems (1996)

    Google Scholar 

  7. Shintani, T., Kitsuregawa, M.: Hash based parallel algorithms for mining association rules. In: 4th International Conference on Parallel and Distributed Information Systems (1996)

    Google Scholar 

  8. Zaki, M.J., Ogihara, M., Parthasarathy, S., Li, W.: Parallel data mining for association rules on shared–memory multi-processors. In: Supercomputing 1996 (1996)

    Google Scholar 

  9. Han, E.H., Karypis, G., Kumar, V.: Scalable parallel data mining for association rules. In: ACM SIGMOD Conference on Management of Data (1997)

    Google Scholar 

  10. Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: Parallel algorithms for fast discovery of association rules. Data Min. Knowl. Discov. Int. J. 1(4), 343–373 (1997)

    Article  Google Scholar 

  11. Church, A., Rosser, J.B.: Some properties of conversion. Trans. AMS 39, 472–482 (1936)

    Article  MathSciNet  Google Scholar 

  12. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, of Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1981)

    Google Scholar 

  13. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference Santiago, Chile, pp. 487–499 (1994)

    Google Scholar 

  14. PMML Specification: Data Mining Group. http://www.dmg.org/PMML-4_0

  15. Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: 21st VLDB Conference (1995)

    Google Scholar 

  16. Barsegian, A., Kupriyanov, M., Kholod, I., Thess, M.: Analysis of Data and Processes: From Standard to Realtime Data Mining, p. 300. Re Di Roma-Verlag (2014)

    Google Scholar 

  17. Kholod, I.: Framework for multi threads execution of data mining algorithms. In: 2015 IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference, pp. 74-80. February 2–4 (2015)

    Google Scholar 

Download references

Acknowledgments

The work has been performed in Saint Petersburg Electrotechnical University “LETI” within the scope of the contract Board of Education of Russia and science of the Russian Federation under the contract № 02.G25.31.0058 from 12.02.2013. This paper is also supported by the federal project ”Organization of scientific research” of the main part of the state plan of the Board of Education of Russia and project part of the state plan of the Board of Education of Russia (task # 2.136.2014/K).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ivan Kholod .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kholod, I., Kuprianov, M., Shorov, A. (2015). Constructing Parallel Association Algorithms from Function Blocks. In: Perner, P. (eds) Advances in Data Mining: Applications and Theoretical Aspects. ICDM 2015. Lecture Notes in Computer Science(), vol 9165. Springer, Cham. https://doi.org/10.1007/978-3-319-20910-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20910-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20909-8

  • Online ISBN: 978-3-319-20910-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics