Demo Data from EDBT 2026 / reviewers in the wild / expert
Negin Karisani
dblp:202/9585
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Information extraction and text analysis · 67% Transfer learning and domain adaptation · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
self-training |
0.5 | 1 | 2021 | Semi-Supervised Text Classification via Self-Pretraining · WSDM 2021 |
Natural language and speech › Information extraction and text analysis › text classification
semi-supervised text classification |
0.5 | 1 | 2021 | Semi-Supervised Text Classification via Self-Pretraining · WSDM 2021 |
Natural language and speech › Information extraction and text analysis
text classification |
0.5 | 1 | 2021 | Semi-Supervised Text Classification via Self-Pretraining · WSDM 2021 |
Methods — techniques the papers use, named apart from their topics
self-training · 0.5pseudo-labeling · 0.5knowledge distillation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Computing the Homology Functor on Semi-algebraic Maps and Diagrams
Saugata Basu, Negin Karisani |
Discret. Comput. Geom. | 2 |
| 2021 | Semi-Supervised Text Classification via Self-PretrainingabstractWe present a neural semi-supervised learning model termed Self-Pretraining. Our model is inspired by the classic self-training algorithm. However, as opposed to self-training, Self-Pretraining is threshold-free, it can potentially update its belief about previously labeled documents, and can cope with the semantic drift problem. Self-Pretraining is iterative and consists of two classifiers. In each iteration, one classifier draws a random set of unlabeled documents and labels them. This set is used to initialize the second classifier, to be further trained by the set of labeled documents. The algorithm proceeds to the next iteration and the classifiers' roles are reversed. To improve the flow of information across the iterations and also to cope with the semantic drift problem, Self-Pretraining employs an iterative distillation process, transfers hypotheses across the iterations, utilizes a two-stage training model, uses an efficient learning rate schedule, and employs a pseudo-label transformation heuristic. We have evaluated our model in three publicly available social media datasets. Our experiments show that Self-Pretraining outperforms the existing state-of-the-art semi-supervised classifiers across multiple settings. Our code is available at https://github.com/p-karisani/self-pretraining . Payam Karisani, Negin Karisani |
WSDM | 2 |