Skip to main content

On Genetic Algorithms for Detecting Frequent Item Sets And Large Bite Sets

  • Conference paper
  • First Online:
  • 3020 Accesses

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

Abstract

This paper introduces the use of genetic algorithms to mine binary datasets for obtaining frequent item sets and large bite item sets, two classes of problems that are important for optimal exposure of item sets to customers and for efficient advertising campaigns. Whereas both problems can be approached in a common framework, we highlight specific features of the fitness functions suitable for each of the problems.

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. Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.): EMO 2001. LNCS, vol. 1993. Springer, Heidelberg (2001)

    Google Scholar 

  2. Adamo, J.M.: Data Mining for Association Rules and Sequential Patterns: Sequential and Parallel Algorithms. Springer, New York (2001)

    Book  MATH  Google Scholar 

  3. Agarwal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference of Management of Data, pp. 207–216. ACM (1993)

    Google Scholar 

  4. Back, T., Hammel, U., Schwefel, H.P.: Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation 1(1), 3–17 (1997)

    Article  Google Scholar 

  5. Vanderbilt University Department of Biostatistics: Right heart catheterization dataset (2004). http://biostat.mc.vanderbilt.edu/wiki/Main/DataSets/rhc.html

  6. Birkhoff, G.: Lattice Theory. American Mathematical Society, New York (1948)

    MATH  Google Scholar 

  7. Blumel, A.L., Hughes, E.J., White, B.A.: Multi-objective Evolutionary design of fuzzy autopilot controller. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 668–680. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Coello Coello, C.A.: A Short tutorial on evolutionary multiobjective optimization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 21–40. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. De Jong, K.A.: Evolutionary Computation. A Unified Approach. MIT Press and A Bradford Book, Cambridge (2006)

    MATH  Google Scholar 

  10. Devore, J.: Probability and Statistics. Brooks Cole-Thomson Learning, Belton, CA (2004)

    Google Scholar 

  11. Erickson, M., Mayer, A., Horn, J.: The niched pareto genetic algorithm 2 applied to the design of groundwater remediation systems. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 681–695. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Fonseca, C.M., Fleming, P.J.: An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation 3(1), 1–16 (1995)

    Article  Google Scholar 

  13. Ghosh, S., Biswas, S., Sarkar, D., Sarkar, P.P.: Mining frequent itemsets using genetic algorithms. International Journal of Artificial Intelligence and Applications 1(4) (October 2010)

    Google Scholar 

  14. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  15. Jin, Y., Okabe, T., Sendhoff, B.: Adapting weighted aggregation for multiobjective evolution strategies. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 96–110. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Prakash, V., Govardhan, D., Sarma, S.: Mining frequent itemsets from large data sets using genetic algorithms. International Journal of Computer Application Special Issue on “Artificial Intellegence Techniques - Novel Approaches and Practical Applications” (2011)

    Google Scholar 

  17. Schildt, H.: Java: The Complete Reference, 9th edn. McGraw-Hill Education, New York (2014)

    Google Scholar 

  18. Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Pearson Education, Boston (2006)

    Google Scholar 

  19. Thompson, M.: Application of multi objective evolutionary algorithms to analogue filter tuning. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 546–559. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dan A. Simovici .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Sizov, R.A., Simovici, D.A. (2016). On Genetic Algorithms for Detecting Frequent Item Sets And Large Bite Sets. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2016. Lecture Notes in Computer Science(), vol 9729. Springer, Cham. https://doi.org/10.1007/978-3-319-41920-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41920-6_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-41919-0

  • Online ISBN: 978-3-319-41920-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics