Claudio Lucchese

Orcid: 0000-0002-2545-0425

Affiliations:
  • National Research Council, Italy


According to our database1, Claudio Lucchese authored at least 147 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Verifiable Boosted Tree Ensembles.
CoRR, 2024

2023
Certifying machine learning models against evasion attacks by program analysis.
J. Comput. Secur., 2023

Efficient and Effective Tree-based and Neural Learning to Rank.
Found. Trends Inf. Retr., 2023

Fast Inference of Tree Ensembles on ARM Devices.
CoRR, 2023

Early Exit Strategies for Learning-to-Rank Cascades.
IEEE Access, 2023

Preface WI-IAT 2023.
Proceedings of the IEEE International Conference on Web Intelligence and Intelligent Agent Technology, 2023

On the Effect of Low-Ranked Documents: A New Sampling Function for Selective Gradient Boosting.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

Does LambdaMART Do What You Expect?
Proceedings of the 13th Italian Information Retrieval Workshop (IIR 2023), 2023

GAM Forest Explanation.
Proceedings of the Proceedings 26th International Conference on Extending Database Technology, 2023

LambdaRank Gradients are Incoherent.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Can Embeddings Analysis Explain Large Language Model Ranking?
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

A Theoretical Framework for AI Models Explainability with Application in Biomedicine.
Proceedings of the IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, 2023

2022
Report on the 1st Workshop on Reaching Efficiency in Neural Information Retrieval (ReNeuIR 2022) at SIGIR 2022.
SIGIR Forum, December, 2022

A Theoretical Framework for AI Models Explainability.
CoRR, 2022

Explainable Global Fairness Verification of Tree-Based Classifiers.
CoRR, 2022

Beyond robustness: Resilience verification of tree-based classifiers.
Comput. Secur., 2022

ILMART: Interpretable Ranking with Constrained LambdaMART.
Proceedings of the SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain, July 11, 2022

ReNeuIR: Reaching Efficiency in Neural Information Retrieval.
Proceedings of the SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, Madrid, Spain, July 11, 2022

A comparison of spatio-temporal prediction methods: a parking availability case study.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

EiFFFeL: enforcing fairness in forests by flipping leaves.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

SOUR an Outliers Detection Algorithm in Learning to Rank (Abstract).
Proceedings of the 12th Italian Information Retrieval Workshop 2022, 2022

Interpretable Ranking Using LambdaMART (Abstract).
Proceedings of the 12th Italian Information Retrieval Workshop 2022, 2022

Filtering out Outliers in Learning to Rank.
Proceedings of the ICTIR '22: The 2022 ACM SIGIR International Conference on the Theory of Information Retrieval, Madrid, Spain, July 11, 2022

2021
Feature partitioning for robust tree ensembles and their certification in adversarial scenarios.
EURASIP J. Inf. Secur., 2021

Learning Early Exit Strategies for Additive Ranking Ensembles.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

AMEBA: An Adaptive Approach to the Black-Box Evasion of Machine Learning Models.
Proceedings of the ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, 2021

2020
RankEval: Evaluation and investigation of ranking models.
SoftwareX, 2020

Boosting learning to rank with user dynamics and continuation methods.
Inf. Retr. J., 2020

Treant: training evasion-aware decision trees.
Data Min. Knowl. Discov., 2020

Query-level Early Exit for Additive Learning-to-Rank Ensembles.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

Improving Learning to Rank By Leveraging User Dynamics and Continuation Methods.
Proceedings of the 28th Italian Symposium on Advanced Database Systems, 2020

Certifying Decision Trees Against Evasion Attacks by Program Analysis.
Proceedings of the Computer Security - ESORICS 2020, 2020

2019
Parallel Traversal of Large Ensembles of Decision Trees.
IEEE Trans. Parallel Distributed Syst., 2019

Learning to Rank in Theory and Practice: From Gradient Boosting to Neural Networks and Unbiased Learning.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

Adversarial Training of Gradient-Boosted Decision Trees.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Social-Spatiotemporal Analysis of Topical and Polarized Communities in Online Social Networks.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

X-CLEaVER: Learning Ranking Ensembles by Growing and Pruning Trees.
ACM Trans. Intell. Syst. Technol., 2018

Computing Entity Semantic Similarity by Features Ranking.
CoRR, 2018

SEL: A unified algorithm for salient entity linking.
Comput. Intell., 2018

Do Violent People Smile: Social Media Analysis of their Profile Pictures.
Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

Selective Gradient Boosting for Effective Learning to Rank.
Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, 2018

Efficient and Effective Query Expansion for Web Search.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

Continuation Methods and Curriculum Learning for Learning to Rank.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

2017
Fast Connected Components Computation in Large Graphs by Vertex Pruning.
IEEE Trans. Parallel Distributed Syst., 2017

Adult content consumption in online social networks.
Soc. Netw. Anal. Min., 2017

Report on LEARNER 2017: 1st International Workshop on LEARning Next gEneration Rankers.
SIGIR Forum, 2017

Automatic controversy detection in social media: A content-independent motif-based approach.
Online Soc. Networks Media, 2017

Perception of social phenomena through the multidimensional analysis of online social networks.
Online Soc. Networks Media, 2017

X-DART: Blending Dropout and Pruning for Efficient Learning to Rank.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

RankEval: An Evaluation and Analysis Framework for Learning-to-Rank Solutions.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

On Including the User Dynamic in Learning to Rank.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

SELEcTor: Discovering Similar Entities on LinkEd DaTa by Ranking Their Features.
Proceedings of the 11th IEEE International Conference on Semantic Computing, 2017

QuickScorer: Efficient Traversal of Large Ensembles of Decision Trees.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

Multicore/Manycore Parallel Traversal of Large Forests of Regression Trees.
Proceedings of the 2017 International Conference on High Performance Computing & Simulation, 2017

A Motif-Based Approach for Identifying Controversy.
Proceedings of the Eleventh International Conference on Web and Social Media, 2017

The Impact of Negative Samples on Learning to Rank.
Proceedings of the 1st International Workshop on LEARning Next gEneration Rankers co-located with the 3rd ACM International Conference on the Theory of Information Retrieval (ICTIR 2017), 2017

Efficiency/Effectiveness Trade-offs in Learning to Rank.
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017

LEARning Next gEneration Rankers (LEARNER 2017).
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017

Sentiment Spreading: An Epidemic Model for Lexicon-Based Sentiment Analysis on Twitter.
Proceedings of the AI*IA 2017 Advances in Artificial Intelligence, 2017

2016
Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees.
ACM Trans. Inf. Syst., 2016

Quality versus efficiency in document scoring with learning-to-rank models.
Inf. Process. Manag., 2016

Fast Traversal of Large Ensembles of Regression Trees.
ERCIM News, 2016

Pornography consumption in Social Media.
CoRR, 2016

Exploiting CPU SIMD Extensions to Speed-up Document Scoring with Tree Ensembles.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Post-Learning Optimization of Tree Ensembles for Efficient Ranking.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Polarized User and Topic Tracking in Twitter.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Ranking Documents Effciently with QuickScorer.
Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

Speeding-up Document Scoring with Tree Ensembles using CPU SIMD Extensions.
Proceedings of the 7th Italian Information Retrieval Workshop, 2016

Post-Learning Optimization of Tree Ensembles.
Proceedings of the 7th Italian Information Retrieval Workshop, 2016

GPU-based Parallelization of QuickScorer to Speed-up Document Ranking with Tree Ensembles.
Proceedings of the 7th Italian Information Retrieval Workshop, 2016

On the Behaviour of Deviant Communities in Online Social Networks.
Proceedings of the Tenth International Conference on Web and Social Media, 2016

Learning to Rank User Queries to Detect Search Tasks.
Proceedings of the 2016 ACM on International Conference on the Theory of Information Retrieval, 2016

Fast Feature Selection for Learning to Rank.
Proceedings of the 2016 ACM on International Conference on the Theory of Information Retrieval, 2016

Summarizing Linked Data RDF Graphs Using Approximate Graph Pattern Mining.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

SEL: A Unified Algorithm for Entity Linking and Saliency Detection.
Proceedings of the 2016 ACM Symposium on Document Engineering, 2016

Evaluating Top-K Approximate Patterns via Text Clustering.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2016

Sentiment-enhanced multidimensional analysis of online social networks: Perception of the mediterranean refugees crisis.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

Speeding up Document Ranking with Rank-based Features.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

RDF Graph Summarization Based on Approximate Patterns.
Proceedings of the Information Search, Integration, and Personalization, 2015

Cracker: Crumbling large graphs into connected components.
Proceedings of the 2015 IEEE Symposium on Computers and Communication, 2015

Electoral Predictions with Twitter: A Machine-Learning approach.
Proceedings of the 6th Italian Information Retrieval Workshop, 2015

QuickRank: a C++ Suite of Learning to Rank Algorithms.
Proceedings of the 6th Italian Information Retrieval Workshop, 2015

Supervised Evaluation of Top-k Itemset Mining Algorithms.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2015

2014
Right-Protected Data Publishing with Provable Distance-Based Mining.
IEEE Trans. Knowl. Data Eng., 2014

A Unifying Framework for Mining Approximate Top- \(k\) Binary Patterns.
IEEE Trans. Knowl. Data Eng., 2014

Dexter 2.0 - an Open Source Tool for Semantically Enriching Data.
Proceedings of the ISWC 2014 Posters & Demonstrations Track a track within the 13th International Semantic Web Conference, 2014

Manual Annotation of Semi-Structured Documents for Entity-Linking.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Recommender Systems.
Proceedings of the Mining User Generated Content., 2014

2013
Discovering tasks from search engine query logs.
ACM Trans. Inf. Syst., 2013

InGeoCloudS: A Cloud-Based Platform for Sharing Geodata Across Europe.
ERCIM News, 2013

When entities meet query recommender systems: semantic search shortcuts.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Modeling and predicting the task-by-task behavior of search engine users.
Proceedings of the Open research Areas in Information Retrieval, 2013

On Suggesting Entities as Web Search Queries.
Proceedings of the 4th Italian Information Retrieval Workshop, 2013

Twitter anticipates bursts of requests for Wikipedia articles.
Proceedings of the 2013 Workshop on Data-Driven User Behavioral Modelling and Mining from Social Media, 2013

Dexter: an open source framework for entity linking.
Proceedings of the ESAIR'13, 2013

Learning relatedness measures for entity linking.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Similarity caching in large-scale image retrieval.
Inf. Process. Manag., 2012

From chatter to headlines: harnessing the real-time web for personalized news recommendation.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

How Random Walks Can Help Tourism.
Proceedings of the Advances in Information Retrieval, 2012

You should read this! let me explain you why: explaining news recommendations to users.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Discovering Europeana Users' Search Behavior.
ERCIM News, 2011

Identifying task-based sessions in search engine query logs.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Direct Pattern Sampling with Respect to Pattern Frequency.
Proceedings of the Report of the symposium "Lernen, 2011

Direct local pattern sampling by efficient two-step random procedures.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Improving Europeana Search Experience Using Query Logs.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2011

Caching query-biased snippets for efficient retrieval.
Proceedings of the EDBT 2011, 2011

LSDS-IR'11: the 9th workshop on large-scale and distributed systems for information retrieval.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
High performance: closed frequent itemsets mining inspired by emerging computer architectures.
PhD thesis, 2010

Rights protection of trajectory datasets with nearest-neighbor preservation.
VLDB J., 2010

The 8th workshop on large-scale distributed systems for information retrieval (LSDS-IR'10).
SIGIR Forum, 2010

Building a web-scale image similarity search system.
Multim. Tools Appl., 2010

<i>Mining@home</i>: toward a public-resource computing framework for distributed data mining.
Concurr. Comput. Pract. Exp., 2010

Scaling Out All Pairs Similarity Search with MapReduce.
Proceedings of the 8th Workshop on Large-Scale Distributed Systems for Information Retrieval, 2010

Mining Top-K Patterns from Binary Datasets in Presence of Noise.
Proceedings of the SIAM International Conference on Data Mining, 2010

A generative pattern model for mining binary datasets.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Document Similarity Self-Join with MapReduce.
Proceedings of the ICDM 2010, 2010

Detecting Task-Based Query Sessions Using Collaborative Knowledge.
Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology - Workshops, Toronto, Canada, August 31, 2010

2009
7th workshop on large-scale distributed systems for information retrieval (LSDS-IR'09).
SIGIR Forum, 2009

Embedding and Retrieving Private Metadata in Electrocardiograms.
J. Medical Syst., 2009

A constraint-based querying system for exploratory pattern discovery.
Inf. Syst., 2009

CoPhIR: a Test Collection for Content-Based Image Retrieval
CoRR, 2009

Caching Algorithms for Similarity Search.
Proceedings of the Seventeenth Italian Symposium on Advanced Database Systems, 2009

Searching 100M Images by Content Similarity.
Proceedings of the Post-proceedings of the Fifth Italian Research Conference on Digital Libraries, 2009

Caching content-based queries for robust and efficient image retrieval.
Proceedings of the EDBT 2009, 2009

2008
Crawling, Indexing, and Similarity Searching Images on the Web.
Proceedings of the Sixteenth Italian Symposium on Advanced Database Systems, 2008

Special track on Engineering Large-Scale Distributed Systems: editorial message.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

(Query) History Teaches Everything, Including the Future.
Proceedings of the Latin American Web Conference, 2008

Rights Protection of Trajectory Datasets.
Proceedings of the 24th International Conference on Data Engineering, 2008

Ownership protection of shape datasets with geodesic distance preservation.
Proceedings of the EDBT 2008, 2008

A metric cache for similarity search.
Proceedings of the Proceeding of the 2008 ACM Workshop on Large-Scale Distributed Systems for Information Retrieval, 2008

2007
Extending the state-of-the-art of constraint-based pattern discovery.
Data Knowl. Eng., 2007

Mining query logs to optimize index partitioning in parallel web search engines.
Proceedings of the 2nf International Conference on Scalable Information Systems, 2007

Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures.
Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007

2006
Fast and Memory Efficient Mining of Frequent Closed Itemsets.
IEEE Trans. Knowl. Data Eng., 2006

On condensed representations of constrained frequent patterns.
Knowl. Inf. Syst., 2006

Mining frequent closed itemsets out-of-core.
Proceedings of the Sixth SIAM International Conference on Data Mining, 2006

A privacy preserving web recommender system.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

On Interactive Pattern Mining from Relational Databases.
Proceedings of the Knowledge Discovery in Inductive Databases, 5th International Workshop, 2006

ConQueSt: a Constraint-based Querying System for Exploratory Pattern Discovery.
Proceedings of the 22nd International Conference on Data Engineering, 2006

2005
Pushing Tougher Constraints in Frequent Pattern Mining.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

Mining Frequent Closed Itemsets from Distributed Repositories.
Proceedings of the First Workshop on Knowledge and Data Management in GRIDs, 2005

2004
On Closed Constrained Frequent Pattern Mining.
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004

WebDocs: a real-life huge transactional dataset.
Proceedings of the FIMI '04, 2004

kDCI: on using direct count up to the third iteration.
Proceedings of the FIMI '04, 2004

DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.
Proceedings of the FIMI '04, 2004

2003
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets.
Proceedings of the FIMI '03, 2003


  Loading...