Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wuxuan Jiang

dblp:172/1347 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 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%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › differential privacy › private matrix approximation
differentially private PCA
0.212016
Wishart Mechanism for Differentially Private Principal Components Analysis · AAAI 2016
Privacy and data protection
differential privacy
0.212016
Wishart Mechanism for Differentially Private Principal Components Analysis · AAAI 2016
Privacy and data protection › randomization
input perturbation
0.212016
Wishart Mechanism for Differentially Private Principal Components Analysis · AAAI 2016
Privacy and data protection
privacy-preserving data analysis
0.212016
Wishart Mechanism for Differentially Private Principal Components Analysis · AAAI 2016

Methods — techniques the papers use, named apart from their topics

wishart mechanism · 0.5exponential mechanism · 0.5covariance matrix perturbation · 0.5
YearPublicationVenuePosition
2016 Wishart Mechanism for Differentially Private Principal Components Analysis
abstract
We propose a new input perturbation mechanism for publishing a covariance matrix to achieve (epsilon,0)-differential privacy. Our mechanism uses a Wishart distribution to generate matrix noise. In particular, we apply this mechanism to principal component analysis (PCA). Our mechanism is able to keep the positive semi-definiteness of the published covariance matrix. Thus, our approach gives rise to a general publishing framework for input perturbation of a symmetric positive semidefinite matrix. Moreover, compared with the classic Laplace mechanism, our method has better utility guarantee. To the best of our knowledge, the Wishart mechanism is the best input perturbation approach for (epsilon,0)-differentially private PCA. We also compare our work with previous exponential mechanism algorithms in the literature and provide near optimal bound while having more flexibility and less computational intractability.
Wuxuan Jiang, Zhihua Zhang 0008
AAAI1