Claudio Lucchese

Dr. Claudio Lucchese


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 December 2005 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CLClaudio Lucchese
Claudio Lucchese
SOS. Orlando
S. Orlando
RPR. Perego
R. Perego
This paper presents a new scalable algorithm for discovering closed frequent itemsets, a lossless and condensed representation of all the frequent itemsets that can be mined from a transactional database. Our algorithm exploits a divide-and-conquer approach and a bitwise vertical representation of the database and adopts a particular visit and partitioning strategy of the search space based on an original theoretical framework, which formalizes the problem of closed itemsets mining in detail. The algorithm adopts several optimizations aimed to save both space and time in computing itemset closures and their supports. In particular, since one of the main problems in this type of algorithms is the multiple generation of the same closed itemset, we propose a new effective and memory-efficient pruning technique, which, unlike other previous proposals, does not require the whole set of closed patterns mined so far to be kept in the main memory. This technique also permits each visited partition of the search space to be mined independently in any order and, thus, also in parallel. The tests conducted on many publicly available data sets show that our algorithm is scalable and outperforms other state-of-the-art algorithms like CLOSET+ and FP-CLOSE, in some cases by more than one order of magnitude. More importantly, the performance improvements become more and more significant as the support threshold is decreased.

8 February 2012
Verified
Conference Paper
Open access
PDF file
GMGianmarco De Francisci Morales
Gianmarco De Francisci Morales
AGAristides Gionis
Aristides Gionis
CLClaudio Lucchese
Claudio Lucchese
We propose a new methodology for recommending interesting news to users by exploiting the information in their twitter persona. We model relevance between users and news articles using a mix of signals drawn from the news stream and from twitter: the profile of the social neighborhood of the users, the content of their own tweet stream, and topic popularity in the news and in the whole twitter-land. We validate our approach on a real-world dataset of approximately 40k articles coming from Yahoo! News and one month of crawled twitter data. We train our model using a learning-to-rank approach and support-vector machines. The train and test set are drawn from Yahoo! toolbar log data. We heuristically identify 3 214 users of twitter in the log and use their clicks on news articles to train our system. Our methodology is able to predict with good accuracy the news articles clicked by the users and rank them higher than other news articles. The results show that the combination of various signals from real-time web and microblogging platforms can be a useful resource to understand user behavior. Copyright 2012 ACM

9 February 2011
Verified
Conference Paper
Open access
PDF file
CLClaudio Lucchese
Claudio Lucchese
SOSalvatore Orlando
Salvatore Orlando
RPRaffaele Perego
Raffaele Perego
FSFabrizio Silvestri
Fabrizio Silvestri
GTGabriele Tolomei
Gabriele Tolomei
The research challenge addressed in this paper is to devise effective techniques for identifying task-based sessions, i.e. sets of possibly non contiguous queries issued by the user of a Web Search Engine for carrying out a given task. In order to evaluate and compare different approaches, we built, by means of a manual labeling process, a ground-truth where the queries of a given query log have been grouped in tasks. Our analysis of this ground-truth shows that users tend to perform more than one task at the same time, since about 75% of the submitted queries involve a multi-tasking activity. We formally define the Task-based Session Discovery Problem (TSDP) as the problem of best approximating the manually annotated tasks, and we propose several variants of well known clustering algorithms, as well as a novel efficient heuristic algorithm, specifically tuned for solving the TSDP. These algorithms also exploit the collaborative knowledge collected by Wiktionary and Wikipedia for detecting query pairs that are not similar from a lexical content point of view, but actually semantically related. The proposed algorithms have been evaluated on the above ground-truth, and are shown to perform better than state-of-the-art approaches, because they effectively take into account the multi-tasking behavior of users.La sfida di ricerca affrontata in questo lavoro ? quella di fornire tecniche efficaci per la scoperta di sessioni di ricerca "task-based", ovvero di insiemi di queries, eventualmente non contigue, sottomesse dagli utenti di un Web Search Engine al fine di eseguire una certa attivit? (task). Per poter valutare e confrontare approcci diversi, abbiamo costruito, attraverso un processo di annotazione manuale, una ground-truth in cui sono state raggruppate in tasks le queries di uno specifico query log. L\u27analisi di questa ground-truth ha mostrato che gli utenti hanno la tendenza ad eseguire pi? di un task "contemporaneamente", dato che circa il 75% delle queries fanno parte di sessioni di ricerca multi-tasking. Abbiamo definito formalmente Task-based Session Discovery Problem (TSDP) la cui soluzione consiste nel trovare la strategia di partizionamento che approssima in modo migliore i tasks identificati manualmente nella ground-truth. A questo proposito, abbiamo analizzato alcune varianti di noti algoritmi di clustering, cos? come un\u27innovativa euristica specificamente proposta per risolvere il TSDP. Inotre, questi algoritmi sfruttano la conoscenza collaborativa resa disponibile da Wiktionary e Wikipedia al fine di accomunare coppie di queries dissimili dal punto di vista del contenuto lessicale, ma "semanticamente" correlate. Gli algoritmi proposti sono stati valutati sulla base della ground-truth, mostrando comportamenti spesso migliori degli approcci disponibili allo stato dell\u27arte, poich? effettivamente in grado di gestire il comportamento multi-tasking degli utenti

7 August 2009 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
MBMichal Batko
Michal Batko
Fabrizio FalchiFabrizio Falchi
Fabrizio Falchi
CLClaudio Lucchese
Claudio Lucchese
DNDavid Novak
David Novak
RPRaffaele Perego
Raffaele Perego
PZPavel Zezula
Pavel Zezula

21 August 2011
Verified
Conference Paper
Open access
PDF file
MBMario Boley
Mario Boley
CLClaudio Lucchese
Claudio Lucchese
DPDaniel Paurat
Daniel Paurat
TGThomas Gärtner
Thomas Gärtner
We present several exact and highly scalable local pattern sampling algorithms. They can be used as an alternative to exhaustive local pattern discovery methods (e.g, frequent set mining or optimistic-estimator-based subgroup discovery) and can substantially improve eficiency as well as controllability of pattern discovery processes. While previous sampling approaches mainly rely on the Markov chain Monte Carlo method, our procedures are direct, i.e., non processsimulating, sampling algorithms. The advantages of these direct methods are an almost optimal time complexity per pattern as well as an exactly controlled distribution of the produced patterns. Namely, the proposed algorithms can sample (item-)sets according to frequency, area, squared frequency, and a class discriminativity measure. Experiments demonstrate that these procedures can improve the accuracy of pattern-based models similar to frequent sets and often also lead to substantial gains in terms of scalability

1 December 2010
Verified
Conference Paper
Closed access
RBRanieri Baraglia
Ranieri Baraglia
GMGianmarco De Francisci Morales
Gianmarco De Francisci Morales
CLClaudio Lucchese
Claudio Lucchese
Given a collection of objects, the Similarity Self-Join problem requires to discover all those pairs of objects whose similarity is above a user defined threshold. In this paper we focus on document collections, which are characterized by a sparseness that allows effective pruning strategies. Our contribution is a new parallel algorithm within the MapReduce framework. This work borrows from the state of the art in serial algorithms for similarity join and MapReduce-based techniques for set-similarity join. The proposed algorithm shows that it is possible to leverage a distributed file system to support communication patterns that do not naturally fit the MapReduce framework. Scalability is achieved by introducing a partitioning strategy able to overcome memory bottlenecks. Experimental evidence on real world data shows that our algorithm outperforms the state of the art by a factor 4.5.