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

Stella Luk

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

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

Databases, 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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › pattern mining › itemset mining
frequent itemset mining
0.112005
Scrutinizing Frequent Pattern Discovery Performance · ICDE 2005
Data mining
pattern mining
0.112005
Scrutinizing Frequent Pattern Discovery Performance · ICDE 2005
Performance modeling and evaluation › benchmarking
algorithm benchmarking
0.112005
Scrutinizing Frequent Pattern Discovery Performance · ICDE 2005
Performance modeling and evaluation
benchmarking
0.112005
Scrutinizing Frequent Pattern Discovery Performance · ICDE 2005

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

performance benchmarking · 0.1
YearPublicationVenuePosition
2005 Scrutinizing Frequent Pattern Discovery Performance
abstract
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been an important issue in databases and has played a significant role in the development, deployment and adoption of technologies. To help assessing the myriad algorithms for frequent itemset mining, we built an open framework and testbed to analytically study the performance of different algorithms and their implementations, and contrast their achievements given different data characteristics, different conditions, and different types of patterns to discover and their constraints. This facilitates reporting consistent and reproducible performance results using known conditions.
Osmar R. Zaïane, Stella Luk
ICDE4