Back to authors
Slava Novgorodov
- Author ID
- 1066
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Tel Aviv University
- Pagerank
- 0.11211611
- Overall Rank
- 573 | 97.28%
- Paper Count
- 16
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 16 of 16 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,570 |
Query-Oriented Data Cleaning with Oracles |
2015 |
SIGMOD |
8.4061164e-05 |
| 5,253 |
Rudolf: Interactive Rule Refinement System for Fraud Detection |
2016 |
VLDB |
6.2989009e-05 |
| 6,471 |
QOCO: A Query Oriented Data Cleaning System with Oracles |
2015 |
VLDB |
5.8702801e-05 |
| 7,018 |
Answering Planning Queries with the Crowd |
2013 |
VLDB |
5.7251004e-05 |
| 7,081 |
OASSIS: Query Driven Crowd Mining |
2014 |
SIGMOD |
5.7086247e-05 |
| 7,478 |
PHOcus: Efficiently Archiving Photos |
2022 |
VLDB |
5.6081446e-05 |
| 8,788 |
Managing General and Individual Knowledge in Crowd Mining Applications |
2015 |
CIDR |
5.3726124e-05 |
| 9,205 |
GOLDRUSH: Rule Sharing System for Fraud Detection |
2018 |
VLDB |
5.3058708e-05 |
| 9,275 |
Ontology Assisted Crowd Mining |
2014 |
VLDB |
5.2940303e-05 |
| 10,112 |
Classifier Construction Under Budget Constraints |
2022 |
SIGMOD |
5.1319012e-05 |
| 10,736 |
Sentence to Model: Cost-Effective Data Collection LLM Agent |
2025 |
SIGMOD |
5.093636e-05 |
| 11,777 |
MC3: A System for Minimization of Classifier Construction Cost |
2020 |
SIGMOD |
5.093636e-05 |
| 11,790 |
Minimization of Classifier Construction Cost for Search Queries |
2020 |
SIGMOD |
5.093636e-05 |
| 11,806 |
CONCIERGE: Improving Constrained Search Results by Data Melioration |
2020 |
VLDB |
5.093636e-05 |
| 11,875 |
WiClean: A System for Fixing Wikipedia Interlinks Using Revision History Patterns |
2019 |
VLDB |
5.093636e-05 |
| 13,417 |
Automated Category Tree Construction in E-Commerce |
2022 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.