Demo Data from VLDB 2026 / reviewers in the wild / expert
Jayashree Sharma
dblp:326/4121
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
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 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 · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 2 heaviest of 3, 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 mining
topic mining |
0.6 | 1 | 2022 | A Model-Agnostic Approach to Differentially Private Topic Mining · KDD 2022 |
Privacy and data protection
differential privacy |
0.6 | 1 | 2022 | A Model-Agnostic Approach to Differentially Private Topic Mining · KDD 2022 |
Methods — techniques the papers use, named apart from their topics
sensitivity sampling · 1.1rényi differential privacy · 1.1gaussian mechanism · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | A Model-Agnostic Approach to Differentially Private Topic MiningabstractTopic mining extracts patterns and insights from text data (e.g., documents, emails and product reviews), which can be used in various applications such as intent detection. However, topic mining can result in severe privacy threats to the users who have contributed to the text corpus since they can be re-identified from the text data with certain background knowledge. To our best knowledge, we propose the first differentially private topic mining technique (namely TopicDP) which injects well-calibrated Gaussian noise into the matrix output of any topic mining algorithm to ensure differential privacy and good utility. Specifically, we smoothen the sensitivity for the Gaussian mechanism via sensitivity sampling, which addresses the major challenges resulted from the high sensitivity in topic mining for differential privacy. Furthermore, we theoretically prove the differential privacy guarantee under the Rényi differential privacy mechanism and the utility error bounds of TopicDP. Finally, we conduct extensive experiments on two real-word text datasets (Enron email and Amazon Reviews), and the experimental results demonstrate that TopicDP is a model-agnostic framework that can generate better privacy preserving performance for topic mining as compared against other differential privacy mechanisms. Han Wang 0021, Jayashree Sharma, Shuya Feng, Kai Shu, Yuan Hong 0001 |
KDD | 2 |