Demo Data from VLDB 2026 / reviewers in the wild / expert
Wong Wei Pin
dblp:222/9904
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 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.
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › data structure design › search structures › hashing
locality-sensitive hashing |
0.3 | 1 | 2018 | Improving Sign Random Projections With Additional Information · ICML 2018 |
Algorithms and data structures › numerical linear algebra › dimensionality reduction
random projection |
0.3 | 1 | 2018 | Improving Sign Random Projections With Additional Information · ICML 2018 |
Algorithms and data structures
similarity estimation |
0.3 | 1 | 2018 | Improving Sign Random Projections With Additional Information · ICML 2018 |
Information retrieval › similarity search
nearest neighbor search |
0.1 | 1 | 2018 | Improving Sign Random Projections With Additional Information · ICML 2018 |
Methods — techniques the papers use, named apart from their topics
variance analysis · 0.7hashing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Improving Hashing Algorithms for Similarity Search \textitvia MLE and the Control Variates Trick
Keegan Kang, Sergey Kushnarev, Wong Wei Pin, Rameshwar Pratap, Haikal Yeo |
ACML | 3 |
| 2018 | Improving Sign Random Projections With Additional InformationabstractSign random projections (SRP) is a technique which allows the user to quickly estimate the angular similarity and inner products between data. We propose using additional information to improve these estimates which is easy to implement and cost efficient. We prove that the variance of our estimator is lower than the variance of SRP. Our proposed method can also be used together with other modifications of SRP, such as Super-Bit LSH (SBLSH). We demonstrate the effectiveness of our method on the MNIST test dataset and the Gisette dataset. We discuss how our proposed method can be extended to random projections or even other hashing algorithms. Keegan Kang, Wong Wei Pin |
ICML | 2 |