Demo Data from EDBT 2026 / reviewers in the wild / expert
Sarah Zelikovitz
dblp:25/2211
· DBLP profile ↗
8ranked-venue papers
5as first author
3since 2021 · last 2025
0009-0008-8563-3427ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 first-authorDatabases, data management, data science and information retrieval · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 since 2021
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.
| Artificial intelligence
2 papers |
Information extraction and text analysis · 47% Knowledge representation and reasoning · 26% Learning paradigms · 13% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
text classification |
0.1 | 2 | 2003 | Integrating Background Knowledge Into Text Classification · IJCAI 2003 Improving Short-Text Classification using Unlabeled Data for Classification Problems · ICML 2000 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge incorporation |
0.0 | 1 | 2003 | Integrating Background Knowledge Into Text Classification · IJCAI 2003 |
Machine learning › Learning paradigms
semi-supervised learning |
0.0 | 1 | 2000 | Improving Short-Text Classification using Unlabeled Data for Classification Problems · ICML 2000 |
Natural language and speech › Information extraction and text analysis › text classification
short text classification |
0.0 | 1 | 2000 | Improving Short-Text Classification using Unlabeled Data for Classification Problems · ICML 2000 |
Machine learning › Representation and self-supervised learning
unlabeled data |
0.0 | 1 | 2000 | Improving Short-Text Classification using Unlabeled Data for Classification Problems · ICML 2000 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
background knowledge |
0.0 | 1 | 2003 | Integrating Background Knowledge Into Text Classification · IJCAI 2003 |
Methods — techniques the papers use, named apart from their topics
text classification · 0.0semi-supervised learning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Exact and inexact search for 2d side-sharing tandems
Shoshana Marcus, Dina Sokol, Sarah Zelikovitz |
Theor. Comput. Sci. | 3 |
| 2024 | 2d Side-Sharing Tandems with Mismatches
Shoshana Marcus, Dina Sokol, Sarah Zelikovitz |
SPIRE | 3 |
| 2023 | Runs of Side-Sharing Tandems in Rectangular Arrays
Shoshana Marcus, Dina Sokol, Sarah Zelikovitz |
SISAP | 3 |
| 2007 | Extending WHIRL with background knowledge for improved text classification
Sarah Zelikovitz, William W. Cohen, Haym Hirsh |
Inf. Retr. | 1 |
| 2005 | Transductive Learning For Short-Text Classification Problems Using Latent Semantic IndexingabstractThis paper presents work that uses Transductive Latent Semantic Indexing (LSI) for text classification. In addition to relying on labeled training data, we improve classification accuracy by incorporating the set of test examples in the classification process. Rather than performing LSI's singular value decomposition (SVD) process solely on the training data, we instead use an expanded term-by-document matrix that includes both the labeled data as well as any available test examples. We report the performance of LSI on data sets both with and without the inclusion of the test examples, and we show that tailoring the SVD process to the test examples can be even more useful than adding additional training data. This method can be especially useful to combat possible inclusion of unrelated data in the original corpus, and to compensate for limited amounts of data. Additionally, we evaluate the vocabulary of the training and test sets and present the results of a series of experiments to illustrate how the test set is used in an advantageous way. Sarah Zelikovitz, Finella Marquez |
Int. J. Pattern Recognit. Artif. Intell. | 1 |
| 2003 | Integrating Background Knowledge Into Text Classification
Sarah Zelikovitz, Haym Hirsh |
IJCAI | 1 |
| 2001 | Using LSI for Text Classification in the Presence of Background TextabstractThis paper presents work that uses Latent Semantic Indexing (LSI) for text classification. However, in addition to relying on labeled training data, we improve classification accuracy by also using unlabeled data and other forms of available "background" text in the classification process. Rather than performing LSI's singular value decomposition (SVD) process solely on the training data, we instead use an expanded term-by-document matrix that includes both the labeled data as well as any available and relevant background text. We report the performance of this approach on data sets both with and without the inclusion of the background text, and compare our work to other efforts that can incorporate unlabeled data and other background text in the classification process. Sarah Zelikovitz, Haym Hirsh |
CIKM | 1 |
| 2000 | Improving Short-Text Classification using Unlabeled Data for Classification Problems
Sarah Zelikovitz, Haym Hirsh |
ICML | 1 |