Eamonn Keogh

Eamonn Keogh

Auto-generated profile, based on publicly available information

Eamonn Keogh

UC Riverside, Riverside, CA, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2005 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
EKEamonn Keogh
Eamonn Keogh
CRChotirat Ann Ratanamahatana
Chotirat Ann Ratanamahatana

3 April 2007 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
JLJessica Lin
Jessica Lin
EKEamonn Keogh
Eamonn Keogh
LWLi Wei
Li Wei
Stefano LonardiStefano Lonardi
Stefano Lonardi

10 February 2012 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
XWXiaoyue Wang
Xiaoyue Wang
AMAbdullah Mueen
Abdullah Mueen
HDHui Ding
Hui Ding
GTGoce Trajcevski
Goce Trajcevski
PSPeter Scheuermann
Peter Scheuermann
EKEamonn Keogh
Eamonn Keogh

1 October 2003 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
EKEamonn Keogh
Eamonn Keogh
SKShruti Kasetty
Shruti Kasetty

5 January 2006
Verified
Conference Paper
Closed access
EKE. Keogh
E. Keogh
JLJ. Lin
J. Lin
AFA. Fu
A. Fu

18 June 2010 in Data Mining and Knowledge Discovery
Verified
Journal Article
Open access
PDF file
LYLexiang Ye
Lexiang Ye
EKEamonn Keogh
Eamonn Keogh
Classification of time series has been attracting great interest over the past decade. While dozens of techniques have been introduced, recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm is very difficult to beat for most time series problems, especially for large-scale datasets. While this may be considered good news, given the simplicity of implementing the nearest neighbor algorithm, there are some negative consequences of this. First, the nearest neighbor algorithm requires storing and searching the entire dataset, resulting in a high time and space complexity that limits its applicability, especially on resource-limited sensors. Second, beyond mere classification accuracy, we often wish to gain some insight into the data and to make the classification result more explainable, which global characteristics of the nearest neighbor cannot provide. In this work we introduce a new time series primitive, time series shapelets, which addresses these limitations. Informally, shapelets are time series subsequences which are in some sense maximally representative of a class. We can use the distance to the shapelet, rather than the distance to the nearest neighbor to classify objects. As we shall show with extensive empirical evaluations in diverse domains, classification algorithms based on the time series shapelet primitives can be interpretable, more accurate, and significantly faster than state-of-the-art classifiers.