Obserwuj
Claudio Lucchese
Claudio Lucchese
Full Professor, Ca' Foscari University of Venice
Zweryfikowany adres z unive.it - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Fast and memory efficient mining of frequent closed itemsets
C Lucchese, S Orlando, R Perego
IEEE Transactions on Knowledge and Data Engineering 18 (1), 21-36, 2005
3142005
CoPhIR: a test collection for content-based image retrieval
P Bolettieri, A Esuli, F Falchi, C Lucchese, R Perego, T Piccioli, F Rabitti
Arxiv preprint arXiv:0905.4627, 2009
2082009
From chatter to headlines: harnessing the real-time web for personalized news recommendation
G De Francisci Morales, A Gionis, C Lucchese
Proceedings of the fifth ACM international conference on Web search and data …, 2012
2022012
Identifying task-based sessions in search engine query logs
C Lucchese, S Orlando, R Perego, F Silvestri, G Tolomei
Proceedings of the fourth ACM international conference on Web search and …, 2011
1882011
Building a web-scale image similarity search system
M Batko, F Falchi, C Lucchese, D Novak, R Perego, F Rabitti, ...
Multimedia Tools and Applications 47, 599-629, 2010
1412010
Document similarity self-join with mapreduce
R Baraglia, GDF Morales, C Lucchese
2010 IEEE International Conference on data mining, 731-736, 2010
1352010
On closed constrained frequent pattern mining
F Bonchi, C Lucchese
Fourth IEEE International Conference on Data Mining (ICDM'04), 35-42, 2004
1262004
Fast ranking with additive ensembles of oblivious and non-oblivious regression trees
D Dato, C Lucchese, FM Nardini, S Orlando, R Perego, N Tonellotto, ...
ACM Transactions on Information Systems (TOIS) 35 (2), 1-31, 2016
1212016
Direct local pattern sampling by efficient two-step random procedures
M Boley, C Lucchese, D Paurat, T Gärtner
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
1202011
Learning relatedness measures for entity linking
D Ceccarelli, C Lucchese, S Orlando, R Perego, S Trani
Proceedings of the 22nd ACM international conference on Information …, 2013
1192013
Extending the state-of-the-art of constraint-based pattern discovery
F Bonchi, C Lucchese
Data & Knowledge Engineering 60 (2), 377-399, 2007
1122007
Pushing tougher constraints in frequent pattern mining
F Bonchi, C Lucchese
Advances in Knowledge Discovery and Data Mining: 9th Pacific-Asia Conference …, 2005
1072005
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.
C Lucchese, S Orlando, R Perego
Fimi, 2004
1042004
Dexter: an open source framework for entity linking
D Ceccarelli, C Lucchese, S Orlando, R Perego, S Trani
Proceedings of the sixth international workshop on Exploiting semantic …, 2013
1002013
Quickscorer: A fast algorithm to rank documents with additive ensembles of regression trees
C Lucchese, FM Nardini, S Orlando, R Perego, N Tonellotto, R Venturini
Proceedings of the 38th International ACM SIGIR Conference on Research and …, 2015
972015
kDCI: A multi-strategy algorithm for mining frequent sets
C Lucchese, S Orlando, P Palmerini, R Perego, F Silvestri
Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining …, 2003
94*2003
A unifying framework for mining approximate top-k binary patterns
C Lucchese, S Orlando, R Perego
Transactions on Knowledge and Data Engineering 26 (12), 2900-2913, 2014
872014
Mining Top-K Patterns from Binary Datasets in presence of Noise
C Lucchese, S Orlando, R Perego
SDM '10: SIAM International Conference on Data Mining, 2010
832010
Post-learning optimization of tree ensembles for efficient ranking
C Lucchese, FM Nardini, S Orlando, R Perego, F Silvestri, S Trani
Proceedings of the 39th International ACM SIGIR conference on Research and …, 2016
792016
Quality versus efficiency in document scoring with learning-to-rank models
G Capannini, C Lucchese, FM Nardini, S Orlando, R Perego, N Tonellotto
Information Processing & Management 52 (6), 1161-1177, 2016
752016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20