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

Daniel M. Herzig

dblp:45/7002 · also Daniel Markus Herzig · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2013
—ORCID · none

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

Databases, data management, data science and information retrieval · 8 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 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
Information retrieval · 72% Data integration and cleaning · 28%

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

TopicWeightPapersLastEvidence papers
Information retrieval › evaluation › evaluation methodology
crowdsourced evaluation
0.112011
Repeatable and reliable search system evaluation using crowdsourcing · SIGIR 2011
Information retrieval
retrieval evaluation
0.112011
Repeatable and reliable search system evaluation using crowdsourcing · SIGIR 2011
Information retrieval › search engines
structured data search
0.012012
Heterogeneous web data search using relevance-based on the fly data integration · WWW 2012
Information retrieval › search engines › semantic search › entity retrieval
ad-hoc object retrieval
0.012011
Repeatable and reliable search system evaluation using crowdsourcing · SIGIR 2011
Information retrieval › image retrieval
object retrieval
0.012011
Repeatable and reliable search system evaluation using crowdsourcing · SIGIR 2011

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

keyword search · 0.1entity relevance model · 0.1crowdsourcing · 0.1
YearPublicationVenuePosition
2013 Federated Entity Search Using On-the-Fly Consolidation
Daniel M. Herzig, Peter Mika, Roi Blanco, Thanh Tran 0001
ISWC (1)1
2013 Repeatable and reliable semantic search evaluation
Roi Blanco, Harry Halpin, Daniel M. Herzig, Peter Mika, Jeffrey Pound, Henry S. Thompson, Thanh Tran 0001
J. Web Semant.3
2012 Heterogeneous web data search using relevance-based on the fly data integration
abstract
Searching over heterogeneous structured data on the Web is challenging due to vocabulary and structure mismatches among different data sources. In this paper, we study two existing strategies and present a new approach to integrate additional data sources into the search process. The first strategy relies on data integration to mediate mismatches through upfront computation of mappings, based on which queries are rewritten to fit individual sources. The other extreme is keyword search, which does not require any up-front investment, but ignores structure information. Building on these strategies, we present a hybrid approach, which combines the advantages of both. Our approach does not require any upfront data integration, but also leverages the fine grained structure of the underlying data. For a structured query adhering to the vocabulary of just one source, the so-called seed query, we construct an entity relevance model (ERM), which captures the content and the structure of the seed query results. This ERM is then aligned on the fly with keyword search results retrieved from other sources and also used to rank these results. The outcome of our experiments using large-scale real-world data sets suggests that data integration leads to higher search effectiveness compared to keyword search and that our new hybrid approach consistently exceeds both strategies.
Daniel M. Herzig, Thanh Tran 0001
WWW1
2011 Hybrid Search Ranking for Structured and Unstructured Data
Daniel M. Herzig
ESWC (2)1
2011 Repeatable and reliable search system evaluation using crowdsourcing
abstract
The primary problem confronting any new kind of search task is how to boot-strap a reliable and repeatable evaluation campaign, and a crowd-sourcing approach provides many advantages. However, can these crowd-sourced evaluations be repeated over long periods of time in a reliable manner? To demonstrate, we investigate creating an evaluation campaign for the semantic search task of keyword-based ad-hoc object retrieval. In contrast to traditional search over web-pages, object search aims at the retrieval of information from factual assertions about real-world objects rather than searching over web-pages with textual descriptions. Using the first large-scale evaluation campaign that specifically targets the task of ad-hoc Web object retrieval over a number of deployed systems, we demonstrate that crowd-sourced evaluation campaigns can be repeated over time and still maintain reliable results. Furthermore, we show how these results are comparable to expert judges when ranking systems and that the results hold over different evaluation and relevance metrics. This work provides empirical support for scalable, reliable, and repeatable search system evaluation using crowdsourcing.
Roi Blanco, Harry Halpin, Daniel M. Herzig, Peter Mika, Jeffrey Pound, Henry S. Thompson, Thanh Tran 0001
SIGIR3
2011 SemSearchPro - Using semantics throughout the search process
Thanh Tran 0001, Daniel M. Herzig, Günter Ladwig
J. Web Semant.2
2010 Semantic MediaWiki in Operation: Experiences with Building a Semantic Portal
Daniel M. Herzig, Basil Ell
ISWC (2)1
2009 Semantic Wiki Search
Peter Haase 0001, Daniel M. Herzig, Mark A. Musen, Thanh Tran 0001
ESWC2