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

Hao Wu 0036

dblp:72/4250-36 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 7 · 4 first-authorArtificial intelligence and machine learning · 3 · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 78% Machine learning and data management · 22%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

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

TopicWeightPapersLastEvidence papers
Computing education › computer science curriculum
information retrieval education
0.212014
VIRLab: a web-based virtual lab for learning and studying information retrieval models · SIGIR 2014
Information retrieval
retrieval models
0.212014
VIRLab: a web-based virtual lab for learning and studying information retrieval models · SIGIR 2014
Machine learning and data management › model evaluation
retrieval model evaluation
0.212014
VIRLab: a web-based virtual lab for learning and studying information retrieval models · SIGIR 2014
Information retrieval › relevance feedback
pseudo-relevance feedback
0.212013
An incremental approach to efficient pseudo-relevance feedback · SIGIR 2013
Information retrieval › query reformulation
query expansion
0.212013
An incremental approach to efficient pseudo-relevance feedback · SIGIR 2013
YearPublicationVenuePosition
2014 Document Prioritization for Scalable Query Processing
abstract
Query latency is an important performance measure of any search engines because it directly affects search users' satisfaction. The key challenge is how to efficiently retrieve top-K ranked results for a query. Current search engines process queries in either the conjunctive or disjunctive modes. However, there is still a large performance gap between these two modes since the conjunctive mode is more efficient with lower search accuracy while the disjunctive mode is more effective but requires more time to process the queries.
Hao Wu 0036, Hui Fang 0001
CIKM1
2014 Analytical Performance Modeling for Top-K Query Processing
abstract
Top-K query processing is one of the most important problems in large-scale Information Retrieval systems. Since query processing time varies for different queries, an accurate run-time performance prediction is critical for online query scheduling and load balancing, which could eventually reduce the query waiting time and improve the throughput. Previous studies estimated the query processing time based on the combination of term-level features. Unfortunately, these features were often selected arbitrarily, and the linear combination of these features might not be able to accurately capture the complexity in the query processing.
Hao Wu 0036, Hui Fang 0001
CIKM1
2014 An Exploration of Tie-Breaking for Microblog Retrieval
Yue Wang 0037, Hao Wu 0036, Hui Fang 0001
ECIR2
2014 VIRLab: a web-based virtual lab for learning and studying information retrieval models
abstract
In this paper, we describe VIRLab, a novel web-based virtual laboratory for Information Retrieval (IR). Unlike existing command line based IR toolkits, the VIRLab system provides a more interactive tool that enables easy implementation of retrieval functions with only a few lines of codes, simplified evaluation process over multiple data sets and parameter settings and straightforward result analysis interface through operational search engines and pair-wise comparisons. These features make VIRLab a unique and novel tool that can help teaching IR models, improving the productivity for doing IR model research, as well as promoting controlled experimental study of IR models.
Hui Fang 0001, Hao Wu 0036, ChengXiang Zhai
SIGIR2
2014 Wikimantic: Toward effective disambiguation and expansion of queries
Christopher Boston, Hui Fang 0001, Sandra Carberry, Hao Wu 0036, Xitong Liu
Data Knowl. Eng.4
2013 An incremental approach to efficient pseudo-relevance feedback
abstract
Pseudo-relevance feedback is an important strategy to improve search accuracy. It is often implemented as a two-round retrieval process: the first round is to retrieve an initial set of documents relevant to an original query, and the second round is to retrieve final retrieval results using the original query expanded with terms selected from the previously retrieved documents. This two-round retrieval process is clearly time consuming, which could arguably be one of main reasons that hinder the wide adaptation of the pseudo-relevance feedback methods in real-world IR systems.
Hao Wu 0036, Hui Fang 0001
SIGIR1
2012 Relation Based Term Weighting Regularization
Hao Wu 0036, Hui Fang 0001
ECIR1