Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
83
Voted
KAIS
2007
117
views
more
KAIS 2007
»
Finding the most unusual time series subsequence: algorithms and applications
15 years 2 months ago
Download
www.faculty.ucr.edu
Eamonn J. Keogh, Jessica Lin, Sang-Hee Lee, Helga
Real-time Traffic
KAIS 2007
|
claim paper
Related Content
»
HOT SAX Efficiently Finding the Most Unusual Time Series Subsequence
»
Approximations to Magic Finding Unusual Medical Time Series
»
Disk Aware Discord Discovery Finding Unusual Time Series in Terabyte Sized Datasets
»
Searching and mining trillions of time series subsequences under dynamic time warping
»
WAT Finding TopK Discords in Time Series Database
»
Ranked Subsequence Matching in TimeSeries Databases
»
Finding Time Series Discords Based on Haar Transform
»
Mining asynchronous periodic patterns in time series data
»
Online Eventdriven Subsequence Matching over Financial Data Streams
more »
Post Info
More Details (n/a)
Added
16 Dec 2010
Updated
16 Dec 2010
Type
Journal
Year
2007
Where
KAIS
Authors
Eamonn J. Keogh, Jessica Lin, Sang-Hee Lee, Helga Van Herle
Comments
(0)
Researcher Info
KAIS 2000 Study Group
Computer Vision