Demo Data from EDBT 2026 / reviewers in the wild / expert
V. Finley Lacatusu
dblp:26/5833
· DBLP profile ↗
8ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 4Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers |
Information retrieval · 100% | |
| Artificial intelligence
2 papers |
Question answering and dialogue systems · 50% Knowledge representation and reasoning · 25% Information extraction and text analysis · 25% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › text summarization
multi-document summarization |
0.2 | 3 | 2010 | Using topic themes for multi-document summarization · ACM Trans. Inf. Syst. 2010 Answering complex questions with random walk models · SIGIR 2006 Topic themes for multi-document summarization · SIGIR 2005 |
Information retrieval › text summarization › multi-document summarization
topic-focused summarization |
0.1 | 1 | 2010 | Using topic themes for multi-document summarization · ACM Trans. Inf. Syst. 2010 |
Natural language and speech › Question answering and dialogue systems › knowledge base question answering
complex question answering |
0.1 | 1 | 2006 | Answering complex questions with random walk models · SIGIR 2006 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic in computer science |
0.1 | 1 | 2006 | Negation, Contrast and Contradiction in Text Processing · AAAI 2006 |
Natural language and speech › Information extraction and text analysis
natural language semantics |
0.1 | 1 | 2006 | Negation, Contrast and Contradiction in Text Processing · AAAI 2006 |
Natural language and speech › Question answering and dialogue systems › question understanding
question decomposition |
0.1 | 1 | 2006 | Answering complex questions with random walk models · SIGIR 2006 |
Information retrieval
retrieval models |
0.1 | 1 | 2006 | Answering complex questions with random walk models · SIGIR 2006 |
Information retrieval › text summarization
summarization evaluation |
0.0 | 1 | 2005 | Topic themes for multi-document summarization · SIGIR 2005 |
Methods — techniques the papers use, named apart from their topics
random walk · 0.1markov chain · 0.1bipartite graph · 0.1topic representation · 0.1topic theme representation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Using topic themes for multi-document summarizationabstractThe problem of using topic representations for multidocument summarization (MDS) has received considerable attention recently. Several topic representations have been employed for producing informative and coherent summaries. In this article, we describe five previously known topic representations and introduce two novel representations of topics based on topic themes. We present eight different methods of generating multidocument summaries and evaluate each of these methods on a large set of topics used in past DUC workshops. Our evaluation results show a significant improvement in the quality of summaries based on topic themes over MDS methods that use other alternative topic representations. Sanda M. Harabagiu, V. Finley Lacatusu |
ACM Trans. Inf. Syst. | 2 |
| 2007 | Satisfying information needs with multi-document summaries
Sanda M. Harabagiu, Andrew Hickl, V. Finley Lacatusu |
Inf. Process. Manag. | 3 |
| 2006 | Negation, Contrast and Contradiction in Text Processing
Sanda M. Harabagiu, Andrew Hickl, V. Finley Lacatusu |
AAAI | 3 |
| 2006 | Impact of Question Decomposition on the Quality of Answer Summaries
V. Finley Lacatusu, Andrew Hickl, Sanda M. Harabagiu |
LREC | 1 |
| 2006 | Answering complex questions with random walk modelsabstractWe present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain, by following a random walk on a bipartite graph of relations established between concepts related to the topic of a complex question and subquestions derived from topic-relevant passages that manifest these relations. Decomposed questions discovered during this random walk are then submitted to a state-of-the-art Question Answering (Q/A) system in order to retrieve a set of passages that can later be merged into a comprehensive answer by a Multi-Document Summarization (MDS) system. In our evaluations, we show that access to the decompositions generated using this method can significantly enhance the relevance and comprehensiveness of summary-length answers to complex questions. Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hickl |
SIGIR | 2 |
| 2005 | Topic themes for multi-document summarizationabstractThe problem of using topic representations for multi-document summarization (MDS) has received considerable attention recently. In this paper, we describe five different topic representations and introduce a novel representation of topics based on topic themes. We present eight different methods of generating MDS and evaluate each of these methods on a large set of topics used in past DUC workshops. Our evaluation results show a significant improvement in the quality of summaries based on topic themes over MDS methods that use other alternative topic representations. Sanda M. Harabagiu, V. Finley Lacatusu |
SIGIR | 2 |
| 2004 | Multi-Document Summarization Using Multiple-Sequence Alignment
V. Finley Lacatusu, Steven J. Maiorano, Sanda M. Harabagiu |
LREC | 1 |
| 2002 | Multidocument Summarization with GISTexter
Sanda M. Harabagiu, V. Finley Lacatusu, Paul Morarescu |
LREC | 2 |