Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lorenzo Blanco

dblp:93/6762 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2013
0009-0008-5038-1821ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 6 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 first-authorArtificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 43% Data integration and cleaning · 42% Web and social media mining · 14%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning › data extraction
web data extraction
0.122011
Exploiting information redundancy to wring out structured data from the web · WWW 2010
Highly efficient algorithms for structural clustering of large websites · WWW 2011
Data mining
clustering
0.112011
Highly efficient algorithms for structural clustering of large websites · WWW 2011
Data mining › clustering › graph clustering
structural clustering
0.112011
Highly efficient algorithms for structural clustering of large websites · WWW 2011
Data mining › clustering › document clustering
web page clustering
0.112011
Highly efficient algorithms for structural clustering of large websites · WWW 2011
Web and social media mining › web mining
website clustering
0.112011
Highly efficient algorithms for structural clustering of large websites · WWW 2011
Data integration and cleaning › data extraction
structured data extraction
0.112010
Exploiting information redundancy to wring out structured data from the web · WWW 2010
Data integration and cleaning
web data integration
0.112010
Exploiting information redundancy to wring out structured data from the web · WWW 2010

Methods — techniques the papers use, named apart from their topics

information theory · 0.1
YearPublicationVenuePosition
2013 Future Locations Prediction with Uncertain Data
Disheng Qiu, Paolo Papotti, Lorenzo Blanco
ECML/PKDD (1)3
2011 Highly efficient algorithms for structural clustering of large websites
abstract
In this paper, we present a highly scalable algorithm for structurally clustering webpages for extraction. We show that, using only the URLs of the webpages and simple content features, it is possible to cluster webpages effectively and efficiently. At the heart of our techniques is a principled framework, based on the principles of information theory, that allows us to effectively leverage the URLs, and combine them with content and structural properties. Using an extensive evaluation over several large full websites, we demonstrate the effectiveness of our techniques, at a scale unattainable by previous techniques.
Lorenzo Blanco, Nilesh N. Dalvi, Ashwin Machanavajjhala
WWW1
2010 Probabilistic Models to Reconcile Complex Data from Inaccurate Data Sources
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, Paolo Papotti
CAiSE1
2010 Redundancy-Driven Web Data Extraction and Integration
abstract
A large number of web sites publish pages containing structured information about recognizable concepts, but these data are only partially used by current applications. Although such information is spread across a myriad of sources, the web scale implies a relevant redundancy. We present a domain independent system that exploits the redundancy of information to automatically extract and integrate data from the Web. Our solution concentrates on sources that provide structured data about multiple instances from the same conceptual domain, e.g., financial data, product information. Our proposal is based on an original approach that exploits the mutual dependency between the data extraction and the data integration tasks. Experiments on a sample of 175,000 pages confirm the feasibility and quality of the approach.
Paolo Papotti, Valter Crescenzi, Paolo Merialdo, Mirko Bronzi, Lorenzo Blanco
WebDB5
2010 Exploiting information redundancy to wring out structured data from the web
abstract
A large number of web sites publish pages containing structured information about recognizable concepts, but these data are only partially used by current applications. Although such information is spread across a myriad of sources, the web scale implies a relevant redundancy. We present a domain independent system that exploits the redundancy of information to automatically extract and integrate data from the Web. Our solution concentrates on sources that provide structured data about multiple instances from the same conceptual domain, e.g. financial data, product information. Our proposal is based on an original approach that exploits the mutual dependency between the data extraction and the data integration tasks. Experiments confirmed the quality and the feasibility of the approach.
Lorenzo Blanco, Mirko Bronzi, Valter Crescenzi, Paolo Merialdo, Paolo Papotti
WWW1
2008 Flint: Google-basing the Web
abstract
Several Web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Even though it is easy for a human reader to recognize these instances, current search engines are unaware of them. Technologies for the Semantic Web aim at achieving this goal; however, so far they have been of little help in this respect, as semantic publishing is very limited.
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, Paolo Papotti
EDBT1
2005 Efficiently Locating Collections of Web Pages to Wrap
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo
WEBIST1