Skip to main content

Frequent Pattern Mining Guided Tabu Search

  • Conference paper
  • First Online:
Data Science Analytics and Applications (DaSAA 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 804))

Included in the following conference series:

  • 834 Accesses

Abstract

The paper focuses on the search perspective of Data Mining. Genetic Algorithms, Tabu Search are a few of the evolutionary search strategies in the literature. As a part of this work, we relate Data mining in the context of Tabu Search to perform search for global optimum in a guided fashion. Sequence Pattern Mining (SPM) in generic and a variant of it, namely Maximal Sequence Pattern (MSP) is incorporated as a part of Tabu Search. The limitation of conventional Tabu Search is that the convergence rate is dependent on the initial population. The project proposes to arrive at an initial population employing SPM and hence result in improved convergence, in relation to conventional Tabu Search. The proposed algorithm has been tested for the N-Queens problem and empirical results indicate approximately 21% improved convergence.

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 EPUB and 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

References

  1. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, MA (1997)

    Book  MATH  Google Scholar 

  2. Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190–206 (1989)

    Article  MATH  Google Scholar 

  3. Glover, F.: Tabu search—part II. ORSA J. Comput. 2(1), 4–32 (1990)

    Article  MATH  Google Scholar 

  4. Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics, vol. 2. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-1665-5

    Book  MATH  Google Scholar 

  5. Hertz, A., de Werra, D.: The tabu search metaheuristic: how we used it. Ann. Math. Artif. Intell. 1(1), 111–121 (1990)

    Article  MATH  Google Scholar 

  6. Glover, F.: Tabu search fundamentals and uses. Graduate School of Business, University of Colorado, Boulder (1995)

    Google Scholar 

  7. Glover, F., Taillard, E.: A user’s guide to tabu search. Ann. Oper. Res. 41(1), 1–28 (1993)

    Article  MATH  Google Scholar 

  8. Crainic, T.G., Gendreau, M., Rousseau, L.-M.: Special issue on recent advances in metaheuristics. J. Heuristics 16(3), 235 (2010)

    Article  MATH  Google Scholar 

  9. Glover, F., Kelly, J.P., Laguna, M.: Genetic algorithms and tabu search: hybrids for optimization. Comput. Oper. Res. 22, 111–134 (1997)

    Article  MATH  Google Scholar 

  10. Hanafi, S.: On the convergence of tabu search. J. Heuristics 7, 47–58 (2001)

    Article  MATH  Google Scholar 

  11. Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29, 653–684 (2000)

    MathSciNet  MATH  Google Scholar 

  12. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40(10), 1276–1290 (1994)

    Article  MATH  Google Scholar 

  13. Knox, J.E.: The application of tabu search to the symmetric traveling salesman problem (1989)

    Google Scholar 

  14. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res. 91(1), 160–175 (1996)

    Article  MATH  Google Scholar 

  15. Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manage. Sci. 42(6), 797–813 (1996)

    Article  MATH  Google Scholar 

  16. de Werra, D., Hertz, A.: Tabu search techniques: a tutorial and an application to neural networks. Oper. Res. Spektrum 11(3), 131–141 (1989)

    Google Scholar 

  17. Chelouah, R., Siarry, P.: Tabu search applied to global optimization. Eur. J. Oper. Res. 123(2), 256–270 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10, 59–88 (2004)

    Article  MATH  Google Scholar 

  19. Resende, M.G.C., Werneck, R.F.: On the implementation of a swap-based local search procedure for the p-median problem. In: Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (2003)

    Google Scholar 

  20. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (1994)

    Google Scholar 

  21. Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. (2007)

    Google Scholar 

  22. Dietterich, T.G., Michalski, R.S.: Discovering patterns in sequences of events. Artif. Intell. 25, 187–232 (1985)

    Article  Google Scholar 

  23. Kang, T.H., Yoo, J.S., Kim, H.Y.: Mining frequent contiguous sequences patterns in biological sequences. IEEE (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. Oswald .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Avula, S., Oswald, C., Sivaselvan, B. (2018). Frequent Pattern Mining Guided Tabu Search. In: R, S., Sharma, M. (eds) Data Science Analytics and Applications. DaSAA 2017. Communications in Computer and Information Science, vol 804. Springer, Singapore. https://doi.org/10.1007/978-981-10-8603-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-8603-8_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-8602-1

  • Online ISBN: 978-981-10-8603-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics