Luca Venturini

Luca Venturini

Auto-generated profile, based on publicly available information

Luca Venturini

Department of Control and Computer Engineering Politecnico di Torino Corso Duca degli Abruzzi 24 Torino Italy

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 September 2017 in Big Data Research
Verified
Journal Article
Open access
Daniele ApilettiDaniele Apiletti
Daniele Apiletti
EBElena Baralis
Elena Baralis
TCTania Cerquitelli
Tania Cerquitelli
Paolo GarzaPaolo Garza
Paolo Garza
FPFabio Pulvirenti
Fabio Pulvirenti
LVLuca Venturini
Luca Venturini
Itemset mining is a well-known exploratory data mining technique used to discover interesting correlations hidden in a data collection. Since it supports different targeted analyses, it is profitably exploited in a wide range of different domains, ranging from network traffic data to medical records. With the increasing amount of generated data, different scalable algorithms have been developed, exploiting the advantages of distributed computing frameworks, such as Apache Hadoop and Spark. This paper reviews Hadoop- and Spark-based scalable algorithms addressing the frequent itemset mining problem in the Big Data domain through both theoretical and experimental comparative analyses. Since the itemset mining task is computationally expensive, its distribution and parallelization strategies heavily affect memory usage, load balancing, and communication costs. A detailed discussion of the algorithmic choices of the distributed methods for frequent itemset mining is followed by an experimental analysis comparing the performance of state-of-the-art distributed implementations on both synthetic and real datasets. The strengths and weaknesses of the algorithms are thoroughly discussed with respect to the dataset features (e.g., data distribution, average transaction length, number of records), and specific parameter settings. Finally, based on theoretical and experimental analyses, open research directions for the parallelization of the itemset mining problem are presented

2 August 2016 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
Daniele ApilettiDaniele Apiletti
Daniele Apiletti
EBElena Baralis
Elena Baralis
TCTania Cerquitelli
Tania Cerquitelli
Paolo GarzaPaolo Garza
Paolo Garza
DANILO GIORDANODANILO GIORDANO
DANILO GIORDANO
LVLuca Venturini
Luca Venturini
Understanding the behavior of a network from a large scale traffic dataset is a challenging problem. Big data frameworks offer scalable algorithms to extract information from raw data, but often require a sophisticated fine-tuning and a detailed knowledge of machine learning algorithms. To streamline this process, we propose self-learning insightful network analyzer (SeLINA), a generic, self-tuning, simple tool to extract knowledge from network traffic measurements. SeLINA includes different data analytics techniques providing self-learning capabilities to state-of-the-art scalable approaches, jointly with parameter auto-selection to off-load the network expert from parameter tuning. We combine both unsupervised and supervised approaches to mine data with a scalable approach. SeLINA embeds mechanisms to check if the new data fits the model, to detect possible changes in the traffic, and to, possibly automatically, trigger model rebuilding. The result is a system that offers human-readable models of the data with minimal user intervention, supporting domain experts in extracting actionable knowledge and highlighting possibly meaningful interpretations. SeLINA's current implementation runs on Apache Spark. We tested it on large collections of real-world passive network measurements from a nationwide ISP, investigating YouTube, and P2P traffic. The experimental results confirmed the ability of SeLINA to provide insights and detect changes in the data that suggest further analyses.

1 April 2015
Verified
Conference Paper
Closed access
LCLuca Cagliero
Luca Cagliero
TCTania Cerquitelli
Tania Cerquitelli
SCSilvia Chiusano
Silvia Chiusano
PGPierangelo Garino
Pierangelo Garino
MNMarco Nardone
Marco Nardone
LVLuca Venturini
Luca Venturini
Sensing the perception of citizens on urban security is a key point in Smart City management. To address non-emergency issues municipalities commonly acquire citizens' reports and then analyze them offline to perform targeted actions. However, since non-emergency data potentially scale towards Big Data there is a need for open standards and technologies to enable data mining and Business Intelligence analyses. The paper presents an integrated data mining and Business Intelligence architecture, relying on open technologies, for the analysis of non-emergency open data acquired in a Smart City context. Non-emergency data are first enriched with additional information related to the context of the warning reports and then analyzed offline to generate (i) informative dashboards based on a selection of Key Performance Indicators (KPIs), and (iii) association rules representing implications between warning categories and contextual information (e.g., city areas, districts, time slots). KPIs and rules are exploited to selectively notify to municipality actors (assessors, area operators) potentially critical situations, according to their role and authority. The experiments demonstrate the effectiveness of the proposed approach in a real Smart City context.

8 December 2017 in Journal of Big Data
Verified
Journal Article
Open access
PDF file
LVLuca Venturini
Luca Venturini
EBElena Baralis
Elena Baralis
PGPaolo Garza
Paolo Garza
Supervised learning algorithms are nowadays successfully scaling up to datasets that are very large in volume, leveraging the potential of in-memory cluster-computing Big Data frameworks. Still, massive datasets with a number of large-domain categorical features are a difficult challenge for any classifier. Most off-the-shelf solutions cannot cope with this problem. In this work we introduce DAC, a Distributed Associative Classifier. DAC exploits ensemble learning to distribute the training of an associative classifier among parallel workers and improve the final quality of the model. Furthermore, it adopts several novel techniques to reach high scalability without sacrificing quality, among which a preventive pruning of classification rules in the extraction phase based on Gini impurity. We ran experiments on Apache Spark, on a real large-scale dataset with more than 4 billion records and 800 million distinct categories. The results showed that DAC improves on a state-of-the-art solution in both prediction quality and execution time. Since the generated model is human-readable, it can not only classify new records, but also allow understanding both the logic behind the prediction and the properties of the model, becoming a useful aid for decision makers.

1 December 2017
Verified
Conference Paper
Open access
LVLuca Venturini
Luca Venturini
ECEvelina Di Corso
Evelina Di Corso
Social media can be an invaluable help in a mass emergency, but the information handling can be challenging. One major concern is identifying posts related to the area, or pinning them on a map. This exploratory study analyzes the spatial data coming with tweets during two natural disasters, an earthquake and a hurricane. Geo-tagged tweets confirm to be a small fraction of all tweets and disasters within a limited region appear to be a niche topic in the whole stream. The results can help researchers and practitioners in the design of tools to identify these messages.

1 April 2016
Verified
Conference Paper
Closed access
DADaniele Apiletti
Daniele Apiletti
EBElena Baralis
Elena Baralis
TCTania Cerquitelli
Tania Cerquitelli
PGPaolo Garza
Paolo Garza
LVLuca Venturini
Luca Venturini
Nowadays, large volumes of data and measurements are being continuously generated by computer and telecommunication networks, but such volumes make it difficult to extract meaningful knowledge from them. This paper presents SaFe-NeC, an innovative methodology for analyzing network traffic by exploiting data mining techniques, i.e. clustering and classification algorithms, focusing on self-learning capabilities of state-of-the-art scalable approaches. Self-learning algorithms, coupled with self-assessment indicators and domain-driven semantics enriching data mining results, are able to build a model of the data with minimal user intervention and highlight possibly meaningful interpretations to domain experts. Furthermore, a self-evolving model evaluation phase is included to continuously track the quality degradation of the model itself, whose rebuilding is triggered as soon as quality indicators fall below a threshold of tolerance. The proposed methodology can exploit the computational advantages of distributed computing frameworks, as the current implementation runs on Apache Spark. Preliminary experimental results on a real traffic dataset show the full potential of the proposed methodology to characterize network traffic data.