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

Yu Guo Wang

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

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

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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
Data mining · 91% Data models and query languages · 9%

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

TopicWeightPapersLastEvidence papers
Data mining › pattern mining
frequent pattern mining
0.012004
Incremental Mining of Frequent XML Query Pattern · ICDM 2004
Data mining
incremental mining
0.012004
Incremental Mining of Frequent XML Query Pattern · ICDM 2004
Data mining
pattern mining
0.012004
Incremental Mining of Frequent XML Query Pattern · ICDM 2004
Data models and query languages
XML data management
0.012004
Incremental Mining of Frequent XML Query Pattern · ICDM 2004

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

frequent structure mining · 0.0
YearPublicationVenuePosition
2004 Incremental Mining of Frequent XML Query Pattern
abstract
The discovering of frequent XML query patterns gains its focus due to its many applications in XML data management, and several algorithms have been proposed to discover frequent query patterns using the frequent structure mining techniques. In this paper we consider the problem of incremental mining of frequent XML query patterns. We propose a method to minimize the I/O and computation requirements for handling incremental updates.
Lianghuai Yang, Yu Guo Wang
ICDM3