VLDB 2026 Research / reviewers in the wild / expert
Shaofeng Bu
dblp:83/4650
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 first-author
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.
| Network and information security
1 paper |
Privacy and data protection · 100% | |
| Databases, data mining, and information retrieval
2 papers |
Data mining · 100% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy-preserving computation
input privacy |
0.1 | 1 | 2007 | Preservation Of Patterns and Input-Output Privacy · ICDE 2007 |
Privacy and data protection › privacy-preserving data analysis
output privacy |
0.1 | 1 | 2007 | Preservation Of Patterns and Input-Output Privacy · ICDE 2007 |
Privacy and data protection
privacy-preserving data analysis |
0.1 | 1 | 2007 | Preservation Of Patterns and Input-Output Privacy · ICDE 2007 |
Data mining
pattern mining |
0.1 | 1 | 2005 | MDL Summarization with Holes · VLDB 2005 |
Data mining › predictive modeling › classification
decision tree mining |
0.0 | 1 | 2007 | Preservation Of Patterns and Input-Output Privacy · ICDE 2007 |
Information theory
minimum description length |
0.0 | 1 | 2005 | MDL Summarization with Holes · VLDB 2005 |
Methods — techniques the papers use, named apart from their topics
random perturbation · 0.1decision tree induction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Preservation Of Patterns and Input-Output PrivacyabstractPrivacy preserving data mining so far has mainly focused on the data collector scenario where individuals supply their personal data to an untrusted collector in exchange for value. In this scenario, random perturbation has proved to be very successful. An equally compelling, but overlooked scenario, is that of a data custodian, which either owns the data or is explicitly entrusted with ensuring privacy of individual data. In this scenario, we show that it is possible to minimize disclosure while guaranteeing no outcome change. We conduct our investigation in the context of building a decision tree and propose transformations that preserve the exact decision tree. We show with a detailed set of experiments that they provide substantial protection to both input data privacy and mining output privacy. Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng, Ganesh Ramesh |
ICDE | 1 |
| 2005 | MDL Summarization with Holes
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng |
VLDB | 1 |