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

Thomas Pierce

dblp:45/14 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 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
Information retrieval · 48% Data mining · 34% Web and social media mining · 18%
Artificial intelligence
1 paper
Learning theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › model selection
cross-validation
0.012000
Combining Multiple Learning Strategies for Effective Cross Validation · ICML 2000
Information retrieval › information filtering › topic tracking
event tracking
0.012000
Improving text categorization methods for event tracking · SIGIR 2000
Data mining › text mining
text classification
0.012000
Improving text categorization methods for event tracking · SIGIR 2000
Information retrieval › text analysis › topic analysis
topic detection and tracking
0.012000
Improving text categorization methods for event tracking · SIGIR 2000
Web and social media mining
event detection
0.011998
A Study of Retrospective and On-Line Event Detection · SIGIR 1998
Machine learning › Learning theory
model selection
0.012000
Combining Multiple Learning Strategies for Effective Cross Validation · ICML 2000
Data mining › clustering
document clustering
0.011998
A Study of Retrospective and On-Line Event Detection · SIGIR 1998
Data mining › clustering
hierarchical clustering
0.011998
A Study of Retrospective and On-Line Event Detection · SIGIR 1998

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

rocchio · 0.0k-nearest neighbor · 0.0cross-validation · 0.0text retrieval · 0.0temporal analysis · 0.0
YearPublicationVenuePosition
2000 Combining Multiple Learning Strategies for Effective Cross Validation
Yiming Yang 0002, Tom Ault, Thomas Pierce
ICML3
2000 Improving text categorization methods for event tracking
abstract
Automated tracking of events from chronologically ordered document streams is a new challenge for statistical text classification. Existing learning techniques must be adapted or improved in order to effectively handle difficult situations where the number of positive training instances per event is extremely small, the majority of training documents are unlabelled, and most of the events have a short duration in time. We adapted several supervised text categorization methods, specifically several new variants of the k-Nearest Neighbor (kNN) algorithm and a Rocchio approach, to track events. All of these methods showed significant improvement (up to 71% reduction in weighted error rates) over the performance of the original kNN algorithm on TDT benchmark collections, making kNN among the top-performing systems in the recent TDT3 official evaluation. Furthermore, by combining these methods, we significantly reduced the variance in performance of our event tracking system over different data collections, suggesting a robust solution for parameter optimization.
Yiming Yang 0002, Tom Ault, Thomas Pierce, Charles W. Lattimer
SIGIR3
1998 A Study of Retrospective and On-Line Event Detection
abstract
This paper investigates the use and extension of text retrieval and clustering techniques for event detection. The task is to automatically detect novel events from a temporally-ordered stream of news stories, either retrospectively or as the stories arrive. We applied hierarchical and non-hierarchical document clustering algorithms to a corpus of 15,836 stories, focusing on the exploitation of both content and temporal information. We found the resulting cluster hierarchies highly informative for retrospective detection of previously unidentified events, effectively supporting both query-free and query-driven retrieval. We also found that temporal distribution patterns of document clusters provide useful information for improvement in both retrospective detection and on-line detection of novel events. In an evaluation using manually labelled events to judge the system-detected events, we obtained a result of 82% in the Fl measure for retrospective detection, and a Fl value of 42% for on-line detection.
Yiming Yang 0002, Thomas Pierce, Jaime G. Carbonell
SIGIR2