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

Richard Kirkby

dblp:16/4096 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Databases, data management, data science and information retrieval · 5Artificial intelligence and machine learning · 4Applied, 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
Data mining · 43% Data stream processing · 43% Machine learning and data management · 15%

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

TopicWeightPapersLastEvidence papers
Data stream processing › evolving data
concept drift
0.222010
MOA: Massive Online Analysis · J. Mach. Learn. Res. 2010
New ensemble methods for evolving data streams · KDD 2009
Machine learning and data management
online learning
0.112010
MOA: Massive Online Analysis · J. Mach. Learn. Res. 2010
Data stream processing
stream mining
0.112010
MOA: Massive Online Analysis · J. Mach. Learn. Res. 2010
Data mining › predictive modeling › classification › ensemble learning
bagging
0.112009
New ensemble methods for evolving data streams · KDD 2009
Data mining
data stream mining
0.112009
New ensemble methods for evolving data streams · KDD 2009
Data mining › predictive modeling › classification
ensemble learning
0.112009
New ensemble methods for evolving data streams · KDD 2009
Data mining › predictive modeling › classification
classifier evaluation
0.012009
New ensemble methods for evolving data streams · KDD 2009

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

incremental learning · 0.1drift detection · 0.1adaptive-size hoeffding tree bagging · 0.1ADWIN Bagging · 0.1
YearPublicationVenuePosition
2010 MOA: Massive Online Analysis
Albert Bifet, Geoff Holmes 0001, Richard Kirkby, Bernhard Pfahringer
J. Mach. Learn. Res.3
2009 New ensemble methods for evolving data streams
abstract
Advanced analysis of data streams is quickly becoming a key area of data mining research as the number of applications demanding such processing increases. Online mining when such data streams evolve over time, that is when concepts drift or change completely, is becoming one of the core issues. When tackling non-stationary concepts, ensembles of classifiers have several advantages over single classifier methods: they are easy to scale and parallelize, they can adapt to change quickly by pruning under-performing parts of the ensemble, and they therefore usually also generate more accurate concept descriptions. This paper proposes a new experimental data stream framework for studying concept drift, and two new variants of Bagging: ADWIN Bagging and Adaptive-Size Hoeffding Tree (ASHT) Bagging. Using the new experimental framework, an evaluation study on synthetic and real-world datasets comprising up to ten million examples shows that the new ensemble methods perform very well compared to several known methods.
Albert Bifet, Geoff Holmes 0001, Bernhard Pfahringer, Richard Kirkby, Ricard Gavaldà
KDD4
2008 Handling Numeric Attributes in Hoeffding Trees
Bernhard Pfahringer, Geoff Holmes 0001, Richard Kirkby
PAKDD3
2005 Stress-Testing Hoeffding Trees
Geoff Holmes 0001, Richard Kirkby, Bernhard Pfahringer
PKDD2
2002 Racing Committees for Large Datasets
Eibe Frank, Geoff Holmes 0001, Richard Kirkby, Mark A. Hall
Discovery Science3
2002 Multiclass Alternating Decision Trees
Geoff Holmes 0001, Bernhard Pfahringer, Richard Kirkby, Eibe Frank, Mark A. Hall
ECML3
2001 Optimizing the Induction of Alternating Decision Trees
Bernhard Pfahringer, Geoff Holmes 0001, Richard Kirkby
PAKDD3