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

Wenhao Gui

dblp:84/10452 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-4318-1780ORCID · verified

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

Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
similarity estimation
0.112010
b-Bit Minwise Hashing for Estimating Three-Way Similarities · NIPS 2010
Information retrieval
similarity measure
0.112010
b-Bit Minwise Hashing for Estimating Three-Way Similarities · NIPS 2010
Algorithms and data structures › data structure design › search structures
hashing
0.112010
b-Bit Minwise Hashing for Estimating Three-Way Similarities · NIPS 2010
Algorithms and data structures › data structure design › search structures › hashing
minwise hashing
0.112010
b-Bit Minwise Hashing for Estimating Three-Way Similarities · NIPS 2010

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

b-bit minwise hashing · 0.2
YearPublicationVenuePosition
2018 Statistical Inference of the Reliability for Generalized Exponential Distribution Under Progressive Type-II Censoring Schemes
abstract
This paper discusses the estimation of R = P (Y <; X) when X and Y are independent generalized exponential random variables with different scale parameters and the same shape parameter based on progressive type-II censoring samples. The maximum likelihood estimator (MLE) of the parameter R is obtained. The approximate MLE (AMLE) of R by the Taylor series expansion is proposed. The asymptotic distribution of R is derived to construct the asymptotic MLE and AMLE confidence intervals. Also, the bootstrap-p and bootstrap-t confidence intervals are constructed. In addition, using the Metropolis-Hasting procedure, we derive the Bayes estimate and the corresponding credible interval. Finally, a Monte Carlo simulation and an analysis of two real datasets are presented to evaluate the various proposed methods.
Wenhao Gui
IEEE Trans. Reliab.2
2010 b-Bit Minwise Hashing for Estimating Three-Way Similarities
abstract
Computing two-way and multi-way set similarities is a fundamental problem. This study focuses on estimating 3-way resemblance (Jaccard similarity) using b-bit minwise hashing. While traditional minwise hashing methods store each hashed value using 64 bits, b-bit minwise hashing only stores the lowest b bits (where b>= 2 for 3-way). The extension to 3-way similarity from the prior work on 2-way similarity is technically non-trivial. We develop the precise estimator which is accurate and very complicated; and we recommend a much simplified estimator suitable for sparse data. Our analysis shows that $b$-bit minwise hashing can normally achieve a 10 to 25-fold improvement in the storage space required for a given estimator accuracy of the 3-way resemblance.
Ping Li 0001, Arnd Christian König, Wenhao Gui
NIPS3