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

Henry Haining Zhang

dblp:49/4840 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 3Applied, 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
2 papers
Web and social media mining · 44% Distributed and cloud data management · 25% Information retrieval · 19%

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

TopicWeightPapersLastEvidence papers
Web and social media mining
web usage mining
0.122003
Web-Log Mining for Predictive Web Caching · IEEE Trans. Knowl. Data Eng. 2003
Mining web logs for prediction models in WWW caching and prefetching · KDD 2001
Distributed and cloud data management
web caching
0.012003
Web-Log Mining for Predictive Web Caching · IEEE Trans. Knowl. Data Eng. 2003
Information retrieval
web search
0.012001
Mining web logs for prediction models in WWW caching and prefetching · KDD 2001
Indexing and storage engines › buffer management
page replacement
0.012003
Web-Log Mining for Predictive Web Caching · IEEE Trans. Knowl. Data Eng. 2003
Data mining
pattern mining
0.012001
Mining web logs for prediction models in WWW caching and prefetching · KDD 2001

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

n-gram prediction · 0.0GDSF · 0.0web log mining · 0.0GDSF caching policy · 0.0
YearPublicationVenuePosition
2003 Web-Log Mining for Predictive Web Caching
abstract
Caching is a well-known strategy for improving the performance of Web-based systems. The heart of a caching system is its page replacement policy, which selects the pages to be replaced in a cache when a request arrives. In this paper, we present a Web-log mining method for caching Web objects and use this algorithm to enhance the performance of Web caching systems. In our approach, we develop an n-gram-based prediction algorithm that can predict future Web requests. The prediction model is then used to extend the well-known GDSF caching policy. We empirically show that the system performance is improved using the predictive-caching approach.
Qiang Yang 0001, Henry Haining Zhang
IEEE Trans. Knowl. Data Eng.2
2001 Mining High-Quality Cases for Hypertext Prediction and Prefetching
Qiang Yang 0001, Tianyi Li 0001, Henry Haining Zhang
ICCBR3
2001 Mining web logs for prediction models in WWW caching and prefetching
abstract
Web caching and prefetching are well known strategies for improving the performance of Internet systems. When combined with web log mining, these strategies can decide to cache and prefetch web documents with higher accuracy. In this paper, we present an application of web log mining to obtain web-document access patterns and use these patterns to extend the well-known GDSF caching policies and prefetching policies. Using real web logs, we show that this application of data mining can achieve dramatic improvement to web-access performance.
Qiang Yang 0001, Henry Haining Zhang, Tianyi Li 0001
KDD2
2001 Mining Web Logs to Improve Web Caching and Prefetching
Qiang Yang 0001, Henry Haining Zhang, Tianyi Li 0001
Web Intelligence2
2001 Integrating Web Prefetching Using Prediction Models
Qiang Yang 0001, Henry Haining Zhang
World Wide Web2