Demo Data from VLDB 2026 / reviewers in the wild / expert
Michael Huber 0001
dblp:36/3234-1
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Information retrieval · 75% Data mining · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › text mining › information extraction
concept mining |
0.1 | 1 | 2010 | Graph-based concept identification and disambiguation for enterprise search · WWW 2010 |
Information retrieval › document retrieval › domain-specific retrieval
enterprise search |
0.1 | 1 | 2010 | Graph-based concept identification and disambiguation for enterprise search · WWW 2010 |
Information retrieval › search engines › semantic search
ontology-based retrieval |
0.1 | 1 | 2010 | Graph-based concept identification and disambiguation for enterprise search · WWW 2010 |
Information retrieval › query understanding
query disambiguation |
0.1 | 1 | 2010 | Graph-based concept identification and disambiguation for enterprise search · WWW 2010 |
Methods — techniques the papers use, named apart from their topics
q-gram matching · 0.1graph-based ranking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Graph-based concept identification and disambiguation for enterprise searchabstractEnterprise Search (ES) is different from traditional IR due to a number of reasons, among which the high level of ambiguity of terms in queries and documents and existence of graph-structured enterprise data (ontologies) that describe the concepts of interest and their relationships to each other, are the most important ones. Our method identifies concepts from the enterprise ontology in the query and corpus. We propose a ranking scheme for ontology sub-graphs on top of approximately matched token q-grams. The ranking leverages the graph-structure of the ontology to incorporate not explicitly mentioned concepts. It improves previous solutions by using a fine-grained ranking function that is specifically designed to cope with high levels of ambiguity. This method is able to capture much more of the semantics of queries and documents than previous techniques. We prove this claim by an evaluation of our method in three real-life scenarios from two different domains, and found it to consistently be superior both in terms of precision and recall. Falk Brauer, Michael Huber 0001, Gregor Hackenbroich, Ulf Leser, Felix Naumann, Wojciech M. Barczynski |
WWW | 2 |