Abstract
In Market Basket Analysis, the goal is to understand the human behavior in order to maximize sales. An evident behavior is to buy correlated items. As a consequence, the determination of a set of items with a large correlation with others is a valuable tool for Market Basket Analysis.
In this paper we address a combinatorial optimization problem that formalizes the previous application. Given a simple graph \(\mathcal {G}=(V,E)\) (where the nodes are items and links represent correlation), we want to find the clique \(\mathcal {C} \subseteq V\) such that the number of links shared between \(\mathcal {C}\) and \(V - \mathcal {C}\) is maximized. This problem is known in the literature as Max Cut-Clique (MCC).
The contributions of this paper are three-fold. First, the computational complexity of the MCC is established. Second, a full GRASP/VND methodology enriched with a Tabu Search is here developed, where the main ingredients are novel local searches and a Restricted Candidate List that trades greediness for randomization in a multi-start fashion. A Tabu Search is also included in order to avoid locally optimum solutions. Finally, a fair comparison with respect to recent heuristics reveals that our proposal is competitive with state-of-the-art solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
All the scripts are available at the following URL: https://www.fing.edu.uy/~lstabile/mcc-octave-source.zip.
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. SIGMOD Rec. 22(2), 207–216 (1993)
Aguinis, H., Forcum, L.E., Joo, H.: Using market basket analysis in management research. J. Manag. 39(7), 1799–1824 (2013)
Amuthan, A., Thilak, K.D.: Survey on Tabu search meta-heuristic optimization. In: 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES), pp. 1539–1543, October 2016
Bader, G.D., Hogue, C.W.V.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform. 4, 2 (2003)
Brohée, S., van Helden, J.: Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinform. 7(1), 488 (2006)
Bruinsma, G., Bernasco, W.: Criminal groups and transnational illegal markets. Crime Law Soc. Change 41(1), 79–94 (2004)
Cascio, W.F., Aguinis, H.: Research in industrial and organizational psychology from 1963 to 2007: changes, choices, and trends. J. Appl. Psychol. 93(5), 1062–1081 (2008)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 2071, pp. 151–158. ACM, New York (1971)
Duarte, A., Mladenović, N., Sánchez-Oro, J., Todosijević, R.: Variable neighborhood descent. In: Martí, R., Panos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 1–27. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-07153-4_9-1
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)
Henzinger, M., Lawrence, S.: Extracting knowledge from the world wide web. Proc. Natl. Acad. Sci. 101(Suppl. 1), 5186–5191 (2004)
Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Enumerating isolated cliques in synthetic and financial networks. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 405–416. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85097-7_38
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)
Martins, P.: Cliques with maximum/minimum edge neighborhood and neighborhood density. Comput. Oper. Res. 39, 594–608 (2012)
Martins, P., Ladrón, A., Ramalhinho, H.: Maximum cut-clique problem: ILS heuristics and a data analysis application. Int. Trans. Oper. Res. 22(5), 775–809 (2014)
Resende, M.G.C., Ribeiro, C.C.: Optimization by GRASP - Greedy Randomized Adaptive Search Procedures. Computational Science and Engineering. Springer, New York (2016). https://doi.org/10.1007/978-1-4939-6530-4
Salhi, S.: Handbook of metaheuristics. J. Oper. Res. Soc. 65(2), 320–320 (2014)
Tan, P.-N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley Longman Publishing Co. Inc., Boston (2005)
Acknowledgements
This work is partially supported by Project 395 CSIC I+D Sistemas Binarios Estocásticos Dinámicos. We would like to thank the reviewers for their insightful comments that simplified the readability of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Bourel, M., Canale, E., Robledo, F., Romero, P., Stábile, L. (2019). A GRASP/VND Heuristic for the Max Cut-Clique Problem. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R., Sciacca, V. (eds) Machine Learning, Optimization, and Data Science. LOD 2018. Lecture Notes in Computer Science(), vol 11331. Springer, Cham. https://doi.org/10.1007/978-3-030-13709-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-13709-0_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-13708-3
Online ISBN: 978-3-030-13709-0
eBook Packages: Computer ScienceComputer Science (R0)