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

Jason R. Chen

dblp:33/4858 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

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 · 80% Information retrieval · 20%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.112005
Making Subsequence Time Series Clustering Meaningful · ICDM 2005
Data mining
distance metric
0.112005
Making Subsequence Time Series Clustering Meaningful · ICDM 2005
Information retrieval
similarity measure
0.112005
Making Subsequence Time Series Clustering Meaningful · ICDM 2005
Data mining › clustering › sequence clustering
subsequence clustering
0.112005
Making Subsequence Time Series Clustering Meaningful · ICDM 2005
Data mining › clustering
time series clustering
0.112005
Making Subsequence Time Series Clustering Meaningful · ICDM 2005

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

euclidean distance · 0.1alternative distance measure · 0.1
YearPublicationVenuePosition
2007 Making clustering in delay-vector space meaningful
Jason R. Chen
Knowl. Inf. Syst.1
2005 Making Subsequence Time Series Clustering Meaningful
abstract
The startling claim was made that sequential time series clustering is meaningless. This has important consequences for a significant amount of work in the literature, since such a claim invalidates this work's contribution. In this paper, we show that sequential time series clustering is not meaningless, and that the problem highlighted in these works stem from their use of the Euclidean distance metric as the distance measure in the subsequence vector space. As a solution, we consider quite a general class of time series, and propose a regime based on two types of similarity that can exist between subsequence vectors, which give rise naturally to an alternative distance measure to Euclidean distance in the subsequence vector space. We show that, using this alternative distance measure, sequential time series clustering can indeed be meaningful. We repeat a key experiment in the work on which the "meaningless" claim was based, and show that our method leads to a successful clustering outcome.
Jason R. Chen
ICDM1