Alberto Bartoli

Prof. Alberto Bartoli

University of Trieste
orcid

Research Focus & Metrics

Academic Career Length

36Years (1991-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>.

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.

5 November 2010 in International Journal on Document Analysis and Recognition (IJDAR)
Verified
Journal Article
Closed access
PDF file
Eric MedvetEric Medvet
Eric Medvet
Alberto BartoliAlberto Bartoli
Alberto Bartoli
GDGiorgio Davanzo
Giorgio Davanzo

18 March 2015
Verified
Book Chapter
Closed access
PDF file
Eric MedvetEric Medvet
Eric Medvet
Alberto BartoliAlberto Bartoli
Alberto Bartoli
BCBarbara Carminati
Barbara Carminati
EFElena Ferrari
Elena Ferrari

13 November 2002
Verified
Conference Paper
Closed access
BKB. Kemme
B. Kemme
Alberto BartoliAlberto Bartoli
Alberto Bartoli
OBO. Babaoglu
O. Babaoglu

1 November 2014
Verified
Conference Paper
Closed access
Eric MedvetEric Medvet
Eric Medvet
Alberto BartoliAlberto Bartoli
Alberto Bartoli
GPGiulio Piccinin
Giulio Piccinin
We consider the problem of matching the topics of a scientific paper with those of possible publication venues for that paper. While every researcher knows the few top-level venues for his specific fields of interest, a venue recommendation system may be a significant aid when starting to explore a new research field. We propose a venue recommendation system which requires only title and abstract, differently from previous works which require full-text and reference list: hence, our system can be used even in the early stages of the authoring process and greatly simplifies the building and maintenance of the knowledge base necessary for generating meaningful recommendations. We assessed our proposal using a standard metric on a dataset of more than 58000 papers: the results show that our method provides recommendations whose quality is aligned with previous works, while requiring much less information from both the paper and the knowledge base.