Back to authors
Slava Novgorodov
- Author ID
- 1069
- ORCID
-
-
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Tel Aviv University
- Pagerank
- 0.10327764
- Overall Rank
- 598 | 97.14%
- 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,805 |
Query-Oriented Data Cleaning with Oracles |
2015 |
SIGMOD |
8.103731e-05 |
| 3,916 |
Rudolf: Interactive Rule Refinement System for Fraud Detection |
2016 |
VLDB |
6.6282452e-05 |
| 7,112 |
Answering Planning Queries with the Crowd |
2013 |
VLDB |
4.8227734e-05 |
| 7,224 |
OASSIS: Query Driven Crowd Mining |
2014 |
SIGMOD |
4.791302e-05 |
| 7,451 |
PHOcus: Efficiently Archiving Photos |
2022 |
VLDB |
4.7218383e-05 |
| 8,690 |
Managing General and Individual Knowledge in Crowd Mining Applications |
2015 |
CIDR |
4.4618888e-05 |
| 9,054 |
GOLDRUSH: Rule Sharing System for Fraud Detection |
2018 |
VLDB |
4.3997447e-05 |
| 9,214 |
Ontology Assisted Crowd Mining |
2014 |
VLDB |
4.3680645e-05 |
| 9,218 |
QOCO: A Query Oriented Data Cleaning System with Oracles |
2015 |
VLDB |
4.3672293e-05 |
| 9,963 |
Classifier Construction Under Budget Constraints |
2022 |
SIGMOD |
4.2229209e-05 |
| 10,465 |
Sentence to Model: Cost-Effective Data Collection LLM Agent |
2025 |
SIGMOD |
4.1905499e-05 |
| 11,585 |
MC3: A System for Minimization of Classifier Construction Cost |
2020 |
SIGMOD |
4.1905499e-05 |
| 11,599 |
Minimization of Classifier Construction Cost for Search Queries |
2020 |
SIGMOD |
4.1905499e-05 |
| 11,615 |
CONCIERGE: Improving Constrained Search Results by Data Melioration |
2020 |
VLDB |
4.1905499e-05 |
| 11,685 |
WiClean: A System for Fixing Wikipedia Interlinks Using Revision History Patterns |
2019 |
VLDB |
4.1905499e-05 |
| 13,228 |
Automated Category Tree Construction in E-Commerce |
2022 |
SIGMOD |
- |
Frequent Co-authors
Co-authored at least 5 papers.