Luís Cavique

e-mail: LCavique[at]univ-ab.pt

Universidade Aberta, Tagus Park



He is Professor of the Computer Science Section (SIFT) in the Department of Sciences and Technology (DCeT) at Universidade Aberta and Research member in LabMAg

He worked in the Polytechnic Education System from 1991 to 2008, namely as Adjunct Professor in the Setubal and in the Lisbon Polytechnic Institute  http://www.net.ipl.pt/ 

He received the degree in Computer Science Engineering from the New University of Lisbon (FCT-UNL) in 1988, the MSc degree in Operational Research and Systems Engineering from the Technical Lisbon University (IST-UTL) in 1994 and the PhD degree in Systems Engineering from the Technical Lisbon University (IST-UTL) in 2002.

His research areas are in the intersection of Computer Science and Systems Engineering, namely the Heuristic Optimization and the Data Mining.


Recent Papers

A B Mendes, M. Funk, L. Cavique (2010) “Knowledge Discovery in the Virtual Social Network Due to Common Knowledge of Proverbs”,  regular research paper in proceedings of DMIN'10, the 6th International Conference on Data Mining, Las Vegas, USA.

L Cavique, A.B. Mendes e J.M.A. Santos (2009), “An Algorithm to Discover the k-Clique Cover in Networks”, in Progress in Artificial Intelligence, L. Seabra Lopes et al. (Eds.): EPIA 2009, LNAI 5816, Springer-Verlag Berlin Heidelberg, pp. 363–373. (PDF)

L Cavique, C Luz (2009), “A Heuristic for the Stability Number of a Graph based on Convex Quadratic Programming and Tabu Search”, special issue of the Journal of Mathematical Sciences – Aveiro Seminar on Control Optimization and Graph Theory – Second Series.  (PDF)

L Cavique, J Coelho (2008), “Sequential Pattern Discovery Using Oriented Trees”, Revista de Ciências da Computação, Volume III, Ano III, nº3 (PDF)

L Cavique (2007), “Network Algorithm to Discover Sequential Patterns”, in Progress in Artificial Intelligence, J.Neves, M.Santos and J.Machado (Eds.), EPIA 2007, LNAI 4874, Springer-Verlag Berlin Heidelberg, (PDF)

L Cavique (2007), “A Scalable Algorithm for the Market Basket Analysis”, Journal of Retailing and Consumer Services, Special Issue on Data Mining in Retailing and Consumer Services. (PDF)

M Gomes, L Cavique, I Themido (2006) “The Crew Time Tabling Problem: an extension of the Crew Scheduling Problem”, Annals of Operations Research, volume “Optimisation in transportation”.(PDF)

L Cavique, “Next-Item Discovery in the Market Basket Analysis”, in Proc. 2005 Portuguese Conference on Artificial Intelligence, Carlos Bento, Amílcar Cardoso e Gaël Dias (Eds), IEEE, pp.198-199, (Covilhã 2005).

L Cavique (2004), “Graph-based Structures for the Market Basket Analysis”, Revista de Investigação Operacional,  vol.24, pp. 1-14. (PDF)

L Cavique (2003), “Client Micro-Segmentation based on Consume Data: RM-Similis Model” (in Portuguese), Revista Portuguesa e Brasileira de Gestão, volume 2, nº3, pp. 72-77. (PDF)

L Cavique, C Rego e I Themido (2002), “A Scatter Search Algorithm for the Maximum Clique Problem”, in Essays and Surveys in Metaheuristics, C. Ribeiro e P. Hansen (Eds), Kluwer Academic Publishers, pp.227-244. (PDF)

L Cavique, C Rego e I Themido (2002), “Neighborhood Structures and Local Search for the Maximum Clique Problem” (in Portuguese) , Revista de Investigação Operacional, vol.22, pp. 1-18. (PDF)


L Cavique, editor, REVISTA DE CIÊNCIAS DA COMPUTAÇÃO http://www.moodle.univ-ab.pt/moodle/course/view.php?id=31


Página alojada em http://homepages.sapo.pt/   em setembro 2011