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

Nora Derouiche

dblp:30/8510 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 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 integration and cleaning · 92% Knowledge graphs · 4% Query processing and optimization · 3%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning › data extraction › web data extraction
template-based extraction
0.322012
Automatic Extraction of Structured Web Data with Domain Knowledge · ICDE 2012
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data · Proc. VLDB Endow. 2010
Data integration and cleaning
data extraction
0.112012
Automatic Extraction of Structured Web Data with Domain Knowledge · ICDE 2012
Data integration and cleaning › data extraction
structured data extraction
0.112012
Automatic Extraction of Structured Web Data with Domain Knowledge · ICDE 2012
Data integration and cleaning › data extraction
web data extraction
0.112012
Automatic Extraction of Structured Web Data with Domain Knowledge · ICDE 2012
Data integration and cleaning › data extraction
structured web data extraction
0.112010
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data · Proc. VLDB Endow. 2010
Data integration and cleaning
web data integration
0.112010
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data · Proc. VLDB Endow. 2010
Knowledge graphs
knowledge graph construction
0.012012
Automatic Extraction of Structured Web Data with Domain Knowledge · ICDE 2012

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

two-phase querying · 0.1domain knowledge · 0.1best-effort extraction · 0.1
YearPublicationVenuePosition
2012 Automatic Extraction of Structured Web Data with Domain Knowledge
abstract
We present in this paper a novel approach for extracting structured data from the Web, whose goal is to harvest real-world items from template-based HTML pages (the structured Web). It illustrates a two-phase querying of the Web, in which an intentional description of the data that is targeted is first provided, in a flexible and widely applicable manner. The extraction process leverages then both the input description and the source structure. Our approach is domain-independent, in the sense that it applies to any relation, either flat or nested, describing real-world items. Extensive experiments on five different domains and comparison with the main state of the art extraction systems from literature illustrate its flexibility and precision. We advocate via our technique that automatic extraction and integration of complex structured data can be done fast and effectively, when the redundancy of the Web meets knowledge over the to-be-extracted data.
Nora Derouiche, Bogdan Cautis, Talel Abdessalem
ICDE1
2010 ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data
abstract
We present in this paper ObjectRunner, a system for extracting, integrating and querying structured data from the Web. Our system harvests real-world items from template-based HTML pages (the so-called structured Web). It illustrates a two-phase querying of the Web, in which an intentional description of the targeted data is first provided, in a flexible and widely applicable manner. ObjectRunner follows then a lightweight, best-effort approach, leveraging both the input description and the source structure. This process is domain-independent, in the sense that it applies to any relation, either flat or nested, describing real-world items. We advocate via our prototype that fully automatic extraction and integration of structured data can be done fast and effectively, when the redundancy of the Web meets knowledge over the to-be-extracted data. We present the technical details and the overall platform through several application scenarios on real-life Web sources.
Talel Abdessalem, Bogdan Cautis, Nora Derouiche
Proc. VLDB Endow.3