Andrea De Lorenzo

Dr. Andrea De Lorenzo

University of Trieste, Trieste, Friuli-Venezia Giulia, Italy
orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
7 January 2016 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Alberto BartoliAlberto Bartoli
Alberto Bartoli
Andrea De LorenzoAndrea De Lorenzo
Andrea De Lorenzo
Eric MedvetEric Medvet
Eric Medvet
FTFabiano Tarlao
Fabiano Tarlao
A large class of entity extraction tasks from text that is either semistructured or fully unstructured may be addressed by regular expressions, because in many practical cases the relevant entities follow an underlying syntactical pattern and this pattern may be described by a regular expression. In this work, we consider the long-standing problem of synthesizing such expressions automatically, based solely on examples of the desired behavior. We present the design and implementation of a system capable of addressing extraction tasks of realistic complexity. Our system is based on an evolutionary procedure carefully tailored to the specific needs of regular expression generation by examples. The procedure executes a search driven by a multiobjective optimization strategy aimed at simultaneously improving multiple performance indexes of candidate solutions while at the same time ensuring an adequate exploration of the huge solution space. We assess our proposal experimentally in great depth, on a number of challenging datasets. The accuracy of the obtained solutions seems to be adequate for practical usage and improves over earlier proposals significantly. Most importantly, our results are highly competitive even with respect to human operators. A prototype is available as a web application at <;uri xlink:type="simple">http://regex.inginf.units.it<;/uri>.

1 August 2015
Verified
Conference Paper
Closed access
GCGerardo Canfora
Gerardo Canfora
Andrea De LorenzoAndrea De Lorenzo
Andrea De Lorenzo
Eric MedvetEric Medvet
Eric Medvet
FMFrancesco Mercaldo
Francesco Mercaldo
CVCorrado Aaron Visaggio
Corrado Aaron Visaggio
With the wide diffusion of smartphones and their usage in a plethora of processes and activities, these devices have been handling an increasing variety of sensitive resources. Attackers are hence producing a large number of malware applications for Android (the most spread mobile platform), often by slightly modifying existing applications, which results in malware being organized in families. Some works in the literature showed that opcodes are informative for detecting malware, not only in the Android platform. In this paper, we investigate if frequencies of ngrams of opcodes are effective in detecting Android malware and if there is some significant malware family for which they are more or less effective. To this end, we designed a method based on state-of-the-art classifiers applied to frequencies of opcodes ngrams. Then, we experimentally evaluated it on a recent dataset composed of 11120 applications, 5560 of which are malware belonging to several different families. Results show that an accuracy of 97% can be obtained on the average, whereas perfect detection rate is achieved for more than one malware family.

22 December 2014 in Computer
Verified
Journal Article
Closed access
Alberto BartoliAlberto Bartoli
Alberto Bartoli
GDGiorgio Davanzo
Giorgio Davanzo
Andrea De LorenzoAndrea De Lorenzo
Andrea De Lorenzo
EMEric Medvet
Eric Medvet
ESEnrico Sorio
Enrico Sorio
A system that can produce regular expressions from user-provided examples performed with high precision and recall in 12 text-extraction tasks from real-world datasets, demonstrating the effectiveness of text extraction based on genetic programming.

1 February 2020 in Journal of Information Security and Applications
Verified
Journal Article
Closed access
Andrea De LorenzoAndrea De Lorenzo
Andrea De Lorenzo
FMFabio Martinelli
Fabio Martinelli
EMEric Medvet
Eric Medvet
FMFrancesco Mercaldo
Francesco Mercaldo
ASAntonella Santone
Antonella Santone

7 July 2012
Verified
Conference Paper
Open access
PDF file
Alberto BartoliAlberto Bartoli
Alberto Bartoli
GDGiorgio Davanzo
Giorgio Davanzo
Andrea De LorenzoAndrea De Lorenzo
Andrea De Lorenzo
MMMarco Mauri
Marco Mauri
Eric MedvetEric Medvet
Eric Medvet
ESEnrico Sorio
Enrico Sorio
We explore the practical feasibility of a system based on genetic programming (GP) for the automatic generation of regular expressions. The user describes the desired task by providing a set of labeled examples, in the form of text lines. The system uses these examples for driving the evolutionary search towards a regular expression suitable for the specified task. Usage of the system should require neither familiarity with GP nor with regular expressions syntax. In our GP implementation each individual represents a syntactically correct regular expression. We performed an experimental evaluation on two different extraction tasks applied to real-world datasets and obtained promising results in terms of precision and recall, even in comparison to an earlier state-of-the-art proposal

24 March 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
Alberto BartoliAlberto Bartoli
Alberto Bartoli
Andrea De LorenzoAndrea De Lorenzo
Andrea De Lorenzo
EMEric Medvet
Eric Medvet
FTFabiano Tarlao
Fabiano Tarlao
We consider the automatic synthesis of an entity extractor, in the form of a regular expression, from examples of the desired extractions in an unstructured text stream. This is a long-standing problem for which many different approaches have been proposed, which all require the preliminary construction of a large dataset fully annotated by the user. In this paper, we propose an active learning approach aimed at minimizing the user annotation effort: the user annotates only one desired extraction and then merely answers extraction queries generated by the system. During the learning process, the system digs into the input text for selecting the most appropriate extraction query to be submitted to the user in order to improve the current extractor. We construct candidate solutions with genetic programming (GP) and select queries with a form of querying-by-committee, i.e., based on a measure of disagreement within the best candidate solutions. All the components of our system are carefully tailored to the peculiarities of active learning with GP and of entity extraction from unstructured text. We evaluate our proposal in depth, on a number of challenging datasets and based on a realistic estimate of the user effort involved in answering each single query. The results demonstrate high accuracy with significant savings in terms of computational effort, annotated characters, and execution time over a state-of-the-art baseline.