[1] Mario Boley, Claudio Lucchese, Daniel Paurat, and Thomas Gärtner. Direct
local pattern sampling by efficient two-step random procedures. In KDD
’11: Proceedings of the 17th ACM SIGKDD International Conference on
Knowledge Discovery and Data Mining, pages 582–590, August 21-24
2011.
[2] Diego Ceccarelli, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, and
Salvatore Trani. SEL: a unified algorithm for entity linking and saliency
detection. In DocEng ’16: Proceedings of the 2015 ACM Symposium on Document
Engineering, 2016.
[3] Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego,
Nicola Tonellotto, and Rossano Venturini. Quickscorer: a fast algorithm to rank
documents with additive ensembles of regression trees. In SIGIR ’15:
Proceedings of the 38th International ACM SIGIR Conference on Research and
Development in Information Retrieval, 2015. (best paper) (ACM Notable
Article).
[4] Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele
Perego, and Salvatore Trani. Selective gradient boosting for effective
learning to rank. In SIGIR ’18: Proceedings of the 41th International ACM
SIGIR Conference on Research and Development in Information Retrieval,
2018.
[5] Claudio Lucchese, Salvatore Orlando, and Raffaele Perego. Fast and memory
efficient mining of frequent closed itemsets. IEEE Transactions On Knowledge
and Data Engineering, 18(1):21–36, 2006.
[6] Claudio Lucchese, Salvatore Orlando, and Raffaele Perego. A unifying
framework for mining approximate top-k binary patterns. IEEE Transactions On
Knowledge and Data Engineering, 26(12):2900–2913, 2014.
[7] Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Fabrizio Silvestri, and
Gabriele Tolomei. Discovering tasks from search engine query logs. ACM Trans.
Inf. Syst., 31(3):14, 2013. (ACM Notable Article).
[8] Claudio Lucchese, Deepak Rayan, Michalis Vlachos, and Philip S. Yu. Rights
protection of trajectory datasets with nearest-neighbor preservation. VLDB
Journal, 19(4):531–556, 2010.
[9] Alessandro Lulli, Emanuele Carlini, Patrizio Dazzi, Claudio Lucchese, and
Laura Ricci. Fast connected components computation in large graphs by vertex
pruning. IEEE Transactions on Parallel and Distributed Systems, 28(3):760–773,
2017.